About the Execution of ITS-Tools for CANInsertWithFailure-PT-010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3057.915 | 2112108.00 | 3039990.00 | 4655.30 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r070-tall-171620505100101.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is CANInsertWithFailure-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r070-tall-171620505100101
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.0K Apr 22 14:32 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:32 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 698K May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-010-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716236513991
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-20 20:21:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-20 20:21:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-20 20:21:55] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-20 20:21:55] [INFO ] Transformed 324 places.
[2024-05-20 20:21:55] [INFO ] Transformed 660 transitions.
[2024-05-20 20:21:55] [INFO ] Parsed PT model containing 324 places and 660 transitions and 1800 arcs in 214 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 660 rows 324 cols
[2024-05-20 20:21:55] [INFO ] Computed 13 invariants in 38 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 10, 10, 1, 10, 10, 10, 10, 10, 10, 10, 1, 1, 10, 10]
RANDOM walk for 10000 steps (44 resets) in 40 ms. (243 steps per ms)
FORMULA CANInsertWithFailure-PT-010-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130012 steps (74 resets) in 108 ms. (1192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-20 20:21:55] [INFO ] Invariant cache hit.
[2024-05-20 20:21:55] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-05-20 20:21:55] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 6 ms returned sat
[2024-05-20 20:21:56] [INFO ] [Real]Absence check using state equation in 299 ms returned sat
[2024-05-20 20:21:56] [INFO ] State equation strengthened by 190 read => feed constraints.
[2024-05-20 20:21:56] [INFO ] [Real]Added 190 Read/Feed constraints in 20 ms returned sat
[2024-05-20 20:21:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:21:56] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-20 20:21:56] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:21:56] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2024-05-20 20:21:56] [INFO ] [Nat]Added 190 Read/Feed constraints in 51 ms returned sat
[2024-05-20 20:21:56] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 45 ms.
[2024-05-20 20:21:57] [INFO ] Added : 47 causal constraints over 10 iterations in 455 ms. Result :sat
Minimization took 588 ms.
[2024-05-20 20:21:57] [INFO ] [Real]Absence check using 11 positive place invariants in 8 ms returned sat
[2024-05-20 20:21:57] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-20 20:21:57] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2024-05-20 20:21:57] [INFO ] [Real]Added 190 Read/Feed constraints in 17 ms returned sat
[2024-05-20 20:21:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:21:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:21:57] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:21:58] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-20 20:21:58] [INFO ] [Nat]Added 190 Read/Feed constraints in 73 ms returned sat
[2024-05-20 20:21:58] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 45 ms.
[2024-05-20 20:21:58] [INFO ] Added : 39 causal constraints over 8 iterations in 341 ms. Result :sat
Minimization took 501 ms.
[2024-05-20 20:21:59] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:21:59] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:21:59] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2024-05-20 20:21:59] [INFO ] [Real]Added 190 Read/Feed constraints in 33 ms returned sat
[2024-05-20 20:21:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:21:59] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:21:59] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:21:59] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2024-05-20 20:21:59] [INFO ] [Nat]Added 190 Read/Feed constraints in 70 ms returned sat
[2024-05-20 20:21:59] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 34 ms.
[2024-05-20 20:21:59] [INFO ] Added : 46 causal constraints over 10 iterations in 391 ms. Result :sat
Minimization took 501 ms.
[2024-05-20 20:22:00] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:00] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:00] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2024-05-20 20:22:00] [INFO ] [Real]Added 190 Read/Feed constraints in 21 ms returned sat
[2024-05-20 20:22:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:00] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:00] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-20 20:22:00] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-20 20:22:00] [INFO ] [Nat]Added 190 Read/Feed constraints in 80 ms returned sat
[2024-05-20 20:22:00] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 35 ms.
[2024-05-20 20:22:01] [INFO ] Added : 47 causal constraints over 10 iterations in 410 ms. Result :sat
Minimization took 501 ms.
[2024-05-20 20:22:01] [INFO ] [Real]Absence check using 11 positive place invariants in 14 ms returned sat
[2024-05-20 20:22:01] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:01] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2024-05-20 20:22:02] [INFO ] [Real]Added 190 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:22:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:02] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:02] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:02] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-20 20:22:02] [INFO ] [Nat]Added 190 Read/Feed constraints in 48 ms returned sat
[2024-05-20 20:22:02] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 34 ms.
[2024-05-20 20:22:02] [INFO ] Added : 36 causal constraints over 8 iterations in 311 ms. Result :sat
Minimization took 501 ms.
[2024-05-20 20:22:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:03] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned unsat
[2024-05-20 20:22:03] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:03] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 5 ms returned sat
[2024-05-20 20:22:03] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2024-05-20 20:22:03] [INFO ] [Real]Added 190 Read/Feed constraints in 21 ms returned sat
[2024-05-20 20:22:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:03] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:03] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-20 20:22:03] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-05-20 20:22:03] [INFO ] [Nat]Added 190 Read/Feed constraints in 54 ms returned sat
[2024-05-20 20:22:03] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 35 ms.
[2024-05-20 20:22:04] [INFO ] Added : 55 causal constraints over 11 iterations in 445 ms. Result :sat
Minimization took 504 ms.
[2024-05-20 20:22:04] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:04] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned unsat
[2024-05-20 20:22:04] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-20 20:22:04] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-20 20:22:04] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2024-05-20 20:22:04] [INFO ] [Real]Added 190 Read/Feed constraints in 22 ms returned sat
[2024-05-20 20:22:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:04] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:04] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 20:22:05] [INFO ] [Nat]Absence check using state equation in 105 ms returned sat
[2024-05-20 20:22:05] [INFO ] [Nat]Added 190 Read/Feed constraints in 49 ms returned sat
[2024-05-20 20:22:05] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 34 ms.
[2024-05-20 20:22:05] [INFO ] Added : 38 causal constraints over 8 iterations in 302 ms. Result :sat
Minimization took 501 ms.
[2024-05-20 20:22:05] [INFO ] [Real]Absence check using 11 positive place invariants in 6 ms returned sat
[2024-05-20 20:22:05] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:06] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2024-05-20 20:22:06] [INFO ] [Real]Added 190 Read/Feed constraints in 17 ms returned sat
[2024-05-20 20:22:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:06] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2024-05-20 20:22:06] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:06] [INFO ] [Nat]Absence check using state equation in 111 ms returned sat
[2024-05-20 20:22:06] [INFO ] [Nat]Added 190 Read/Feed constraints in 40 ms returned sat
[2024-05-20 20:22:06] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 36 ms.
[2024-05-20 20:22:06] [INFO ] Added : 29 causal constraints over 6 iterations in 268 ms. Result :sat
Minimization took 501 ms.
[2024-05-20 20:22:07] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:07] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:07] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2024-05-20 20:22:07] [INFO ] [Real]Added 190 Read/Feed constraints in 17 ms returned sat
[2024-05-20 20:22:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:07] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:07] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:07] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-05-20 20:22:07] [INFO ] [Nat]Added 190 Read/Feed constraints in 47 ms returned sat
[2024-05-20 20:22:07] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 35 ms.
[2024-05-20 20:22:07] [INFO ] Added : 46 causal constraints over 10 iterations in 359 ms. Result :sat
Minimization took 505 ms.
[2024-05-20 20:22:08] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:08] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:08] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-05-20 20:22:08] [INFO ] [Real]Added 190 Read/Feed constraints in 18 ms returned sat
[2024-05-20 20:22:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:08] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:08] [INFO ] [Nat]Absence check using 11 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:08] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-20 20:22:08] [INFO ] [Nat]Added 190 Read/Feed constraints in 54 ms returned sat
[2024-05-20 20:22:08] [INFO ] Computed and/alt/rep : 620/990/620 causal constraints (skipped 30 transitions) in 51 ms.
[2024-05-20 20:22:09] [INFO ] Added : 36 causal constraints over 8 iterations in 332 ms. Result :sat
Minimization took 501 ms.
[2024-05-20 20:22:09] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2024-05-20 20:22:09] [INFO ] [Real]Absence check using 11 positive and 2 generalized place invariants in 3 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 1, 10, 1, 10, 10, 10, 10, 1]
FORMULA CANInsertWithFailure-PT-010-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA CANInsertWithFailure-PT-010-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 324 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 324/324 places, 660/660 transitions.
Graph (complete) has 951 edges and 324 vertex of which 323 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 70 transitions
Trivial Post-agglo rules discarded 70 transitions
Performed 70 trivial Post agglomeration. Transition count delta: 70
Iterating post reduction 0 with 70 rules applied. Total rules applied 71 place count 323 transition count 590
Reduce places removed 70 places and 0 transitions.
Iterating post reduction 1 with 70 rules applied. Total rules applied 141 place count 253 transition count 590
Performed 87 Post agglomeration using F-continuation condition.Transition count delta: 87
Deduced a syphon composed of 87 places in 0 ms
Reduce places removed 87 places and 0 transitions.
Iterating global reduction 2 with 174 rules applied. Total rules applied 315 place count 166 transition count 503
Drop transitions (Redundant composition of simpler transitions.) removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 2 with 69 rules applied. Total rules applied 384 place count 166 transition count 434
Partial Free-agglomeration rule applied 111 times.
Drop transitions (Partial Free agglomeration) removed 111 transitions
Iterating global reduction 2 with 111 rules applied. Total rules applied 495 place count 166 transition count 434
Applied a total of 495 rules in 108 ms. Remains 166 /324 variables (removed 158) and now considering 434/660 (removed 226) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 166/324 places, 434/660 transitions.
// Phase 1: matrix 434 rows 166 cols
[2024-05-20 20:22:09] [INFO ] Computed 12 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (19919 resets) in 2629 ms. (380 steps per ms)
BEST_FIRST walk for 10000008 steps (19504 resets) in 5580 ms. (1791 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-20 20:22:18] [INFO ] Invariant cache hit.
[2024-05-20 20:22:18] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:18] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:18] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-20 20:22:18] [INFO ] State equation strengthened by 387 read => feed constraints.
[2024-05-20 20:22:18] [INFO ] [Real]Added 387 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:22:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:18] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:18] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:18] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-20 20:22:18] [INFO ] [Nat]Added 387 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:22:18] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 33 ms.
[2024-05-20 20:22:18] [INFO ] Added : 7 causal constraints over 2 iterations in 95 ms. Result :sat
Minimization took 276 ms.
[2024-05-20 20:22:18] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 20:22:18] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:18] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-20 20:22:18] [INFO ] [Real]Added 387 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:22:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Nat]Added 387 Read/Feed constraints in 33 ms returned sat
[2024-05-20 20:22:19] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 22 ms.
[2024-05-20 20:22:19] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 270 ms.
[2024-05-20 20:22:19] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Real]Added 387 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:22:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:19] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-20 20:22:19] [INFO ] [Nat]Added 387 Read/Feed constraints in 30 ms returned sat
[2024-05-20 20:22:19] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 22 ms.
[2024-05-20 20:22:19] [INFO ] Added : 10 causal constraints over 3 iterations in 108 ms. Result :sat
Minimization took 272 ms.
[2024-05-20 20:22:20] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:20] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:22:20] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-20 20:22:20] [INFO ] [Real]Added 387 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:22:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:20] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 20:22:20] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:20] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-20 20:22:20] [INFO ] [Nat]Added 387 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:22:20] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 21 ms.
[2024-05-20 20:22:20] [INFO ] Added : 7 causal constraints over 2 iterations in 99 ms. Result :sat
Minimization took 279 ms.
[2024-05-20 20:22:20] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-20 20:22:20] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Real]Added 387 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Nat]Added 387 Read/Feed constraints in 31 ms returned sat
[2024-05-20 20:22:21] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 23 ms.
[2024-05-20 20:22:21] [INFO ] Added : 11 causal constraints over 3 iterations in 108 ms. Result :sat
Minimization took 280 ms.
[2024-05-20 20:22:21] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Real]Added 387 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:22:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:21] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-05-20 20:22:21] [INFO ] [Nat]Added 387 Read/Feed constraints in 30 ms returned sat
[2024-05-20 20:22:21] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 25 ms.
[2024-05-20 20:22:21] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 265 ms.
[2024-05-20 20:22:22] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 20:22:22] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:22] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-20 20:22:22] [INFO ] [Real]Added 387 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:22:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:22] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:22] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:22] [INFO ] [Nat]Absence check using state equation in 65 ms returned sat
[2024-05-20 20:22:22] [INFO ] [Nat]Added 387 Read/Feed constraints in 35 ms returned sat
[2024-05-20 20:22:22] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 22 ms.
[2024-05-20 20:22:22] [INFO ] Added : 12 causal constraints over 3 iterations in 118 ms. Result :sat
Minimization took 295 ms.
[2024-05-20 20:22:23] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Real]Added 387 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:22:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Nat]Added 387 Read/Feed constraints in 31 ms returned sat
[2024-05-20 20:22:23] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 24 ms.
[2024-05-20 20:22:23] [INFO ] Added : 6 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 277 ms.
[2024-05-20 20:22:23] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Real]Added 387 Read/Feed constraints in 27 ms returned sat
[2024-05-20 20:22:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-20 20:22:23] [INFO ] [Nat]Added 387 Read/Feed constraints in 27 ms returned sat
[2024-05-20 20:22:23] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 19 ms.
[2024-05-20 20:22:24] [INFO ] Added : 6 causal constraints over 2 iterations in 88 ms. Result :sat
Minimization took 250 ms.
[2024-05-20 20:22:24] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-05-20 20:22:24] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:24] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-20 20:22:24] [INFO ] [Real]Added 387 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:22:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:22:24] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:22:24] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:22:24] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2024-05-20 20:22:24] [INFO ] [Nat]Added 387 Read/Feed constraints in 30 ms returned sat
[2024-05-20 20:22:24] [INFO ] Computed and/alt/rep : 282/727/282 causal constraints (skipped 142 transitions) in 25 ms.
[2024-05-20 20:22:24] [INFO ] Added : 5 causal constraints over 1 iterations in 79 ms. Result :sat
Minimization took 253 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 166 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 15 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 166/166 places, 434/434 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 166/166 places, 434/434 transitions.
Applied a total of 0 rules in 9 ms. Remains 166 /166 variables (removed 0) and now considering 434/434 (removed 0) transitions.
[2024-05-20 20:22:25] [INFO ] Invariant cache hit.
[2024-05-20 20:22:25] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-20 20:22:25] [INFO ] Invariant cache hit.
[2024-05-20 20:22:25] [INFO ] State equation strengthened by 387 read => feed constraints.
[2024-05-20 20:22:25] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
[2024-05-20 20:22:25] [INFO ] Redundant transitions in 26 ms returned []
Running 424 sub problems to find dead transitions.
[2024-05-20 20:22:25] [INFO ] Invariant cache hit.
[2024-05-20 20:22:25] [INFO ] State equation strengthened by 387 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 2 places in 109 ms of which 10 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 2 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 2 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 10 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:22:27] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 2 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 14 places in 63 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 3 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 11 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:22:28] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:22:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:22:30] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:22:30] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 1 ms to minimize.
[2024-05-20 20:22:30] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 19 places in 24 ms of which 0 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 2 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 20 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:22:31] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:22:32] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:22:32] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:22:32] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:22:32] [INFO ] Deduced a trap composed of 2 places in 56 ms of which 3 ms to minimize.
[2024-05-20 20:22:32] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:22:32] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:22:32] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 0 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:22:33] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:22:34] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 17 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:22:35] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 0 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 16 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:22:37] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:22:38] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:22:39] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:22:39] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:22:39] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-20 20:22:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/165 variables, 16/128 constraints. Problems are: Problem set: 0 solved, 424 unsolved
[2024-05-20 20:22:40] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:22:40] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:22:41] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:22:41] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:22:41] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/165 variables, 5/133 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/165 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 424 unsolved
At refinement iteration 10 (OVERLAPS) 434/599 variables, 165/298 constraints. Problems are: Problem set: 0 solved, 424 unsolved
Problem TDEAD332 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD433 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/599 variables, 387/685 constraints. Problems are: Problem set: 9 solved, 415 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/599 variables, 0/685 constraints. Problems are: Problem set: 9 solved, 415 unsolved
SMT process timed out in 30177ms, After SMT, problems are : Problem set: 9 solved, 415 unsolved
Search for dead transitions found 9 dead transitions in 30196ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 166/166 places, 425/434 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 159 transition count 411
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 159 transition count 411
Applied a total of 14 rules in 14 ms. Remains 159 /166 variables (removed 7) and now considering 411/425 (removed 14) transitions.
// Phase 1: matrix 411 rows 159 cols
[2024-05-20 20:22:55] [INFO ] Computed 12 invariants in 6 ms
[2024-05-20 20:22:56] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-05-20 20:22:56] [INFO ] Invariant cache hit.
[2024-05-20 20:22:56] [INFO ] State equation strengthened by 371 read => feed constraints.
[2024-05-20 20:22:56] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 159/166 places, 411/434 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 31581 ms. Remains : 159/166 places, 411/434 transitions.
[2024-05-20 20:22:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (19930 resets) in 2373 ms. (421 steps per ms)
BEST_FIRST walk for 10000010 steps (19474 resets) in 5476 ms. (1825 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-20 20:23:04] [INFO ] Invariant cache hit.
[2024-05-20 20:23:04] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:04] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:04] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-20 20:23:04] [INFO ] State equation strengthened by 371 read => feed constraints.
[2024-05-20 20:23:04] [INFO ] [Real]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:23:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:04] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:04] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:04] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-20 20:23:04] [INFO ] [Nat]Added 371 Read/Feed constraints in 36 ms returned sat
[2024-05-20 20:23:04] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 20 ms.
[2024-05-20 20:23:04] [INFO ] Added : 9 causal constraints over 2 iterations in 88 ms. Result :sat
Minimization took 238 ms.
[2024-05-20 20:23:05] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Real]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:23:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Nat]Added 371 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:23:05] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 20 ms.
[2024-05-20 20:23:05] [INFO ] Added : 6 causal constraints over 2 iterations in 85 ms. Result :sat
Minimization took 224 ms.
[2024-05-20 20:23:05] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Real]Added 371 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:23:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:05] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:05] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:06] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-20 20:23:06] [INFO ] [Nat]Added 371 Read/Feed constraints in 33 ms returned sat
[2024-05-20 20:23:06] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 25 ms.
[2024-05-20 20:23:06] [INFO ] Added : 11 causal constraints over 3 iterations in 116 ms. Result :sat
Minimization took 224 ms.
[2024-05-20 20:23:06] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:06] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:23:06] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-05-20 20:23:06] [INFO ] [Real]Added 371 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:23:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:06] [INFO ] [Nat]Absence check using 10 positive place invariants in 8 ms returned sat
[2024-05-20 20:23:06] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:06] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-20 20:23:06] [INFO ] [Nat]Added 371 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:23:06] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 26 ms.
[2024-05-20 20:23:06] [INFO ] Added : 7 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 218 ms.
[2024-05-20 20:23:07] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Real]Added 371 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Nat]Added 371 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:23:07] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 24 ms.
[2024-05-20 20:23:07] [INFO ] Added : 6 causal constraints over 2 iterations in 91 ms. Result :sat
Minimization took 196 ms.
[2024-05-20 20:23:07] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Real]Absence check using state equation in 67 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Real]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:23:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:07] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-20 20:23:07] [INFO ] [Nat]Added 371 Read/Feed constraints in 34 ms returned sat
[2024-05-20 20:23:08] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 23 ms.
[2024-05-20 20:23:08] [INFO ] Added : 13 causal constraints over 3 iterations in 110 ms. Result :sat
Minimization took 235 ms.
[2024-05-20 20:23:08] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:08] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:08] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2024-05-20 20:23:08] [INFO ] [Real]Added 371 Read/Feed constraints in 32 ms returned sat
[2024-05-20 20:23:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:08] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:08] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-20 20:23:08] [INFO ] [Nat]Added 371 Read/Feed constraints in 33 ms returned sat
[2024-05-20 20:23:08] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 25 ms.
[2024-05-20 20:23:08] [INFO ] Added : 7 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 195 ms.
[2024-05-20 20:23:09] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Real]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:23:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Nat]Added 371 Read/Feed constraints in 32 ms returned sat
[2024-05-20 20:23:09] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 23 ms.
[2024-05-20 20:23:09] [INFO ] Added : 6 causal constraints over 2 iterations in 93 ms. Result :sat
Minimization took 207 ms.
[2024-05-20 20:23:09] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Real]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:23:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:09] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-20 20:23:09] [INFO ] [Nat]Added 371 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:23:09] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 25 ms.
[2024-05-20 20:23:09] [INFO ] Added : 6 causal constraints over 2 iterations in 88 ms. Result :sat
Minimization took 223 ms.
[2024-05-20 20:23:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:10] [INFO ] [Real]Absence check using 10 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-20 20:23:10] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-20 20:23:10] [INFO ] [Real]Added 371 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:23:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:23:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-05-20 20:23:10] [INFO ] [Nat]Absence check using 10 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-20 20:23:10] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-20 20:23:10] [INFO ] [Nat]Added 371 Read/Feed constraints in 30 ms returned sat
[2024-05-20 20:23:10] [INFO ] Computed and/alt/rep : 284/795/284 causal constraints (skipped 117 transitions) in 23 ms.
[2024-05-20 20:23:10] [INFO ] Added : 7 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 221 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 411/411 transitions.
Applied a total of 0 rules in 16 ms. Remains 159 /159 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 159/159 places, 411/411 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 411/411 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 411/411 (removed 0) transitions.
[2024-05-20 20:23:10] [INFO ] Invariant cache hit.
[2024-05-20 20:23:10] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-05-20 20:23:10] [INFO ] Invariant cache hit.
[2024-05-20 20:23:11] [INFO ] State equation strengthened by 371 read => feed constraints.
[2024-05-20 20:23:11] [INFO ] Implicit Places using invariants and state equation in 529 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-05-20 20:23:11] [INFO ] Redundant transitions in 5 ms returned []
Running 401 sub problems to find dead transitions.
[2024-05-20 20:23:11] [INFO ] Invariant cache hit.
[2024-05-20 20:23:11] [INFO ] State equation strengthened by 371 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:12] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2024-05-20 20:23:12] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:23:12] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:23:12] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 15 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 0 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 13 places in 23 ms of which 0 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 20/32 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:23:13] [INFO ] Deduced a trap composed of 13 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 16 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 0 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 3 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:23:14] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 20/52 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 0 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 1 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 2 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
[2024-05-20 20:23:16] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 16 places in 87 ms of which 1 ms to minimize.
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 13 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:17] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:23:18] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 17 places in 44 ms of which 1 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 1 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:23:19] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 13 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 0 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:23:20] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:23:21] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:23:21] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-05-20 20:23:21] [INFO ] Deduced a trap composed of 16 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:23:21] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:22] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 1 ms to minimize.
[2024-05-20 20:23:23] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 1 ms to minimize.
[2024-05-20 20:23:23] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2024-05-20 20:23:23] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 1 ms to minimize.
[2024-05-20 20:23:23] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:23:23] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:23:23] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 0 ms to minimize.
[2024-05-20 20:23:23] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-05-20 20:23:24] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:23:24] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:23:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:23:24] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:23:24] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2024-05-20 20:23:24] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 18/130 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 15 places in 26 ms of which 1 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 18 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:23:25] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:23:26] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:23:26] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:23:26] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:23:26] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:23:26] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:23:26] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-05-20 20:23:26] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:23:26] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:23:27] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:28] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:23:28] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 0 ms to minimize.
[2024-05-20 20:23:28] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2024-05-20 20:23:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 0 ms to minimize.
[2024-05-20 20:23:28] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-20 20:23:28] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:23:28] [INFO ] Deduced a trap composed of 16 places in 30 ms of which 1 ms to minimize.
[2024-05-20 20:23:29] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-05-20 20:23:29] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:23:29] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-20 20:23:29] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:23:29] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:23:29] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 0 ms to minimize.
[2024-05-20 20:23:29] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/158 variables, 14/161 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:31] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:23:31] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 0 ms to minimize.
[2024-05-20 20:23:32] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2024-05-20 20:23:33] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-05-20 20:23:33] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-05-20 20:23:33] [INFO ] Deduced a trap composed of 13 places in 25 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/158 variables, 6/167 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:34] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:23:34] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:23:34] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:23:34] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:23:34] [INFO ] Deduced a trap composed of 14 places in 19 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/158 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:36] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 0 ms to minimize.
[2024-05-20 20:23:36] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
[2024-05-20 20:23:36] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:23:36] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-05-20 20:23:36] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:23:36] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-05-20 20:23:38] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/158 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:40] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
[2024-05-20 20:23:40] [INFO ] Deduced a trap composed of 13 places in 19 ms of which 1 ms to minimize.
[2024-05-20 20:23:41] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:23:41] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 timeout
0.0)
(s17 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 158/570 variables, and 183 constraints, problems are : Problem set: 0 solved, 401 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 0/159 constraints, ReadFeed: 0/371 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 171/171 constraints]
Escalating to Integer solving :Problem set: 0 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/158 variables, 171/183 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:42] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2024-05-20 20:23:42] [INFO ] Deduced a trap composed of 13 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 2/185 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:44] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:23:44] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 0 ms to minimize.
[2024-05-20 20:23:44] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 3/188 constraints. Problems are: Problem set: 0 solved, 401 unsolved
[2024-05-20 20:23:45] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:23:45] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
[2024-05-20 20:23:46] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 3/191 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 7 (OVERLAPS) 411/569 variables, 158/349 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Problem TDEAD158 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/569 variables, 371/720 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/569 variables, 400/1120 constraints. Problems are: Problem set: 1 solved, 400 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/569 variables, 0/1120 constraints. Problems are: Problem set: 1 solved, 400 unsolved
SMT process timed out in 60127ms, After SMT, problems are : Problem set: 1 solved, 400 unsolved
Search for dead transitions found 1 dead transitions in 60133ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 159/159 places, 410/411 transitions.
Graph (complete) has 711 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 158 /159 variables (removed 1) and now considering 410/410 (removed 0) transitions.
// Phase 1: matrix 410 rows 158 cols
[2024-05-20 20:24:11] [INFO ] Computed 11 invariants in 2 ms
[2024-05-20 20:24:11] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-20 20:24:11] [INFO ] Invariant cache hit.
[2024-05-20 20:24:11] [INFO ] State equation strengthened by 370 read => feed constraints.
[2024-05-20 20:24:12] [INFO ] Implicit Places using invariants and state equation in 676 ms returned [54]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 772 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 157/159 places, 410/411 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 155 transition count 408
Applied a total of 4 rules in 19 ms. Remains 155 /157 variables (removed 2) and now considering 408/410 (removed 2) transitions.
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:24:12] [INFO ] Computed 10 invariants in 4 ms
[2024-05-20 20:24:12] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-20 20:24:12] [INFO ] Invariant cache hit.
[2024-05-20 20:24:12] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:24:13] [INFO ] Implicit Places using invariants and state equation in 486 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 155/159 places, 408/411 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 62170 ms. Remains : 155/159 places, 408/411 transitions.
[2024-05-20 20:24:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
RANDOM walk for 1000000 steps (20174 resets) in 2425 ms. (412 steps per ms)
BEST_FIRST walk for 10000008 steps (19587 resets) in 5596 ms. (1786 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
[2024-05-20 20:24:21] [INFO ] Invariant cache hit.
[2024-05-20 20:24:21] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-20 20:24:21] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:24:21] [INFO ] [Real]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-20 20:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:24:21] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 23 ms.
[2024-05-20 20:24:21] [INFO ] Added : 7 causal constraints over 2 iterations in 79 ms. Result :sat
Minimization took 183 ms.
[2024-05-20 20:24:21] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:24:21] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:21] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-20 20:24:21] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:24:21] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 25 ms.
[2024-05-20 20:24:22] [INFO ] Added : 9 causal constraints over 3 iterations in 113 ms. Result :sat
Minimization took 193 ms.
[2024-05-20 20:24:22] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-20 20:24:22] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:22] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2024-05-20 20:24:22] [INFO ] [Real]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:24:22] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:22] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:22] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-20 20:24:22] [INFO ] [Nat]Added 361 Read/Feed constraints in 40 ms returned sat
[2024-05-20 20:24:22] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 26 ms.
[2024-05-20 20:24:22] [INFO ] Added : 13 causal constraints over 3 iterations in 119 ms. Result :sat
Minimization took 184 ms.
[2024-05-20 20:24:22] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-20 20:24:22] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:24:22] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Real]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:24:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Nat]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-20 20:24:23] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-20 20:24:23] [INFO ] Added : 9 causal constraints over 2 iterations in 83 ms. Result :sat
Minimization took 169 ms.
[2024-05-20 20:24:23] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:24:23] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:23] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:24:23] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:24:23] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 23 ms.
[2024-05-20 20:24:23] [INFO ] Added : 5 causal constraints over 1 iterations in 82 ms. Result :sat
Minimization took 171 ms.
[2024-05-20 20:24:24] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:24:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Nat]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:24:24] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-20 20:24:24] [INFO ] Added : 8 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 188 ms.
[2024-05-20 20:24:24] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:24:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:24] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:24:24] [INFO ] [Nat]Added 361 Read/Feed constraints in 30 ms returned sat
[2024-05-20 20:24:24] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-20 20:24:24] [INFO ] Added : 11 causal constraints over 3 iterations in 103 ms. Result :sat
Minimization took 165 ms.
[2024-05-20 20:24:25] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:24:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Nat]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:24:25] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-20 20:24:25] [INFO ] Added : 6 causal constraints over 2 iterations in 83 ms. Result :sat
Minimization took 172 ms.
[2024-05-20 20:24:25] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:24:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:25] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:24:25] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:24:25] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 19 ms.
[2024-05-20 20:24:26] [INFO ] Added : 6 causal constraints over 2 iterations in 103 ms. Result :sat
Minimization took 176 ms.
[2024-05-20 20:24:26] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:26] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:24:26] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2024-05-20 20:24:26] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:24:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:24:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:24:26] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:24:26] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2024-05-20 20:24:26] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:24:26] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 22 ms.
[2024-05-20 20:24:26] [INFO ] Added : 7 causal constraints over 2 iterations in 84 ms. Result :sat
Minimization took 177 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 408/408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2024-05-20 20:24:26] [INFO ] Invariant cache hit.
[2024-05-20 20:24:26] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-20 20:24:26] [INFO ] Invariant cache hit.
[2024-05-20 20:24:27] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:24:27] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 575 ms to find 0 implicit places.
[2024-05-20 20:24:27] [INFO ] Redundant transitions in 20 ms returned []
Running 398 sub problems to find dead transitions.
[2024-05-20 20:24:27] [INFO ] Invariant cache hit.
[2024-05-20 20:24:27] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (OVERLAPS) 1/563 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 398/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (OVERLAPS) 1/563 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 924 constraints, problems are : Problem set: 0 solved, 398 unsolved in 20565 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
After SMT, in 50668ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 50674ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51285 ms. Remains : 155/155 places, 408/408 transitions.
[2024-05-20 20:25:18] [INFO ] Flatten gal took : 134 ms
RANDOM walk for 40000 steps (803 resets) in 1772 ms. (22 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
[2024-05-20 20:25:18] [INFO ] Flatten gal took : 57 ms
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (9 resets) in 13 ms. (286 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
[2024-05-20 20:25:18] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18320777744816397992.gal : 22 ms
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
[2024-05-20 20:25:18] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8065708795224634492.prop : 1 ms
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18320777744816397992.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8065708795224634492.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (9 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8065708795224634492.prop.
SDD proceeding with computation,20 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,20 properties remain. new max is 8
SDD size :14 after 16
SDD proceeding with computation,20 properties remain. new max is 16
SDD size :16 after 17
SDD proceeding with computation,20 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,20 properties remain. new max is 64
SDD size :29 after 151
SDD proceeding with computation,20 properties remain. new max is 128
SDD size :151 after 211
SDD proceeding with computation,20 properties remain. new max is 256
SDD size :211 after 1038
SDD proceeding with computation,20 properties remain. new max is 512
SDD size :1038 after 1162
SDD proceeding with computation,20 properties remain. new max is 1024
SDD size :1162 after 3912
SDD proceeding with computation,20 properties remain. new max is 2048
SDD size :3912 after 4231
SDD proceeding with computation,20 properties remain. new max is 4096
SDD size :4231 after 11505
SDD proceeding with computation,20 properties remain. new max is 8192
SDD size :11505 after 35379
Interrupted probabilistic random walk after 679750 steps, run timeout after 3001 ms. (steps per millisecond=226 ) properties seen :0 out of 20
Probabilistic random walk after 679750 steps, saw 89195 distinct states, run finished after 3004 ms. (steps per millisecond=226 ) properties seen :0
[2024-05-20 20:25:21] [INFO ] Invariant cache hit.
[2024-05-20 20:25:21] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 1/539 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 20 unsolved
SDD proceeding with computation,20 properties remain. new max is 16384
SDD size :35379 after 303098
At refinement iteration 13 (OVERLAPS) 5/544 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 5/504 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (OVERLAPS) 5/549 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 5/512 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 20 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 19 (OVERLAPS) 14/563 variables, 8/520 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 6/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 10 solved, 10 unsolved in 2334 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 10 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 6/502 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/502 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/539 variables, 1/503 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/504 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/504 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 5/544 variables, 1/505 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 5/510 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 3/513 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 0/513 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 5/549 variables, 3/516 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 5/521 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 1/522 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/522 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 14/563 variables, 8/530 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/563 variables, 6/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/563 variables, 0/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/563 variables, 0/536 constraints. Problems are: Problem set: 10 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 536 constraints, problems are : Problem set: 10 solved, 10 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 4016ms problems are : Problem set: 10 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 957 ms.
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 155/155 places, 408/408 transitions.
RANDOM walk for 40000 steps (803 resets) in 352 ms. (113 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (76 resets) in 61 ms. (645 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (77 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 89 ms. (444 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (77 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (76 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (76 resets) in 88 ms. (449 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (76 resets) in 70 ms. (563 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (78 resets) in 65 ms. (606 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (76 resets) in 113 ms. (350 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (75 resets) in 87 ms. (454 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 819500 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :0 out of 10
Probabilistic random walk after 819500 steps, saw 106247 distinct states, run finished after 3001 ms. (steps per millisecond=273 ) properties seen :0
[2024-05-20 20:25:30] [INFO ] Invariant cache hit.
[2024-05-20 20:25:30] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 1/539 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/539 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 5/544 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/544 variables, 5/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 5/549 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/549 variables, 5/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/549 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 14/563 variables, 8/520 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/563 variables, 6/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1030 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 249/299 variables, 26/36 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 45/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (OVERLAPS) 239/538 variables, 100/181 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/538 variables, 5/186 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/538 variables, 310/496 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/538 variables, 6/502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/538 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 1/539 variables, 1/503 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/539 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/539 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 5/544 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/544 variables, 5/510 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/544 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/544 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (OVERLAPS) 5/549 variables, 3/516 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/549 variables, 5/521 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/549 variables, 1/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/549 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 14/563 variables, 8/530 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/563 variables, 6/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/563 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (OVERLAPS) 0/563 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 536 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1546 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 2602ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 9 different solutions.
SDD proceeding with computation,20 properties remain. new max is 32768
SDD size :303098 after 1.78544e+06
Parikh walk visited 0 properties in 868 ms.
Support contains 10 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 14 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 155/155 places, 408/408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Applied a total of 0 rules in 6 ms. Remains 155 /155 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2024-05-20 20:25:33] [INFO ] Invariant cache hit.
[2024-05-20 20:25:33] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-05-20 20:25:33] [INFO ] Invariant cache hit.
[2024-05-20 20:25:33] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:25:34] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 529 ms to find 0 implicit places.
[2024-05-20 20:25:34] [INFO ] Redundant transitions in 9 ms returned []
Running 398 sub problems to find dead transitions.
[2024-05-20 20:25:34] [INFO ] Invariant cache hit.
[2024-05-20 20:25:34] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 0/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
SDD proceeding with computation,20 properties remain. new max is 65536
SDD size :1.78544e+06 after 4.60608e+06
At refinement iteration 6 (OVERLAPS) 1/563 variables, 1/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (OVERLAPS) 0/563 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 526 constraints, problems are : Problem set: 0 solved, 398 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 398 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (OVERLAPS) 408/562 variables, 154/164 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/562 variables, 361/525 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:26:08] [INFO ] Flatten gal took : 23 ms
[2024-05-20 20:26:08] [INFO ] Applying decomposition
[2024-05-20 20:26:08] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12900818606202453215.txt' '-o' '/tmp/graph12900818606202453215.bin' '-w' '/tmp/graph12900818606202453215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12900818606202453215.bin' '-l' '-1' '-v' '-w' '/tmp/graph12900818606202453215.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:26:09] [INFO ] Decomposing Gal with order
[2024-05-20 20:26:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:26:09] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-20 20:26:09] [INFO ] Flatten gal took : 80 ms
[2024-05-20 20:26:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 228 labels/synchronizations in 23 ms.
[2024-05-20 20:26:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8629306760380110142.gal : 7 ms
[2024-05-20 20:26:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17627815375846602387.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8629306760380110142.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17627815375846602387.prop' '--nowitness'
At refinement iteration 5 (INCLUDED_ONLY) 0/562 variables, 398/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality17627815375846602387.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 28
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :28 after 78
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :78 after 222
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :222 after 1935
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :1935 after 5946
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :5946 after 54689
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :54689 after 3.2554e+06
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :3.2554e+06 after 6.10849e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/562 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 7 (OVERLAPS) 1/563 variables, 1/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :6.10849e+06 after 6.94466e+07
At refinement iteration 9 (OVERLAPS) 0/563 variables, 0/924 constraints. Problems are: Problem set: 0 solved, 398 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 924 constraints, problems are : Problem set: 0 solved, 398 unsolved in 21205 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 155/155 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 0/0 constraints]
After SMT, in 51316ms problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 51321ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51880 ms. Remains : 155/155 places, 408/408 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 314 edges and 155 vertex of which 103 / 155 are part of one of the 3 SCC in 4 ms
Free SCC test removed 100 places
Drop transitions (Empty/Sink Transition effects.) removed 240 transitions
Ensure Unique test removed 89 transitions
Reduce isomorphic transitions removed 329 transitions.
Graph (complete) has 134 edges and 55 vertex of which 25 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 25 transition count 49
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 17 transition count 41
Iterating global reduction 1 with 8 rules applied. Total rules applied 39 place count 17 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 41 place count 16 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 42 place count 16 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 16 transition count 38
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 45 place count 14 transition count 36
Applied a total of 45 rules in 17 ms. Remains 14 /155 variables (removed 141) and now considering 36/408 (removed 372) transitions.
Running SMT prover for 10 properties.
[2024-05-20 20:26:25] [INFO ] Flow matrix only has 34 transitions (discarded 2 similar events)
// Phase 1: matrix 34 rows 14 cols
[2024-05-20 20:26:25] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:26:25] [INFO ] After 22ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:9
TRAPS : Iteration 0
[2024-05-20 20:26:25] [INFO ] After 30ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-20 20:26:25] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-20 20:26:25] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-05-20 20:26:25] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-05-20 20:26:25] [INFO ] After 82ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
[2024-05-20 20:26:25] [INFO ] Flatten gal took : 2 ms
[2024-05-20 20:26:25] [INFO ] Flatten gal took : 2 ms
[2024-05-20 20:26:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11894574466439176395.gal : 1 ms
[2024-05-20 20:26:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1903808673883348025.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11894574466439176395.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1903808673883348025.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality1903808673883348025.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 8
Invariant property MIN9 does not hold.
Invariant property MIN8 does not hold.
Invariant property MIN7 does not hold.
Invariant property MIN6 does not hold.
Invariant property MIN4 does not hold.
Invariant property MIN0 does not hold.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :8 after 36
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :36 after 120
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :120 after 792
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :792 after 6435
Invariant property MIN3 does not hold.
Invariant property MIN2 does not hold.
Invariant property MIN1 does not hold.
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :6435 after 119340
Invariant property MIN5 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 33 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,505344,0.055108,5388,2,231,21,9525,6,0,84,10981,0
Total reachable state count : 505344
Verifying 10 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,330,0.05567,5388,2,36,21,9525,7,0,87,10981,0
Invariant property MIN1 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,13013,0.056108,5648,2,77,21,9525,8,0,89,10981,0
Invariant property MIN2 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,36,0.056506,5648,2,22,21,9525,9,0,91,10981,0
Invariant property MIN3 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,6434,0.056874,5648,2,64,21,9525,10,0,93,10981,0
Invariant property MIN4 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,1,0.057281,5648,2,15,21,9525,11,0,95,10981,0
Invariant property MIN5 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,20384,0.057544,5648,2,89,21,9525,12,0,97,10981,0
Invariant property MIN6 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN6,1716,0.057896,5648,2,50,21,9525,13,0,99,10981,0
Invariant property MIN7 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN7,792,0.058208,5648,2,43,21,9525,14,0,101,10981,0
Invariant property MIN8 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN8,120,0.058513,5648,2,29,21,9525,15,0,103,10981,0
Invariant property MIN9 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN9,8,0.058822,5648,2,15,21,9525,16,0,105,10981,0
Over-approximation ignoring read arcs solved 0 properties in 238 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:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1] Max Struct:[10, 10, 10, 10, 10, 10, 10, 10, 10, 10]
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:26:25] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (197 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:26:25] [INFO ] Invariant cache hit.
[2024-05-20 20:26:25] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:26:25] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:26:26] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-20 20:26:26] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:26:26] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:26:26] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:26:26] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:26:26] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:26:26] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:26:26] [INFO ] [Nat]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-20 20:26:26] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-20 20:26:26] [INFO ] Added : 7 causal constraints over 2 iterations in 93 ms. Result :sat
Minimization took 187 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 33 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-20 20:26:26] [INFO ] Computed 10 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20460 resets) in 2234 ms. (447 steps per ms)
BEST_FIRST walk for 1000001 steps (1975 resets) in 549 ms. (1818 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:26:29] [INFO ] Invariant cache hit.
[2024-05-20 20:26:29] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:26:29] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:26:29] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-20 20:26:29] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:26:29] [INFO ] [Real]Added 374 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:26:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:26:29] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:26:29] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:26:29] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-20 20:26:29] [INFO ] [Nat]Added 374 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:26:29] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 23 ms.
[2024-05-20 20:26:29] [INFO ] Added : 4 causal constraints over 1 iterations in 66 ms. Result :sat
Minimization took 263 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 9 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 9 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-20 20:26:29] [INFO ] Invariant cache hit.
[2024-05-20 20:26:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 20:26:30] [INFO ] Invariant cache hit.
[2024-05-20 20:26:30] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:26:30] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 615 ms to find 0 implicit places.
[2024-05-20 20:26:30] [INFO ] Redundant transitions in 3 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-20 20:26:30] [INFO ] Invariant cache hit.
[2024-05-20 20:26:30] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 27262 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 57379ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 57384ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 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 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 10 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-20 20:27:28] [INFO ] Computed 11 invariants in 4 ms
[2024-05-20 20:27:28] [INFO ] Implicit Places using invariants in 97 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 110 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 18 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-20 20:27:28] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 20:27:28] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-20 20:27:28] [INFO ] Invariant cache hit.
[2024-05-20 20:27:28] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:27:28] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 572 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 58733 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-20 20:27:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22617 resets) in 2275 ms. (439 steps per ms)
BEST_FIRST walk for 1000001 steps (2096 resets) in 533 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:27:31] [INFO ] Invariant cache hit.
[2024-05-20 20:27:31] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:27:31] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:27:31] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:27:31] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:27:31] [INFO ] [Real]Added 362 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:27:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:27:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:27:31] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:27:31] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:27:31] [INFO ] [Nat]Added 362 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:27:31] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 20 ms.
[2024-05-20 20:27:31] [INFO ] Added : 4 causal constraints over 1 iterations in 65 ms. Result :sat
Minimization took 145 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 7 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:27:32] [INFO ] Invariant cache hit.
[2024-05-20 20:27:32] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-20 20:27:32] [INFO ] Invariant cache hit.
[2024-05-20 20:27:32] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:27:32] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
[2024-05-20 20:27:32] [INFO ] Redundant transitions in 5 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:27:32] [INFO ] Invariant cache hit.
[2024-05-20 20:27:32] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:27:34] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:27:35] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 26735 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 56851ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 56855ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57426 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (904 resets) in 254 ms. (156 steps per ms) remains 2/2 properties
[2024-05-20 20:28:29] [INFO ] Flatten gal took : 109 ms
BEST_FIRST walk for 40004 steps (79 resets) in 67 ms. (588 steps per ms) remains 2/2 properties
[2024-05-20 20:28:29] [INFO ] Flatten gal took : 35 ms
BEST_FIRST walk for 40004 steps (85 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
[2024-05-20 20:28:29] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13511075498668434836.gal : 3 ms
[2024-05-20 20:28:29] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9074075345974067749.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13511075498668434836.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9074075345974067749.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9074075345974067749.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 155
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :155 after 849
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :849 after 1037
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1037 after 1059
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1059 after 3516
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3516 after 3777
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :3777 after 18471
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18471 after 44420
Interrupted probabilistic random walk after 888844 steps, run timeout after 3001 ms. (steps per millisecond=296 ) properties seen :0 out of 2
Probabilistic random walk after 888844 steps, saw 111668 distinct states, run finished after 3001 ms. (steps per millisecond=296 ) properties seen :0
[2024-05-20 20:28:32] [INFO ] Invariant cache hit.
[2024-05-20 20:28:32] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 20:28:32] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
[2024-05-20 20:28:32] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
[2024-05-20 20:28:32] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 3/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/504 variables, 64/249 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 231/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 292 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/183 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 3/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/236 variables, 0/186 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/504 variables, 64/250 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 231/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/481 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/523 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 523 constraints, problems are : Problem set: 1 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 490ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (904 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (82 resets) in 26 ms. (1481 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :44420 after 278037
Interrupted probabilistic random walk after 1717448 steps, run timeout after 3001 ms. (steps per millisecond=572 ) properties seen :0 out of 1
Probabilistic random walk after 1717448 steps, saw 207875 distinct states, run finished after 3001 ms. (steps per millisecond=572 ) properties seen :0
[2024-05-20 20:28:36] [INFO ] Invariant cache hit.
[2024-05-20 20:28:36] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 268/504 variables, 64/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 231/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 146/202 variables, 31/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/202 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/202 variables, 116/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/225 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/225 variables, 6/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/225 variables, 0/169 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/236 variables, 8/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/236 variables, 5/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/236 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/236 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/504 variables, 64/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 231/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:28:36] [INFO ] Invariant cache hit.
[2024-05-20 20:28:36] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-20 20:28:36] [INFO ] Invariant cache hit.
[2024-05-20 20:28:36] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:28:37] [INFO ] Implicit Places using invariants and state equation in 513 ms returned []
Implicit Place search using SMT with State Equation took 651 ms to find 0 implicit places.
[2024-05-20 20:28:37] [INFO ] Redundant transitions in 2 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:28:37] [INFO ] Invariant cache hit.
[2024-05-20 20:28:37] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:28:39] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:28:40] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :278037 after 2.25806e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 29303 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:29:19] [INFO ] Flatten gal took : 14 ms
[2024-05-20 20:29:19] [INFO ] Applying decomposition
[2024-05-20 20:29:19] [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.202405141337/bin/convert-linux64' '-i' '/tmp/graph10723561484136621000.txt' '-o' '/tmp/graph10723561484136621000.bin' '-w' '/tmp/graph10723561484136621000.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph10723561484136621000.bin' '-l' '-1' '-v' '-w' '/tmp/graph10723561484136621000.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:29:19] [INFO ] Decomposing Gal with order
[2024-05-20 20:29:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:29:19] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-20 20:29:19] [INFO ] Flatten gal took : 62 ms
[2024-05-20 20:29:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 25 ms.
[2024-05-20 20:29:19] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8153485699470218665.gal : 10 ms
[2024-05-20 20:29:19] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9243311311342935605.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8153485699470218665.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9243311311342935605.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality9243311311342935605.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :29 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 57
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :57 after 223
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :223 after 4933
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4933 after 33837
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :33837 after 578743
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :578743 after 1.0591e+08
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 25000 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54397ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55068 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 2 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 14 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 20:29:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:29:31] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:29:31] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:29:31] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:29:31] [INFO ] After 22ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:29:31] [INFO ] Flatten gal took : 1 ms
[2024-05-20 20:29:31] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:29:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15056786427155026160.gal : 1 ms
[2024-05-20 20:29:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9077670823112520183.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15056786427155026160.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9077670823112520183.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality9077670823112520183.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.001443,3480,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2,0.001716,3856,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 69 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-00 in 185874 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:29:31] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (198 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:29:31] [INFO ] Invariant cache hit.
[2024-05-20 20:29:31] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-20 20:29:31] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:29:31] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:29:31] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:29:31] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:29:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:29:31] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:29:31] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:29:32] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:29:32] [INFO ] [Nat]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:29:32] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-20 20:29:32] [INFO ] Added : 9 causal constraints over 3 iterations in 108 ms. Result :sat
Minimization took 191 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 15 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-20 20:29:32] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20499 resets) in 2174 ms. (459 steps per ms)
BEST_FIRST walk for 1000001 steps (1968 resets) in 529 ms. (1886 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:29:35] [INFO ] Invariant cache hit.
[2024-05-20 20:29:35] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:29:35] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:29:35] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:29:35] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:29:35] [INFO ] [Real]Added 374 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:29:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:29:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:29:35] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:29:35] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2024-05-20 20:29:35] [INFO ] [Nat]Added 374 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:29:35] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 19 ms.
[2024-05-20 20:29:35] [INFO ] Added : 5 causal constraints over 1 iterations in 60 ms. Result :sat
Minimization took 249 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-20 20:29:35] [INFO ] Invariant cache hit.
[2024-05-20 20:29:35] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 20:29:35] [INFO ] Invariant cache hit.
[2024-05-20 20:29:35] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:29:36] [INFO ] Implicit Places using invariants and state equation in 504 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-20 20:29:36] [INFO ] Redundant transitions in 5 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-20 20:29:36] [INFO ] Invariant cache hit.
[2024-05-20 20:29:36] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 25010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 55111ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 55118ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 707 edges and 151 vertex of which 150 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 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 7 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-20 20:30:31] [INFO ] Computed 11 invariants in 3 ms
[2024-05-20 20:30:31] [INFO ] Implicit Places using invariants in 94 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 12 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-20 20:30:31] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 20:30:31] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-20 20:30:31] [INFO ] Invariant cache hit.
[2024-05-20 20:30:31] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:30:32] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 56426 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-20 20:30:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22574 resets) in 2193 ms. (455 steps per ms)
BEST_FIRST walk for 1000001 steps (2075 resets) in 504 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:30:34] [INFO ] Invariant cache hit.
[2024-05-20 20:30:34] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:30:34] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:30:34] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:30:34] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:30:34] [INFO ] [Real]Added 362 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:30:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:30:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:30:35] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:30:35] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:30:35] [INFO ] [Nat]Added 362 Read/Feed constraints in 27 ms returned sat
[2024-05-20 20:30:35] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 21 ms.
[2024-05-20 20:30:35] [INFO ] Added : 7 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 193 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:30:35] [INFO ] Invariant cache hit.
[2024-05-20 20:30:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-20 20:30:35] [INFO ] Invariant cache hit.
[2024-05-20 20:30:35] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:30:35] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 573 ms to find 0 implicit places.
[2024-05-20 20:30:35] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:30:36] [INFO ] Invariant cache hit.
[2024-05-20 20:30:36] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:30:38] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:30:39] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24301 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54397ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54401ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54989 ms. Remains : 147/147 places, 399/399 transitions.
[2024-05-20 20:31:30] [INFO ] Flatten gal took : 29 ms
[2024-05-20 20:31:30] [INFO ] Flatten gal took : 21 ms
[2024-05-20 20:31:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12427033890747800619.gal : 2 ms
[2024-05-20 20:31:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality80488608088072050.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12427033890747800619.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality80488608088072050.prop' '--nowitness' '--gen-order' 'FOLLOW'
RANDOM walk for 40000 steps (897 resets) in 199 ms. (200 steps per ms) remains 2/2 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...327
BEST_FIRST walk for 40004 steps (82 resets) in 41 ms. (952 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality80488608088072050.prop.
BEST_FIRST walk for 40004 steps (84 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 155
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :155 after 849
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :849 after 1037
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1037 after 1062
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1062 after 3528
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3528 after 8847
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8847 after 18206
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18206 after 43955
Interrupted probabilistic random walk after 1103654 steps, run timeout after 3001 ms. (steps per millisecond=367 ) properties seen :0 out of 2
Probabilistic random walk after 1103654 steps, saw 134235 distinct states, run finished after 3003 ms. (steps per millisecond=367 ) properties seen :0
[2024-05-20 20:31:33] [INFO ] Invariant cache hit.
[2024-05-20 20:31:33] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 12/357 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 10/367 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 179/546 variables, 72/412 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 107/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/311 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/357 variables, 1/312 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 12/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/367 variables, 7/331 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 179/546 variables, 72/413 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 107/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 507ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (908 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (79 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43955 after 270180
Interrupted probabilistic random walk after 1735002 steps, run timeout after 3001 ms. (steps per millisecond=578 ) properties seen :0 out of 1
Probabilistic random walk after 1735002 steps, saw 210211 distinct states, run finished after 3003 ms. (steps per millisecond=577 ) properties seen :0
[2024-05-20 20:31:37] [INFO ] Invariant cache hit.
[2024-05-20 20:31:37] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 12/357 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/357 variables, 12/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 10/367 variables, 7/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/367 variables, 10/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 179/546 variables, 72/412 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 107/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 158 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 281/335 variables, 38/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/335 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/335 variables, 246/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/335 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/345 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/345 variables, 10/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/345 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/345 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/357 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/357 variables, 12/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/357 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 10/367 variables, 7/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/367 variables, 10/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/367 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 179/546 variables, 72/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 107/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 382ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 5 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 14 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:31:37] [INFO ] Invariant cache hit.
[2024-05-20 20:31:37] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-05-20 20:31:37] [INFO ] Invariant cache hit.
[2024-05-20 20:31:37] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:31:38] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
[2024-05-20 20:31:38] [INFO ] Redundant transitions in 3 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:31:38] [INFO ] Invariant cache hit.
[2024-05-20 20:31:38] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:31:40] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:31:41] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :270180 after 2.19141e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30009 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.19141e+06 after 6.63681e+06
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:32:20] [INFO ] Flatten gal took : 23 ms
[2024-05-20 20:32:20] [INFO ] Applying decomposition
[2024-05-20 20:32:20] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15551743919779294413.txt' '-o' '/tmp/graph15551743919779294413.bin' '-w' '/tmp/graph15551743919779294413.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15551743919779294413.bin' '-l' '-1' '-v' '-w' '/tmp/graph15551743919779294413.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:32:20] [INFO ] Decomposing Gal with order
[2024-05-20 20:32:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:32:20] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-20 20:32:20] [INFO ] Flatten gal took : 33 ms
[2024-05-20 20:32:20] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 11 ms.
[2024-05-20 20:32:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2520944590807844408.gal : 4 ms
[2024-05-20 20:32:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1021425792283046624.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2520944590807844408.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1021425792283046624.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality1021425792283046624.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :11 after 11
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :11 after 44
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :44 after 107
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :107 after 715
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :715 after 74041
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :74041 after 618265
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :5.5098e+08 after 5.5098e+08
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 23515 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 53623ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 53627ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54253 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 1 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 352 transitions.
Graph (complete) has 98 edges and 43 vertex of which 13 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 11 output transitions
Drop transitions (Output transitions of discarded places.) removed 11 transitions
Drop transitions (Empty/Sink Transition effects.) removed 19 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 13 transition count 16
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 29 place count 6 transition count 9
Iterating global reduction 1 with 7 rules applied. Total rules applied 36 place count 6 transition count 9
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 38 place count 4 transition count 7
Applied a total of 38 rules in 6 ms. Remains 4 /147 variables (removed 143) and now considering 7/399 (removed 392) transitions.
Running SMT prover for 1 properties.
[2024-05-20 20:32:31] [INFO ] Flow matrix only has 6 transitions (discarded 1 similar events)
// Phase 1: matrix 6 rows 4 cols
[2024-05-20 20:32:31] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:32:31] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:32:31] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:32:31] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:32:31] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:32:31] [INFO ] Flatten gal took : 1 ms
[2024-05-20 20:32:31] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:32:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3887735412891777325.gal : 0 ms
[2024-05-20 20:32:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13546622117316059345.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3887735412891777325.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13546622117316059345.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality13546622117316059345.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,6,0.001634,3520,2,7,6,33,6,0,23,18,0
Total reachable state count : 6
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.001945,3896,2,5,6,33,7,0,26,18,0
Over-approximation ignoring read arcs solved 0 properties in 62 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-01 in 180107 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:32:31] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (203 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 10001 steps (20 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:32:31] [INFO ] Invariant cache hit.
[2024-05-20 20:32:31] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:32:31] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:32:31] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:32:31] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:32:32] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:32:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:32:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-20 20:32:32] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:32:32] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:32:32] [INFO ] [Nat]Added 361 Read/Feed constraints in 36 ms returned sat
[2024-05-20 20:32:32] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-20 20:32:32] [INFO ] Added : 13 causal constraints over 3 iterations in 105 ms. Result :sat
Minimization took 179 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 15 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-20 20:32:32] [INFO ] Computed 10 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20426 resets) in 2125 ms. (470 steps per ms)
BEST_FIRST walk for 1000001 steps (1976 resets) in 509 ms. (1960 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:32:35] [INFO ] Invariant cache hit.
[2024-05-20 20:32:35] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:32:35] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:32:35] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-20 20:32:35] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:32:35] [INFO ] [Real]Added 374 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:32:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:32:35] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:32:35] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:32:35] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-20 20:32:35] [INFO ] [Nat]Added 374 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:32:35] [INFO ] Computed and/alt/rep : 260/715/260 causal constraints (skipped 134 transitions) in 19 ms.
[2024-05-20 20:32:35] [INFO ] Added : 8 causal constraints over 2 iterations in 79 ms. Result :sat
Minimization took 230 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-20 20:32:35] [INFO ] Invariant cache hit.
[2024-05-20 20:32:35] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-20 20:32:35] [INFO ] Invariant cache hit.
[2024-05-20 20:32:35] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:32:36] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 583 ms to find 0 implicit places.
[2024-05-20 20:32:36] [INFO ] Redundant transitions in 4 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-20 20:32:36] [INFO ] Invariant cache hit.
[2024-05-20 20:32:36] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 29134 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 393/927 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/927 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/928 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 928 constraints, problems are : Problem set: 1 solved, 393 unsolved in 24836 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 393/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 54058ms problems are : Problem set: 1 solved, 393 unsolved
Search for dead transitions found 1 dead transitions in 54064ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 403/404 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 150 transition count 401
Applied a total of 2 rules in 11 ms. Remains 150 /151 variables (removed 1) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-20 20:33:30] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 20:33:30] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 20:33:30] [INFO ] Invariant cache hit.
[2024-05-20 20:33:30] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-20 20:33:30] [INFO ] Implicit Places using invariants and state equation in 477 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 150/151 places, 401/404 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 55241 ms. Remains : 150/151 places, 401/404 transitions.
[2024-05-20 20:33:30] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20419 resets) in 2123 ms. (470 steps per ms)
BEST_FIRST walk for 1000001 steps (2006 resets) in 533 ms. (1872 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:33:33] [INFO ] Invariant cache hit.
[2024-05-20 20:33:33] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:33:33] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:33:33] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:33:33] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-20 20:33:33] [INFO ] [Real]Added 372 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:33:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:33:33] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:33:33] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:33:33] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:33:33] [INFO ] [Nat]Added 372 Read/Feed constraints in 30 ms returned sat
[2024-05-20 20:33:33] [INFO ] Computed and/alt/rep : 255/665/255 causal constraints (skipped 136 transitions) in 20 ms.
[2024-05-20 20:33:33] [INFO ] Added : 5 causal constraints over 1 iterations in 67 ms. Result :sat
Minimization took 196 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 12 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 150/150 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-20 20:33:34] [INFO ] Invariant cache hit.
[2024-05-20 20:33:34] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-20 20:33:34] [INFO ] Invariant cache hit.
[2024-05-20 20:33:34] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-20 20:33:34] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 585 ms to find 0 implicit places.
[2024-05-20 20:33:34] [INFO ] Redundant transitions in 2 ms returned []
Running 391 sub problems to find dead transitions.
[2024-05-20 20:33:34] [INFO ] Invariant cache hit.
[2024-05-20 20:33:34] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 1/551 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 391 unsolved in 27704 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 391/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 923 constraints, problems are : Problem set: 0 solved, 391 unsolved in 18307 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 46100ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 46104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46700 ms. Remains : 150/150 places, 401/401 transitions.
[2024-05-20 20:34:20] [INFO ] Flatten gal took : 27 ms
[2024-05-20 20:34:20] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:34:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2215103068034491195.gal : 3 ms
[2024-05-20 20:34:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5161675654184372056.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2215103068034491195.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5161675654184372056.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5161675654184372056.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
RANDOM walk for 40000 steps (815 resets) in 332 ms. (120 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 28
BEST_FIRST walk for 40004 steps (81 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 155
BEST_FIRST walk for 40004 steps (82 resets) in 46 ms. (851 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :155 after 849
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :849 after 1035
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1035 after 1058
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1058 after 3503
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3503 after 8691
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8691 after 18029
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18029 after 43361
Interrupted probabilistic random walk after 701188 steps, run timeout after 3001 ms. (steps per millisecond=233 ) properties seen :0 out of 2
Probabilistic random walk after 701188 steps, saw 92397 distinct states, run finished after 3001 ms. (steps per millisecond=233 ) properties seen :0
[2024-05-20 20:34:24] [INFO ] Invariant cache hit.
[2024-05-20 20:34:24] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 330/479 variables, 52/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 294/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 72/551 variables, 64/524 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 8/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 1 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 1/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/115 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 330/479 variables, 52/167 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 294/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/461 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/551 variables, 64/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 8/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/533 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 533 constraints, problems are : Problem set: 1 solved, 1 unsolved in 169 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 355ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 150/150 places, 401/401 transitions.
RANDOM walk for 40000 steps (801 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (73 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :43361 after 280386
Interrupted probabilistic random walk after 1668812 steps, run timeout after 3001 ms. (steps per millisecond=556 ) properties seen :0 out of 1
Probabilistic random walk after 1668812 steps, saw 213412 distinct states, run finished after 3001 ms. (steps per millisecond=556 ) properties seen :0
[2024-05-20 20:34:27] [INFO ] Invariant cache hit.
[2024-05-20 20:34:27] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 330/479 variables, 52/166 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 294/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/551 variables, 64/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/551 variables, 8/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 1 unsolved in 145 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 81/124 variables, 21/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/124 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/124 variables, 60/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/124 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 14/138 variables, 1/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/138 variables, 4/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/138 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/149 variables, 8/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/149 variables, 5/114 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/149 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/149 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 330/479 variables, 52/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 294/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 72/551 variables, 64/525 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/551 variables, 8/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/551 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/551 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 533 constraints, problems are : Problem set: 0 solved, 1 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 335ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 150/150 places, 401/401 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 150 /150 variables (removed 0) and now considering 401/401 (removed 0) transitions.
[2024-05-20 20:34:27] [INFO ] Invariant cache hit.
[2024-05-20 20:34:27] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-05-20 20:34:27] [INFO ] Invariant cache hit.
[2024-05-20 20:34:28] [INFO ] State equation strengthened by 372 read => feed constraints.
[2024-05-20 20:34:28] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 709 ms to find 0 implicit places.
[2024-05-20 20:34:28] [INFO ] Redundant transitions in 2 ms returned []
Running 391 sub problems to find dead transitions.
[2024-05-20 20:34:28] [INFO ] Invariant cache hit.
[2024-05-20 20:34:28] [INFO ] State equation strengthened by 372 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :280386 after 2.12577e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (OVERLAPS) 1/551 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (OVERLAPS) 0/551 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Real declared 551/551 variables, and 532 constraints, problems are : Problem set: 0 solved, 391 unsolved in 27956 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/149 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 3 (OVERLAPS) 401/550 variables, 149/159 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 372/531 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/550 variables, 391/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/550 variables, 0/922 constraints. Problems are: Problem set: 0 solved, 391 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.12577e+06 after 6.6012e+06
At refinement iteration 7 (OVERLAPS) 1/551 variables, 1/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:35:11] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:35:11] [INFO ] Applying decomposition
[2024-05-20 20:35:11] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11486659514366858443.txt' '-o' '/tmp/graph11486659514366858443.bin' '-w' '/tmp/graph11486659514366858443.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11486659514366858443.bin' '-l' '-1' '-v' '-w' '/tmp/graph11486659514366858443.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:35:11] [INFO ] Decomposing Gal with order
[2024-05-20 20:35:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:35:11] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-20 20:35:11] [INFO ] Flatten gal took : 27 ms
[2024-05-20 20:35:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 340 labels/synchronizations in 9 ms.
[2024-05-20 20:35:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13305578469053006071.gal : 3 ms
[2024-05-20 20:35:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1486538184177384642.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13305578469053006071.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1486538184177384642.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality1486538184177384642.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 44
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :44 after 44
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :44 after 215
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :215 after 681
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :681 after 4577
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :4577 after 52213
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :52213 after 4.83036e+06
At refinement iteration 9 (OVERLAPS) 0/551 variables, 0/923 constraints. Problems are: Problem set: 0 solved, 391 unsolved
No progress, stopping.
After SMT solving in domain Int declared 551/551 variables, and 923 constraints, problems are : Problem set: 0 solved, 391 unsolved in 18448 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 150/150 constraints, ReadFeed: 372/372 constraints, PredecessorRefiner: 391/391 constraints, Known Traps: 0/0 constraints]
After SMT, in 46508ms problems are : Problem set: 0 solved, 391 unsolved
Search for dead transitions found 0 dead transitions in 46512ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47238 ms. Remains : 150/150 places, 401/401 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 343 edges and 150 vertex of which 108 / 150 are part of one of the 3 SCC in 1 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 102 edges and 45 vertex of which 15 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Drop transitions (Empty/Sink Transition effects.) removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 24 rules applied. Total rules applied 26 place count 15 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 27 place count 14 transition count 15
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 27 place count 14 transition count 14
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 29 place count 13 transition count 14
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 38 place count 4 transition count 5
Iterating global reduction 2 with 9 rules applied. Total rules applied 47 place count 4 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 49 place count 3 transition count 4
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 3 transition count 3
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 51 place count 2 transition count 2
Applied a total of 51 rules in 9 ms. Remains 2 /150 variables (removed 148) and now considering 2/401 (removed 399) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-05-20 20:35:15] [INFO ] Computed 1 invariants in 0 ms
[2024-05-20 20:35:15] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-20 20:35:15] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:35:15] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-20 20:35:15] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
[2024-05-20 20:35:15] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:35:15] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:35:15] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7989668378269898319.gal : 0 ms
[2024-05-20 20:35:15] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17921787664611053661.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7989668378269898319.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17921787664611053661.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17921787664611053661.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,5,0.001433,3476,2,7,7,32,6,0,13,19,0
Total reachable state count : 5
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.001682,3852,2,3,7,32,7,0,16,19,0
Over-approximation ignoring read arcs solved 0 properties in 40 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-02 in 163292 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-03
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:35:15] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (200 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:35:15] [INFO ] Invariant cache hit.
[2024-05-20 20:35:15] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:35:15] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:35:15] [INFO ] [Real]Absence check using state equation in 65 ms returned sat
[2024-05-20 20:35:15] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:35:15] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:35:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:35:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:35:15] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:35:15] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-20 20:35:15] [INFO ] [Nat]Added 361 Read/Feed constraints in 31 ms returned sat
[2024-05-20 20:35:15] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 24 ms.
[2024-05-20 20:35:15] [INFO ] Added : 9 causal constraints over 2 iterations in 97 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 18 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-20 20:35:15] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20459 resets) in 2141 ms. (466 steps per ms)
BEST_FIRST walk for 1000001 steps (1954 resets) in 512 ms. (1949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:35:18] [INFO ] Invariant cache hit.
[2024-05-20 20:35:18] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:35:18] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:35:18] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:35:18] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:35:18] [INFO ] [Real]Added 374 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:35:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:35:18] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:35:18] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:35:18] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:35:18] [INFO ] [Nat]Added 374 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:35:18] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 19 ms.
[2024-05-20 20:35:18] [INFO ] Added : 6 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 219 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-20 20:35:19] [INFO ] Invariant cache hit.
[2024-05-20 20:35:19] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-20 20:35:19] [INFO ] Invariant cache hit.
[2024-05-20 20:35:19] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:35:19] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 653 ms to find 0 implicit places.
[2024-05-20 20:35:19] [INFO ] Redundant transitions in 8 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-20 20:35:19] [INFO ] Invariant cache hit.
[2024-05-20 20:35:19] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 29549 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 24625 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 54261ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 54266ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 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 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 6 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-20 20:36:13] [INFO ] Computed 11 invariants in 1 ms
[2024-05-20 20:36:14] [INFO ] Implicit Places using invariants in 83 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 13 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-20 20:36:14] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 20:36:14] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-20 20:36:14] [INFO ] Invariant cache hit.
[2024-05-20 20:36:14] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:36:14] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55561 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-20 20:36:14] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22587 resets) in 2151 ms. (464 steps per ms)
BEST_FIRST walk for 1000000 steps (2091 resets) in 495 ms. (2016 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:36:17] [INFO ] Invariant cache hit.
[2024-05-20 20:36:17] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:36:17] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:36:17] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-20 20:36:17] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:36:17] [INFO ] [Real]Added 362 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:36:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:36:17] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:36:17] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:36:17] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2024-05-20 20:36:17] [INFO ] [Nat]Added 362 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:36:17] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 18 ms.
[2024-05-20 20:36:17] [INFO ] Added : 5 causal constraints over 1 iterations in 66 ms. Result :sat
Minimization took 143 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:36:17] [INFO ] Invariant cache hit.
[2024-05-20 20:36:17] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-20 20:36:17] [INFO ] Invariant cache hit.
[2024-05-20 20:36:17] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:36:18] [INFO ] Implicit Places using invariants and state equation in 420 ms returned []
Implicit Place search using SMT with State Equation took 521 ms to find 0 implicit places.
[2024-05-20 20:36:18] [INFO ] Redundant transitions in 2 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:36:18] [INFO ] Invariant cache hit.
[2024-05-20 20:36:18] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:36:20] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:36:21] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 28601 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24327 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 53025ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 53029ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53559 ms. Remains : 147/147 places, 399/399 transitions.
[2024-05-20 20:37:11] [INFO ] Flatten gal took : 41 ms
[2024-05-20 20:37:11] [INFO ] Flatten gal took : 33 ms
[2024-05-20 20:37:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10301515933372010611.gal : 2 ms
[2024-05-20 20:37:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2139488680133659241.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10301515933372010611.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2139488680133659241.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (899 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 63 ms. (625 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2139488680133659241.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
BEST_FIRST walk for 40004 steps (81 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 155
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :155 after 849
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :849 after 1037
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1037 after 1062
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1062 after 3528
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3528 after 8853
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8853 after 18218
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18218 after 43955
Interrupted probabilistic random walk after 1109961 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :0 out of 2
Probabilistic random walk after 1109961 steps, saw 135295 distinct states, run finished after 3001 ms. (steps per millisecond=369 ) properties seen :0
[2024-05-20 20:37:14] [INFO ] Invariant cache hit.
[2024-05-20 20:37:14] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/174 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 20:37:14] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 316/490 variables, 64/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 276/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 56/546 variables, 49/513 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 7/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 1/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/174 variables, 8/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 5/124 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 1/125 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 20:37:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 1/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/174 variables, 0/126 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 19 (OVERLAPS) 316/490 variables, 64/190 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :43955 after 270090
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 276/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/490 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 56/546 variables, 49/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 7/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 444ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (898 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (82 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1747663 steps, run timeout after 3001 ms. (steps per millisecond=582 ) properties seen :0 out of 1
Probabilistic random walk after 1747663 steps, saw 212182 distinct states, run finished after 3001 ms. (steps per millisecond=582 ) properties seen :0
[2024-05-20 20:37:17] [INFO ] Invariant cache hit.
[2024-05-20 20:37:18] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/174 variables, 8/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/174 variables, 5/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 316/490 variables, 64/187 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/490 variables, 276/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/490 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 56/546 variables, 49/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 7/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 9/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 96/140 variables, 21/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/140 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/140 variables, 70/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/140 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/163 variables, 1/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/163 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/174 variables, 8/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/174 variables, 5/124 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 20:37:18] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 1 ms to minimize.
[2024-05-20 20:37:18] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
[2024-05-20 20:37:18] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/174 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/174 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 316/490 variables, 64/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/490 variables, 276/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/490 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 56/546 variables, 49/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 7/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 523 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 397ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:37:18] [INFO ] Invariant cache hit.
[2024-05-20 20:37:18] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-20 20:37:18] [INFO ] Invariant cache hit.
[2024-05-20 20:37:18] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:37:18] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 525 ms to find 0 implicit places.
[2024-05-20 20:37:18] [INFO ] Redundant transitions in 5 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:37:18] [INFO ] Invariant cache hit.
[2024-05-20 20:37:18] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:37:21] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:37:22] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD size :270090 after 2.1463e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 28961 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.1463e+06 after 7.01501e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:38:01] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:38:01] [INFO ] Applying decomposition
[2024-05-20 20:38:01] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph314251667566627009.txt' '-o' '/tmp/graph314251667566627009.bin' '-w' '/tmp/graph314251667566627009.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph314251667566627009.bin' '-l' '-1' '-v' '-w' '/tmp/graph314251667566627009.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:38:01] [INFO ] Decomposing Gal with order
[2024-05-20 20:38:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:38:01] [INFO ] Removed a total of 330 redundant transitions.
[2024-05-20 20:38:01] [INFO ] Flatten gal took : 20 ms
[2024-05-20 20:38:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 300 labels/synchronizations in 6 ms.
[2024-05-20 20:38:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality191609347572549451.gal : 3 ms
[2024-05-20 20:38:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13653333248349546321.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality191609347572549451.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13653333248349546321.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality13653333248349546321.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 234
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :234 after 234
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :234 after 234
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :234 after 234
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :234 after 272
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :272 after 676
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :676 after 207420
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :207420 after 252150
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :252150 after 1.04184e+07
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24195 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 53260ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 53265ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53804 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 0 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 353 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 22 rules applied. Total rules applied 24 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 25 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 33 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 41 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 2 transition count 3
Applied a total of 44 rules in 5 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 20:38:12] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 20:38:12] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:38:12] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:38:12] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:38:12] [INFO ] After 19ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:38:12] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:38:12] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:38:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14851983281117314075.gal : 0 ms
[2024-05-20 20:38:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13301310570997286996.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14851983281117314075.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13301310570997286996.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13301310570997286996.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.001574,3484,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2,0.001817,3860,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 52 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-03 in 177124 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-05
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:38:12] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (200 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:38:12] [INFO ] Invariant cache hit.
[2024-05-20 20:38:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:38:12] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:38:12] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:38:12] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:38:12] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:38:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:38:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:38:12] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:38:12] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:38:12] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:38:12] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 21 ms.
[2024-05-20 20:38:12] [INFO ] Added : 5 causal constraints over 1 iterations in 62 ms. Result :sat
Minimization took 166 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 18 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-20 20:38:12] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20481 resets) in 2142 ms. (466 steps per ms)
BEST_FIRST walk for 1000001 steps (1962 resets) in 521 ms. (1915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:38:15] [INFO ] Invariant cache hit.
[2024-05-20 20:38:15] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-20 20:38:15] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:38:15] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:38:15] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:38:15] [INFO ] [Real]Added 374 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:38:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:38:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:38:15] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:38:15] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:38:15] [INFO ] [Nat]Added 374 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:38:15] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 20 ms.
[2024-05-20 20:38:15] [INFO ] Added : 3 causal constraints over 1 iterations in 72 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 5 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-20 20:38:16] [INFO ] Invariant cache hit.
[2024-05-20 20:38:16] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 20:38:16] [INFO ] Invariant cache hit.
[2024-05-20 20:38:16] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:38:16] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
[2024-05-20 20:38:16] [INFO ] Redundant transitions in 6 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-20 20:38:16] [INFO ] Invariant cache hit.
[2024-05-20 20:38:16] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 28301 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 24355 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 52745ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 52749ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 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 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 14 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-20 20:39:09] [INFO ] Computed 11 invariants in 2 ms
[2024-05-20 20:39:09] [INFO ] Implicit Places using invariants in 90 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 10 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-20 20:39:09] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 20:39:09] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-20 20:39:09] [INFO ] Invariant cache hit.
[2024-05-20 20:39:09] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:39:10] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 54027 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-20 20:39:10] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22592 resets) in 2173 ms. (459 steps per ms)
BEST_FIRST walk for 1000001 steps (2083 resets) in 504 ms. (1980 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:39:12] [INFO ] Invariant cache hit.
[2024-05-20 20:39:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:39:12] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:39:12] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-20 20:39:12] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:39:12] [INFO ] [Real]Added 362 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:39:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:39:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:39:12] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:39:13] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:39:13] [INFO ] [Nat]Added 362 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:39:13] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 19 ms.
[2024-05-20 20:39:13] [INFO ] Added : 3 causal constraints over 1 iterations in 59 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 10 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:39:13] [INFO ] Invariant cache hit.
[2024-05-20 20:39:13] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-20 20:39:13] [INFO ] Invariant cache hit.
[2024-05-20 20:39:13] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:39:13] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-05-20 20:39:13] [INFO ] Redundant transitions in 5 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:39:13] [INFO ] Invariant cache hit.
[2024-05-20 20:39:13] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:39:15] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/546 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 909 constraints, problems are : Problem set: 0 solved, 389 unsolved in 24101 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
After SMT, in 54195ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54200ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54769 ms. Remains : 147/147 places, 399/399 transitions.
[2024-05-20 20:40:08] [INFO ] Flatten gal took : 14 ms
[2024-05-20 20:40:08] [INFO ] Flatten gal took : 10 ms
[2024-05-20 20:40:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6968447998061176078.gal : 2 ms
[2024-05-20 20:40:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12217284304797466673.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6968447998061176078.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12217284304797466673.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12217284304797466673.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 28
RANDOM walk for 40000 steps (896 resets) in 300 ms. (132 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 155
BEST_FIRST walk for 40004 steps (80 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (81 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :155 after 849
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :849 after 1037
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1037 after 1062
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1062 after 3537
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3537 after 8952
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8952 after 18656
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18656 after 45459
Interrupted probabilistic random walk after 1040205 steps, run timeout after 3011 ms. (steps per millisecond=345 ) properties seen :0 out of 2
Probabilistic random walk after 1040205 steps, saw 127281 distinct states, run finished after 3011 ms. (steps per millisecond=345 ) properties seen :0
[2024-05-20 20:40:11] [INFO ] Invariant cache hit.
[2024-05-20 20:40:11] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 20:40:11] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-20 20:40:11] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 272/504 variables, 65/245 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 234/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 2/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 272/504 variables, 65/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 234/480 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :45459 after 280049
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 1 solved, 1 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 476ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (904 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (81 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1741607 steps, run timeout after 3001 ms. (steps per millisecond=580 ) properties seen :0 out of 1
Probabilistic random walk after 1741607 steps, saw 211144 distinct states, run finished after 3001 ms. (steps per millisecond=580 ) properties seen :0
[2024-05-20 20:40:14] [INFO ] Invariant cache hit.
[2024-05-20 20:40:14] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 272/504 variables, 65/243 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 234/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 168 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 49/54 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 144/198 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/198 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 113/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/221 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/221 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/221 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/232 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 5/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
[2024-05-20 20:40:15] [INFO ] Deduced a trap composed of 12 places in 20 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/232 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/232 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 272/504 variables, 65/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 234/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 248 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 452ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 14 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 3 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:40:15] [INFO ] Invariant cache hit.
[2024-05-20 20:40:15] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-20 20:40:15] [INFO ] Invariant cache hit.
[2024-05-20 20:40:15] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:40:15] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
[2024-05-20 20:40:15] [INFO ] Redundant transitions in 3 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:40:15] [INFO ] Invariant cache hit.
[2024-05-20 20:40:15] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:40:17] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :280049 after 2.2669e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/546 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (OVERLAPS) 0/546 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 520 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/157 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/519 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.2669e+06 after 6.85081e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/908 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:40:58] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:40:58] [INFO ] Applying decomposition
[2024-05-20 20:40:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph17576522894947018959.txt' '-o' '/tmp/graph17576522894947018959.bin' '-w' '/tmp/graph17576522894947018959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph17576522894947018959.bin' '-l' '-1' '-v' '-w' '/tmp/graph17576522894947018959.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:40:58] [INFO ] Decomposing Gal with order
[2024-05-20 20:40:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:40:58] [INFO ] Removed a total of 327 redundant transitions.
[2024-05-20 20:40:58] [INFO ] Flatten gal took : 30 ms
[2024-05-20 20:40:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 7 ms.
[2024-05-20 20:40:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3650055502326045679.gal : 3 ms
[2024-05-20 20:40:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16457337774218551328.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3650055502326045679.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16457337774218551328.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality16457337774218551328.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 194
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :194 after 194
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :194 after 205
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :205 after 206
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :206 after 213
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :213 after 276
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :276 after 15352
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :15352 after 207398
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :207398 after 1.93905e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.93905e+06 after 3.68142e+07
After SMT solving in domain Int declared 546/546 variables, and 909 constraints, problems are : Problem set: 0 solved, 389 unsolved in 23713 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 1/1 constraints]
After SMT, in 53815ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 53818ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54478 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 0 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 3 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 20:41:09] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:41:09] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:41:09] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:41:09] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:41:09] [INFO ] After 17ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:41:09] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:41:09] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:41:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16785236818665622782.gal : 1 ms
[2024-05-20 20:41:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2193199531482949999.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16785236818665622782.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2193199531482949999.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality2193199531482949999.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.002619,3484,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2,0.002858,3860,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 50 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-05 in 177474 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:41:09] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (198 resets) in 26 ms. (370 steps per ms)
BEST_FIRST walk for 10001 steps (19 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:41:09] [INFO ] Invariant cache hit.
[2024-05-20 20:41:09] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:41:09] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:41:09] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:41:09] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:41:09] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:41:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:41:09] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:41:09] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:41:10] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2024-05-20 20:41:10] [INFO ] [Nat]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:41:10] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 19 ms.
[2024-05-20 20:41:10] [INFO ] Added : 8 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 182 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 152 transition count 405
Applied a total of 12 rules in 7 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-20 20:41:10] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20559 resets) in 2130 ms. (469 steps per ms)
BEST_FIRST walk for 1000001 steps (1994 resets) in 512 ms. (1949 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:41:12] [INFO ] Invariant cache hit.
[2024-05-20 20:41:13] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:41:13] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:41:13] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:41:13] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:41:13] [INFO ] [Real]Added 373 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:41:13] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:41:13] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:41:13] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-05-20 20:41:13] [INFO ] [Nat]Added 373 Read/Feed constraints in 27 ms returned sat
[2024-05-20 20:41:13] [INFO ] Computed and/alt/rep : 261/715/261 causal constraints (skipped 134 transitions) in 18 ms.
[2024-05-20 20:41:13] [INFO ] Added : 8 causal constraints over 2 iterations in 80 ms. Result :sat
Minimization took 255 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 5 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-20 20:41:13] [INFO ] Invariant cache hit.
[2024-05-20 20:41:13] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-20 20:41:13] [INFO ] Invariant cache hit.
[2024-05-20 20:41:13] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:41:14] [INFO ] Implicit Places using invariants and state equation in 490 ms returned []
Implicit Place search using SMT with State Equation took 570 ms to find 0 implicit places.
[2024-05-20 20:41:14] [INFO ] Redundant transitions in 5 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-20 20:41:14] [INFO ] Invariant cache hit.
[2024-05-20 20:41:14] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 395 unsolved in 28111 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 395/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 930 constraints, problems are : Problem set: 0 solved, 395 unsolved in 26056 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 54252ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 54255ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54839 ms. Remains : 152/152 places, 405/405 transitions.
[2024-05-20 20:42:08] [INFO ] Flatten gal took : 11 ms
[2024-05-20 20:42:08] [INFO ] Flatten gal took : 6 ms
[2024-05-20 20:42:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11184597382377938882.gal : 2 ms
[2024-05-20 20:42:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3800550791639406828.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11184597382377938882.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3800550791639406828.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality3800550791639406828.prop.
RANDOM walk for 40000 steps (827 resets) in 178 ms. (223 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 29
BEST_FIRST walk for 40004 steps (78 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :29 after 31
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :31 after 45
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :45 after 47
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :47 after 54
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :54 after 70
BEST_FIRST walk for 40002 steps (80 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :70 after 383
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :383 after 513
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :513 after 1956
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :1956 after 4515
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4515 after 32100
Interrupted probabilistic random walk after 882158 steps, run timeout after 3001 ms. (steps per millisecond=293 ) properties seen :0 out of 2
Probabilistic random walk after 882158 steps, saw 115066 distinct states, run finished after 3001 ms. (steps per millisecond=293 ) properties seen :0
[2024-05-20 20:42:11] [INFO ] Invariant cache hit.
[2024-05-20 20:42:11] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 16/345 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 17 (OVERLAPS) 212/557 variables, 87/410 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 125/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 1 unsolved in 176 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/300 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/345 variables, 8/308 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/324 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 212/557 variables, 87/411 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 125/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/536 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 536 constraints, problems are : Problem set: 1 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 397ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
RANDOM walk for 40000 steps (821 resets) in 175 ms. (227 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (75 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :32100 after 181211
Interrupted probabilistic random walk after 1643037 steps, run timeout after 3001 ms. (steps per millisecond=547 ) properties seen :0 out of 1
Probabilistic random walk after 1643037 steps, saw 209879 distinct states, run finished after 3001 ms. (steps per millisecond=547 ) properties seen :0
[2024-05-20 20:42:15] [INFO ] Invariant cache hit.
[2024-05-20 20:42:15] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 16/345 variables, 8/307 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/345 variables, 16/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 212/557 variables, 87/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/557 variables, 125/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
SDD proceeding with computation,2 properties remain. new max is 16384
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 1 unsolved in 452 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
SDD size :181211 after 495670
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) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 39/44 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 275/319 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/319 variables, 248/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/319 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/320 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/320 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 9/329 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/329 variables, 9/299 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/329 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/329 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 16/345 variables, 8/308 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/345 variables, 16/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/345 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 212/557 variables, 87/411 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/557 variables, 125/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/557 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/557 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 536 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 4 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-20 20:42:15] [INFO ] Invariant cache hit.
[2024-05-20 20:42:15] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-20 20:42:15] [INFO ] Invariant cache hit.
[2024-05-20 20:42:15] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:42:16] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-20 20:42:16] [INFO ] Redundant transitions in 3 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-20 20:42:16] [INFO ] Invariant cache hit.
[2024-05-20 20:42:16] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 0 solved, 395 unsolved in 28619 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 395/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/929 constraints. Problems are: Problem set: 0 solved, 395 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :495670 after 4.66206e+06
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:42:58] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:42:58] [INFO ] Applying decomposition
[2024-05-20 20:42:58] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11033537144536743626.txt' '-o' '/tmp/graph11033537144536743626.bin' '-w' '/tmp/graph11033537144536743626.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11033537144536743626.bin' '-l' '-1' '-v' '-w' '/tmp/graph11033537144536743626.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:42:58] [INFO ] Decomposing Gal with order
[2024-05-20 20:42:58] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:42:58] [INFO ] Removed a total of 324 redundant transitions.
[2024-05-20 20:42:58] [INFO ] Flatten gal took : 18 ms
[2024-05-20 20:42:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 320 labels/synchronizations in 5 ms.
[2024-05-20 20:42:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality15543722007762815424.gal : 3 ms
[2024-05-20 20:42:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3770484507497246517.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality15543722007762815424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3770484507497246517.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality3770484507497246517.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 29
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :29 after 29
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :29 after 29
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :29 after 29
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :29 after 29
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :29 after 392
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :392 after 17054
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :17054 after 222810
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :222810 after 2.06902e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/930 constraints. Problems are: Problem set: 0 solved, 395 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 930 constraints, problems are : Problem set: 0 solved, 395 unsolved in 26015 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 54740ms problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 54744ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55337 ms. Remains : 152/152 places, 405/405 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 345 edges and 152 vertex of which 109 / 152 are part of one of the 3 SCC in 11 ms
Free SCC test removed 106 places
Drop transitions (Empty/Sink Transition effects.) removed 263 transitions
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 356 transitions.
Graph (complete) has 106 edges and 46 vertex of which 16 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 22 place count 16 transition count 20
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 30 place count 8 transition count 12
Iterating global reduction 1 with 8 rules applied. Total rules applied 38 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 7 transition count 11
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 5 transition count 9
Applied a total of 42 rules in 17 ms. Remains 5 /152 variables (removed 147) and now considering 9/405 (removed 396) transitions.
Running SMT prover for 1 properties.
[2024-05-20 20:43:11] [INFO ] Flow matrix only has 7 transitions (discarded 2 similar events)
// Phase 1: matrix 7 rows 5 cols
[2024-05-20 20:43:11] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 20:43:11] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:43:11] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:43:11] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:43:11] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:43:11] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:43:11] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:43:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1599150118949329476.gal : 0 ms
[2024-05-20 20:43:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8155103118009801945.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1599150118949329476.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8155103118009801945.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8155103118009801945.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 18
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,179,0.003249,3540,2,33,8,487,6,0,29,543,0
Total reachable state count : 179
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,30,0.003589,3916,2,13,8,487,7,0,32,543,0
Over-approximation ignoring read arcs solved 0 properties in 134 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-07 in 121464 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:43:11] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (204 resets) in 22 ms. (434 steps per ms)
BEST_FIRST walk for 10001 steps (22 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:43:11] [INFO ] Invariant cache hit.
[2024-05-20 20:43:11] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:43:11] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:43:11] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:43:11] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:43:11] [INFO ] [Real]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:43:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:43:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:43:11] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:43:11] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:43:11] [INFO ] [Nat]Added 361 Read/Feed constraints in 28 ms returned sat
[2024-05-20 20:43:11] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-20 20:43:11] [INFO ] Added : 11 causal constraints over 3 iterations in 97 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 14 place count 152 transition count 405
Applied a total of 14 rules in 17 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-20 20:43:11] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20432 resets) in 2154 ms. (464 steps per ms)
BEST_FIRST walk for 1000001 steps (1976 resets) in 521 ms. (1915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:43:14] [INFO ] Invariant cache hit.
[2024-05-20 20:43:14] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:43:14] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:43:14] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:43:14] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:43:14] [INFO ] [Real]Added 373 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:43:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:43:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:43:14] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:43:14] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:43:14] [INFO ] [Nat]Added 373 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:43:14] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 20 ms.
[2024-05-20 20:43:14] [INFO ] Added : 6 causal constraints over 2 iterations in 74 ms. Result :sat
Minimization took 187 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-20 20:43:15] [INFO ] Invariant cache hit.
[2024-05-20 20:43:15] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-20 20:43:15] [INFO ] Invariant cache hit.
[2024-05-20 20:43:15] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:43:15] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 545 ms to find 0 implicit places.
[2024-05-20 20:43:15] [INFO ] Redundant transitions in 7 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-20 20:43:15] [INFO ] Invariant cache hit.
[2024-05-20 20:43:15] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 29483 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 25702 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 55273ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 55278ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 12 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-20 20:44:10] [INFO ] Computed 11 invariants in 2 ms
[2024-05-20 20:44:11] [INFO ] Implicit Places using invariants in 91 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 11 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-20 20:44:11] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 20:44:11] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-20 20:44:11] [INFO ] Invariant cache hit.
[2024-05-20 20:44:11] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:44:11] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 56446 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-20 20:44:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22524 resets) in 2168 ms. (461 steps per ms)
BEST_FIRST walk for 1000001 steps (2106 resets) in 505 ms. (1976 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:44:14] [INFO ] Invariant cache hit.
[2024-05-20 20:44:14] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-20 20:44:14] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:44:14] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2024-05-20 20:44:14] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:44:14] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:44:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:44:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:44:14] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:44:14] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:44:14] [INFO ] [Nat]Added 361 Read/Feed constraints in 32 ms returned sat
[2024-05-20 20:44:14] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 21 ms.
[2024-05-20 20:44:14] [INFO ] Added : 13 causal constraints over 3 iterations in 102 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-20 20:44:14] [INFO ] Invariant cache hit.
[2024-05-20 20:44:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-20 20:44:14] [INFO ] Invariant cache hit.
[2024-05-20 20:44:14] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:44:15] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2024-05-20 20:44:15] [INFO ] Redundant transitions in 2 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-20 20:44:15] [INFO ] Invariant cache hit.
[2024-05-20 20:44:15] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
[2024-05-20 20:44:17] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 24438 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 54538ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 54541ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55060 ms. Remains : 148/148 places, 400/400 transitions.
[2024-05-20 20:45:09] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:45:09] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:45:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8789792309641635484.gal : 2 ms
[2024-05-20 20:45:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17019431981105743947.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8789792309641635484.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17019431981105743947.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality17019431981105743947.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :14 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 17
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :17 after 29
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :29 after 151
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :151 after 223
RANDOM walk for 40000 steps (897 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (85 resets) in 54 ms. (727 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :223 after 1119
BEST_FIRST walk for 40004 steps (84 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1119 after 1166
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1166 after 3927
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3927 after 4203
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :4203 after 20286
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :20286 after 46692
Interrupted probabilistic random walk after 1073230 steps, run timeout after 3001 ms. (steps per millisecond=357 ) properties seen :0 out of 2
Probabilistic random walk after 1073230 steps, saw 130229 distinct states, run finished after 3001 ms. (steps per millisecond=357 ) properties seen :0
[2024-05-20 20:45:12] [INFO ] Invariant cache hit.
[2024-05-20 20:45:13] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-20 20:45:13] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 6 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (OVERLAPS) 269/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 228/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :46692 after 281476
At refinement iteration 19 (OVERLAPS) 269/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 228/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 0/467 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 54/548 variables, 42/509 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 12/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 493ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 6 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (897 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (84 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1741461 steps, run timeout after 3001 ms. (steps per millisecond=580 ) properties seen :0 out of 1
Probabilistic random walk after 1741461 steps, saw 211539 distinct states, run finished after 3001 ms. (steps per millisecond=580 ) properties seen :0
[2024-05-20 20:45:16] [INFO ] Invariant cache hit.
[2024-05-20 20:45:16] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 269/494 variables, 60/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 228/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 166 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 34/39 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/190 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/190 variables, 121/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/190 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/191 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/215 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 5/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/225 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/225 variables, 6/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/225 variables, 1/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 20:45:16] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:45:16] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/225 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/225 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 269/494 variables, 60/240 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 228/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/494 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 54/548 variables, 42/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 12/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/548 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/548 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 522 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-20 20:45:16] [INFO ] Invariant cache hit.
[2024-05-20 20:45:17] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-20 20:45:17] [INFO ] Invariant cache hit.
[2024-05-20 20:45:17] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:45:17] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 484 ms to find 0 implicit places.
[2024-05-20 20:45:17] [INFO ] Redundant transitions in 3 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-20 20:45:17] [INFO ] Invariant cache hit.
[2024-05-20 20:45:17] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-20 20:45:19] [INFO ] Deduced a trap composed of 12 places in 26 ms of which 0 ms to minimize.
[2024-05-20 20:45:19] [INFO ] Deduced a trap composed of 12 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :281476 after 2.27291e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.27291e+06 after 6.83796e+06
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:45:59] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:45:59] [INFO ] Applying decomposition
[2024-05-20 20:45:59] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph16504266699336825820.txt' '-o' '/tmp/graph16504266699336825820.bin' '-w' '/tmp/graph16504266699336825820.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph16504266699336825820.bin' '-l' '-1' '-v' '-w' '/tmp/graph16504266699336825820.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:45:59] [INFO ] Decomposing Gal with order
[2024-05-20 20:45:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:45:59] [INFO ] Removed a total of 326 redundant transitions.
[2024-05-20 20:45:59] [INFO ] Flatten gal took : 18 ms
[2024-05-20 20:45:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 4 ms.
[2024-05-20 20:45:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13876173299620109212.gal : 2 ms
[2024-05-20 20:45:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13074234437195809067.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13876173299620109212.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13074234437195809067.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13074234437195809067.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 156
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :156 after 161
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :161 after 163
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :163 after 168
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :168 after 172
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :172 after 503
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :503 after 84683
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :84683 after 705756
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :705756 after 2.45707e+07
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 24123 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 54230ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 54234ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54732 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 0 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 4 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 20:46:11] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 20:46:11] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:46:11] [INFO ] After 5ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-20 20:46:11] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:46:11] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:46:11] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:46:11] [INFO ] After 24ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:46:11] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:46:11] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:46:11] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12407266568395840756.gal : 0 ms
[2024-05-20 20:46:11] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5650524182161453486.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12407266568395840756.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5650524182161453486.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality5650524182161453486.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.00349,3484,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2,0.004128,3860,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 73 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-09 in 180595 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:46:11] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (205 resets) in 29 ms. (333 steps per ms)
BEST_FIRST walk for 10001 steps (17 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:46:11] [INFO ] Invariant cache hit.
[2024-05-20 20:46:11] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:46:11] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:46:11] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:46:11] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:46:11] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:46:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:46:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-20 20:46:12] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:46:12] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:46:12] [INFO ] [Nat]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:46:12] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-20 20:46:12] [INFO ] Added : 6 causal constraints over 2 iterations in 75 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 14 place count 152 transition count 405
Applied a total of 14 rules in 13 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-20 20:46:12] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20373 resets) in 2121 ms. (471 steps per ms)
BEST_FIRST walk for 1000001 steps (1983 resets) in 521 ms. (1915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:46:15] [INFO ] Invariant cache hit.
[2024-05-20 20:46:15] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2024-05-20 20:46:15] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:46:15] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:46:15] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:46:15] [INFO ] [Real]Added 373 Read/Feed constraints in 27 ms returned sat
[2024-05-20 20:46:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:46:15] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:46:15] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:46:15] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2024-05-20 20:46:15] [INFO ] [Nat]Added 373 Read/Feed constraints in 32 ms returned sat
[2024-05-20 20:46:15] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 22 ms.
[2024-05-20 20:46:15] [INFO ] Added : 8 causal constraints over 2 iterations in 83 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 8 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-20 20:46:15] [INFO ] Invariant cache hit.
[2024-05-20 20:46:15] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-20 20:46:15] [INFO ] Invariant cache hit.
[2024-05-20 20:46:15] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:46:16] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 632 ms to find 0 implicit places.
[2024-05-20 20:46:16] [INFO ] Redundant transitions in 2 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-20 20:46:16] [INFO ] Invariant cache hit.
[2024-05-20 20:46:16] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 24383 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 54469ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 54473ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 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 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 5 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-20 20:47:10] [INFO ] Computed 11 invariants in 3 ms
[2024-05-20 20:47:10] [INFO ] Implicit Places using invariants in 91 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 92 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 11 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-20 20:47:10] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 20:47:10] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-20 20:47:10] [INFO ] Invariant cache hit.
[2024-05-20 20:47:11] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:47:11] [INFO ] Implicit Places using invariants and state equation in 474 ms returned []
Implicit Place search using SMT with State Equation took 558 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55789 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-20 20:47:11] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22514 resets) in 2170 ms. (460 steps per ms)
BEST_FIRST walk for 1000001 steps (2094 resets) in 502 ms. (1988 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:47:14] [INFO ] Invariant cache hit.
[2024-05-20 20:47:14] [INFO ] [Real]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-20 20:47:14] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:47:14] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-20 20:47:14] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:47:14] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:47:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:47:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:47:14] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:47:14] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:47:14] [INFO ] [Nat]Added 361 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:47:14] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 19 ms.
[2024-05-20 20:47:14] [INFO ] Added : 10 causal constraints over 2 iterations in 88 ms. Result :sat
Minimization took 153 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-20 20:47:14] [INFO ] Invariant cache hit.
[2024-05-20 20:47:14] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-20 20:47:14] [INFO ] Invariant cache hit.
[2024-05-20 20:47:14] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:47:15] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-20 20:47:15] [INFO ] Redundant transitions in 2 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-20 20:47:15] [INFO ] Invariant cache hit.
[2024-05-20 20:47:15] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-20 20:47:17] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 1 ms to minimize.
[2024-05-20 20:47:17] [INFO ] Deduced a trap composed of 12 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23738 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 53832ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53836ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54372 ms. Remains : 148/148 places, 400/400 transitions.
[2024-05-20 20:48:09] [INFO ] Flatten gal took : 9 ms
[2024-05-20 20:48:09] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:48:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12536745692274743265.gal : 12 ms
[2024-05-20 20:48:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11911123716110697898.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12536745692274743265.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11911123716110697898.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality11911123716110697898.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 22
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :22 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 155
RANDOM walk for 40000 steps (897 resets) in 572 ms. (69 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :155 after 843
BEST_FIRST walk for 40004 steps (83 resets) in 78 ms. (506 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 70 ms. (563 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :843 after 1033
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1033 after 1058
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1058 after 3503
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3503 after 8702
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8702 after 18077
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18077 after 43871
Interrupted probabilistic random walk after 1053947 steps, run timeout after 3001 ms. (steps per millisecond=351 ) properties seen :0 out of 2
Probabilistic random walk after 1053947 steps, saw 129566 distinct states, run finished after 3001 ms. (steps per millisecond=351 ) properties seen :0
[2024-05-20 20:48:12] [INFO ] Invariant cache hit.
[2024-05-20 20:48:12] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 11/226 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 206 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/226 variables, 8/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 7/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :43871 after 269346
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 193 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 420ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
RANDOM walk for 40000 steps (892 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (83 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1594470 steps, run timeout after 3001 ms. (steps per millisecond=531 ) properties seen :0 out of 1
Probabilistic random walk after 1594470 steps, saw 194470 distinct states, run finished after 3001 ms. (steps per millisecond=531 ) properties seen :0
[2024-05-20 20:48:15] [INFO ] Invariant cache hit.
[2024-05-20 20:48:15] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/226 variables, 8/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 165 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 23/215 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/215 variables, 4/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/215 variables, 1/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/215 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 189 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 374ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 8 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-20 20:48:16] [INFO ] Invariant cache hit.
[2024-05-20 20:48:16] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-05-20 20:48:16] [INFO ] Invariant cache hit.
[2024-05-20 20:48:16] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:48:16] [INFO ] Implicit Places using invariants and state equation in 464 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2024-05-20 20:48:16] [INFO ] Redundant transitions in 6 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-20 20:48:16] [INFO ] Invariant cache hit.
[2024-05-20 20:48:16] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-20 20:48:18] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 1 ms to minimize.
[2024-05-20 20:48:18] [INFO ] Deduced a trap composed of 12 places in 16 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :269346 after 2.21305e+06
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.21305e+06 after 4.06775e+06
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:48:59] [INFO ] Flatten gal took : 17 ms
[2024-05-20 20:48:59] [INFO ] Applying decomposition
[2024-05-20 20:48:59] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph8894741064428490893.txt' '-o' '/tmp/graph8894741064428490893.bin' '-w' '/tmp/graph8894741064428490893.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph8894741064428490893.bin' '-l' '-1' '-v' '-w' '/tmp/graph8894741064428490893.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:48:59] [INFO ] Decomposing Gal with order
[2024-05-20 20:48:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:48:59] [INFO ] Removed a total of 326 redundant transitions.
[2024-05-20 20:48:59] [INFO ] Flatten gal took : 24 ms
[2024-05-20 20:48:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 4 ms.
[2024-05-20 20:48:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12202634594953518783.gal : 3 ms
[2024-05-20 20:48:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5769409288183942823.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12202634594953518783.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5769409288183942823.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality5769409288183942823.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 24
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :24 after 24
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :24 after 24
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :24 after 24
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :24 after 24
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :24 after 293
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :293 after 86653
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :86653 after 699987
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :699987 after 3.27942e+07
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23755 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 53893ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53898ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54467 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 1 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 6 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 20:49:10] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:49:10] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:49:10] [INFO ] After 3ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-20 20:49:10] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:49:10] [INFO ] After 2ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:49:10] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:49:10] [INFO ] After 16ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:49:10] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:49:10] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:49:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9020990877715824850.gal : 0 ms
[2024-05-20 20:49:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8242802954199897560.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9020990877715824850.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8242802954199897560.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality8242802954199897560.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.001458,3480,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2,0.001738,3856,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 58 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-10 in 178911 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:49:10] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (199 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:49:10] [INFO ] Invariant cache hit.
[2024-05-20 20:49:10] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:49:10] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:49:10] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:49:10] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:49:10] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:49:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:49:10] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:49:10] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:49:10] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:49:11] [INFO ] [Nat]Added 361 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:49:11] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 19 ms.
[2024-05-20 20:49:11] [INFO ] Added : 6 causal constraints over 2 iterations in 77 ms. Result :sat
Minimization took 172 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 153 transition count 406
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 153 transition count 405
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 152 transition count 405
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 1 with 8 rules applied. Total rules applied 14 place count 152 transition count 405
Applied a total of 14 rules in 11 ms. Remains 152 /155 variables (removed 3) and now considering 405/408 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 152/155 places, 405/408 transitions.
// Phase 1: matrix 405 rows 152 cols
[2024-05-20 20:49:11] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20397 resets) in 2162 ms. (462 steps per ms)
BEST_FIRST walk for 1000001 steps (1994 resets) in 521 ms. (1915 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:49:13] [INFO ] Invariant cache hit.
[2024-05-20 20:49:14] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:49:14] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:49:14] [INFO ] [Real]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:49:14] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:49:14] [INFO ] [Real]Added 373 Read/Feed constraints in 27 ms returned sat
[2024-05-20 20:49:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:49:14] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:49:14] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:49:14] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2024-05-20 20:49:14] [INFO ] [Nat]Added 373 Read/Feed constraints in 29 ms returned sat
[2024-05-20 20:49:14] [INFO ] Computed and/alt/rep : 262/722/262 causal constraints (skipped 133 transitions) in 20 ms.
[2024-05-20 20:49:14] [INFO ] Added : 8 causal constraints over 2 iterations in 81 ms. Result :sat
Minimization took 225 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 6 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 152/152 places, 405/405 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 152/152 places, 405/405 transitions.
Applied a total of 0 rules in 3 ms. Remains 152 /152 variables (removed 0) and now considering 405/405 (removed 0) transitions.
[2024-05-20 20:49:14] [INFO ] Invariant cache hit.
[2024-05-20 20:49:14] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-20 20:49:14] [INFO ] Invariant cache hit.
[2024-05-20 20:49:14] [INFO ] State equation strengthened by 373 read => feed constraints.
[2024-05-20 20:49:15] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 578 ms to find 0 implicit places.
[2024-05-20 20:49:15] [INFO ] Redundant transitions in 5 ms returned []
Running 395 sub problems to find dead transitions.
[2024-05-20 20:49:15] [INFO ] Invariant cache hit.
[2024-05-20 20:49:15] [INFO ] State equation strengthened by 373 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Problem TDEAD400 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 6 (OVERLAPS) 1/557 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 8 (OVERLAPS) 0/557 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 394 unsolved
No progress, stopping.
After SMT solving in domain Real declared 557/557 variables, and 535 constraints, problems are : Problem set: 1 solved, 394 unsolved in 29083 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 394 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/151 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/151 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/151 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 405/556 variables, 151/161 constraints. Problems are: Problem set: 1 solved, 394 unsolved
Problem TDEAD139 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 373/534 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 393/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 7 (OVERLAPS) 1/557 variables, 1/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
At refinement iteration 9 (OVERLAPS) 0/557 variables, 0/928 constraints. Problems are: Problem set: 2 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Int declared 557/557 variables, and 928 constraints, problems are : Problem set: 2 solved, 393 unsolved in 24966 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 152/152 constraints, ReadFeed: 373/373 constraints, PredecessorRefiner: 393/395 constraints, Known Traps: 0/0 constraints]
After SMT, in 54138ms problems are : Problem set: 2 solved, 393 unsolved
Search for dead transitions found 2 dead transitions in 54144ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 152/152 places, 403/405 transitions.
Graph (complete) has 708 edges and 152 vertex of which 151 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 150 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 150 transition count 401
Applied a total of 3 rules in 9 ms. Remains 150 /152 variables (removed 2) and now considering 401/403 (removed 2) transitions.
// Phase 1: matrix 401 rows 150 cols
[2024-05-20 20:50:09] [INFO ] Computed 11 invariants in 2 ms
[2024-05-20 20:50:09] [INFO ] Implicit Places using invariants in 85 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 149/152 places, 401/405 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 148 transition count 408
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 148 transition count 400
Applied a total of 10 rules in 12 ms. Remains 148 /149 variables (removed 1) and now considering 400/401 (removed 1) transitions.
// Phase 1: matrix 400 rows 148 cols
[2024-05-20 20:50:09] [INFO ] Computed 10 invariants in 1 ms
[2024-05-20 20:50:09] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-20 20:50:09] [INFO ] Invariant cache hit.
[2024-05-20 20:50:09] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:50:09] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 148/152 places, 400/405 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 55339 ms. Remains : 148/152 places, 400/405 transitions.
[2024-05-20 20:50:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22532 resets) in 2195 ms. (455 steps per ms)
BEST_FIRST walk for 1000001 steps (2095 resets) in 511 ms. (1953 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:50:12] [INFO ] Invariant cache hit.
[2024-05-20 20:50:12] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:50:12] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-20 20:50:12] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2024-05-20 20:50:12] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:50:12] [INFO ] [Real]Added 361 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:50:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:50:12] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2024-05-20 20:50:12] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:50:12] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2024-05-20 20:50:12] [INFO ] [Nat]Added 361 Read/Feed constraints in 27 ms returned sat
[2024-05-20 20:50:12] [INFO ] Computed and/alt/rep : 230/576/230 causal constraints (skipped 160 transitions) in 18 ms.
[2024-05-20 20:50:12] [INFO ] Added : 8 causal constraints over 2 iterations in 76 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 3 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-20 20:50:13] [INFO ] Invariant cache hit.
[2024-05-20 20:50:13] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-20 20:50:13] [INFO ] Invariant cache hit.
[2024-05-20 20:50:13] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:50:13] [INFO ] Implicit Places using invariants and state equation in 411 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-05-20 20:50:13] [INFO ] Redundant transitions in 3 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-20 20:50:13] [INFO ] Invariant cache hit.
[2024-05-20 20:50:13] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-20 20:50:15] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
[2024-05-20 20:50:15] [INFO ] Deduced a trap composed of 12 places in 23 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23556 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 53655ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53658ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54167 ms. Remains : 148/148 places, 400/400 transitions.
[2024-05-20 20:51:07] [INFO ] Flatten gal took : 29 ms
[2024-05-20 20:51:07] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:51:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11185079247614778978.gal : 46 ms
[2024-05-20 20:51:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2017888209295645092.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11185079247614778978.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2017888209295645092.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
RANDOM walk for 40000 steps (904 resets) in 439 ms. (90 steps per ms) remains 2/2 properties
Loading property file /tmp/ReachabilityCardinality2017888209295645092.prop.
BEST_FIRST walk for 40004 steps (82 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (83 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 28
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :28 after 155
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :155 after 813
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :813 after 1033
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1033 after 1059
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1059 after 3513
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3513 after 8627
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8627 after 18368
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18368 after 44764
Interrupted probabilistic random walk after 972579 steps, run timeout after 3001 ms. (steps per millisecond=324 ) properties seen :0 out of 2
Probabilistic random walk after 972579 steps, saw 120589 distinct states, run finished after 3001 ms. (steps per millisecond=324 ) properties seen :0
[2024-05-20 20:51:10] [INFO ] Invariant cache hit.
[2024-05-20 20:51:10] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 1 solved, 1 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 392ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 5 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 148/148 places, 400/400 transitions.
SDD proceeding with computation,2 properties remain. new max is 16384
SDD size :44764 after 278624
RANDOM walk for 40000 steps (905 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (80 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1619795 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :0 out of 1
Probabilistic random walk after 1619795 steps, saw 196894 distinct states, run finished after 3001 ms. (steps per millisecond=539 ) properties seen :0
[2024-05-20 20:51:13] [INFO ] Invariant cache hit.
[2024-05-20 20:51:13] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 268/494 variables, 60/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/494 variables, 227/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 54/548 variables, 42/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/548 variables, 12/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/548 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 196 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 35/40 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 151/191 variables, 29/34 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 122/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/192 variables, 1/157 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/192 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/192 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 24/216 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/216 variables, 5/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/216 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 10/226 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/226 variables, 6/178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/226 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/226 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 268/494 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/494 variables, 227/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/494 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 54/548 variables, 42/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/548 variables, 12/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/548 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 520 constraints, problems are : Problem set: 0 solved, 1 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 412ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 148 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 19 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 148/148 places, 400/400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 148/148 places, 400/400 transitions.
Applied a total of 0 rules in 4 ms. Remains 148 /148 variables (removed 0) and now considering 400/400 (removed 0) transitions.
[2024-05-20 20:51:14] [INFO ] Invariant cache hit.
[2024-05-20 20:51:14] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-20 20:51:14] [INFO ] Invariant cache hit.
[2024-05-20 20:51:14] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:51:14] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 503 ms to find 0 implicit places.
[2024-05-20 20:51:14] [INFO ] Redundant transitions in 4 ms returned []
Running 390 sub problems to find dead transitions.
[2024-05-20 20:51:14] [INFO ] Invariant cache hit.
[2024-05-20 20:51:14] [INFO ] State equation strengthened by 361 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
[2024-05-20 20:51:17] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-20 20:51:17] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :278624 after 2.25172e+06
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 7 (OVERLAPS) 1/548 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 9 (OVERLAPS) 0/548 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 521 constraints, problems are : Problem set: 0 solved, 390 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 390 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 4 (OVERLAPS) 400/547 variables, 147/159 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/547 variables, 361/520 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/547 variables, 390/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.25172e+06 after 6.8333e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/547 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 8 (OVERLAPS) 1/548 variables, 1/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:51:57] [INFO ] Flatten gal took : 7 ms
[2024-05-20 20:51:57] [INFO ] Applying decomposition
[2024-05-20 20:51:57] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11388254330542465641.txt' '-o' '/tmp/graph11388254330542465641.bin' '-w' '/tmp/graph11388254330542465641.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11388254330542465641.bin' '-l' '-1' '-v' '-w' '/tmp/graph11388254330542465641.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:51:57] [INFO ] Decomposing Gal with order
[2024-05-20 20:51:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:51:57] [INFO ] Removed a total of 326 redundant transitions.
[2024-05-20 20:51:57] [INFO ] Flatten gal took : 45 ms
[2024-05-20 20:51:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 4 ms.
[2024-05-20 20:51:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3900354165551615563.gal : 19 ms
[2024-05-20 20:51:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10917042103034492870.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3900354165551615563.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10917042103034492870.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality10917042103034492870.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 186
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :186 after 186
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :186 after 186
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :186 after 186
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :186 after 205
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :205 after 286
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :286 after 14131
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :14131 after 202126
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :202126 after 1.90775e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.90775e+06 after 1.09985e+07
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/911 constraints. Problems are: Problem set: 0 solved, 390 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 911 constraints, problems are : Problem set: 0 solved, 390 unsolved in 23280 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 148/148 constraints, ReadFeed: 361/361 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 2/2 constraints]
After SMT, in 53401ms problems are : Problem set: 0 solved, 390 unsolved
Search for dead transitions found 0 dead transitions in 53406ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53926 ms. Remains : 148/148 places, 400/400 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 326 edges and 148 vertex of which 108 / 148 are part of one of the 3 SCC in 0 ms
Free SCC test removed 105 places
Drop transitions (Empty/Sink Transition effects.) removed 261 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 355 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 2 ms. Remains 2 /148 variables (removed 146) and now considering 3/400 (removed 397) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 20:52:08] [INFO ] Computed 0 invariants in 0 ms
[2024-05-20 20:52:08] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:52:08] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
[2024-05-20 20:52:08] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:52:08] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:52:08] [INFO ] After 2ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:52:08] [INFO ] After 20ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:52:08] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:52:08] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:52:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4960504907292095227.gal : 1 ms
[2024-05-20 20:52:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4160203234460591985.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4960504907292095227.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4160203234460591985.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality4160203234460591985.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.001828,3484,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2,0.002184,3860,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 56 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-11 in 177693 ms.
Starting property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14
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:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
// Phase 1: matrix 408 rows 155 cols
[2024-05-20 20:52:08] [INFO ] Computed 10 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (205 resets) in 28 ms. (344 steps per ms)
BEST_FIRST walk for 10001 steps (18 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:52:08] [INFO ] Invariant cache hit.
[2024-05-20 20:52:08] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:52:08] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:52:08] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:52:08] [INFO ] State equation strengthened by 361 read => feed constraints.
[2024-05-20 20:52:08] [INFO ] [Real]Added 361 Read/Feed constraints in 23 ms returned sat
[2024-05-20 20:52:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:52:08] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:52:08] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:52:08] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2024-05-20 20:52:08] [INFO ] [Nat]Added 361 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:52:08] [INFO ] Computed and/alt/rep : 264/700/264 causal constraints (skipped 134 transitions) in 20 ms.
[2024-05-20 20:52:08] [INFO ] Added : 7 causal constraints over 2 iterations in 78 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 408/408 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 152 transition count 405
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 152 transition count 404
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 8 place count 151 transition count 404
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 151 transition count 404
Applied a total of 15 rules in 11 ms. Remains 151 /155 variables (removed 4) and now considering 404/408 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 151/155 places, 404/408 transitions.
// Phase 1: matrix 404 rows 151 cols
[2024-05-20 20:52:09] [INFO ] Computed 10 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (20487 resets) in 2115 ms. (472 steps per ms)
BEST_FIRST walk for 1000001 steps (1976 resets) in 515 ms. (1937 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:52:11] [INFO ] Invariant cache hit.
[2024-05-20 20:52:11] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:52:11] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-20 20:52:11] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:52:11] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:52:11] [INFO ] [Real]Added 374 Read/Feed constraints in 24 ms returned sat
[2024-05-20 20:52:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:52:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:52:11] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:52:11] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2024-05-20 20:52:11] [INFO ] [Nat]Added 374 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:52:11] [INFO ] Computed and/alt/rep : 261/724/261 causal constraints (skipped 133 transitions) in 19 ms.
[2024-05-20 20:52:11] [INFO ] Added : 7 causal constraints over 2 iterations in 86 ms. Result :sat
Minimization took 271 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 151 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 3 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 151/151 places, 404/404 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 151/151 places, 404/404 transitions.
Applied a total of 0 rules in 4 ms. Remains 151 /151 variables (removed 0) and now considering 404/404 (removed 0) transitions.
[2024-05-20 20:52:12] [INFO ] Invariant cache hit.
[2024-05-20 20:52:12] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-20 20:52:12] [INFO ] Invariant cache hit.
[2024-05-20 20:52:12] [INFO ] State equation strengthened by 374 read => feed constraints.
[2024-05-20 20:52:12] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
[2024-05-20 20:52:12] [INFO ] Redundant transitions in 5 ms returned []
Running 394 sub problems to find dead transitions.
[2024-05-20 20:52:12] [INFO ] Invariant cache hit.
[2024-05-20 20:52:12] [INFO ] State equation strengthened by 374 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Problem TDEAD399 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 0/534 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 6 (OVERLAPS) 1/555 variables, 1/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 8 (OVERLAPS) 0/555 variables, 0/535 constraints. Problems are: Problem set: 1 solved, 393 unsolved
No progress, stopping.
After SMT solving in domain Real declared 555/555 variables, and 535 constraints, problems are : Problem set: 1 solved, 393 unsolved in 29855 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 394/394 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 393 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 9/9 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 1/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 393 unsolved
At refinement iteration 3 (OVERLAPS) 404/554 variables, 150/160 constraints. Problems are: Problem set: 1 solved, 393 unsolved
Problem TDEAD136 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/554 variables, 374/534 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/554 variables, 392/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/554 variables, 0/926 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 7 (OVERLAPS) 1/555 variables, 1/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
At refinement iteration 9 (OVERLAPS) 0/555 variables, 0/927 constraints. Problems are: Problem set: 2 solved, 392 unsolved
No progress, stopping.
After SMT solving in domain Int declared 555/555 variables, and 927 constraints, problems are : Problem set: 2 solved, 392 unsolved in 24841 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 151/151 constraints, ReadFeed: 374/374 constraints, PredecessorRefiner: 392/394 constraints, Known Traps: 0/0 constraints]
After SMT, in 54792ms problems are : Problem set: 2 solved, 392 unsolved
Search for dead transitions found 2 dead transitions in 54799ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 151/151 places, 402/404 transitions.
Graph (complete) has 708 edges and 151 vertex of which 150 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 149 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 149 transition count 400
Applied a total of 3 rules in 11 ms. Remains 149 /151 variables (removed 2) and now considering 400/402 (removed 2) transitions.
// Phase 1: matrix 400 rows 149 cols
[2024-05-20 20:53:07] [INFO ] Computed 11 invariants in 4 ms
[2024-05-20 20:53:07] [INFO ] Implicit Places using invariants in 100 ms returned [57]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 101 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 148/151 places, 400/404 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 147 transition count 407
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 147 transition count 399
Applied a total of 10 rules in 11 ms. Remains 147 /148 variables (removed 1) and now considering 399/400 (removed 1) transitions.
// Phase 1: matrix 399 rows 147 cols
[2024-05-20 20:53:07] [INFO ] Computed 10 invariants in 2 ms
[2024-05-20 20:53:07] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-20 20:53:07] [INFO ] Invariant cache hit.
[2024-05-20 20:53:08] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:53:08] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 147/151 places, 399/404 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 56150 ms. Remains : 147/151 places, 399/404 transitions.
[2024-05-20 20:53:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[10]
RANDOM walk for 1000000 steps (22597 resets) in 2293 ms. (435 steps per ms)
BEST_FIRST walk for 1000001 steps (2095 resets) in 542 ms. (1841 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[10]
[2024-05-20 20:53:11] [INFO ] Invariant cache hit.
[2024-05-20 20:53:11] [INFO ] [Real]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:53:11] [INFO ] [Real]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:53:11] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-20 20:53:11] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:53:11] [INFO ] [Real]Added 362 Read/Feed constraints in 25 ms returned sat
[2024-05-20 20:53:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-20 20:53:11] [INFO ] [Nat]Absence check using 9 positive place invariants in 2 ms returned sat
[2024-05-20 20:53:11] [INFO ] [Nat]Absence check using 9 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-20 20:53:11] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2024-05-20 20:53:11] [INFO ] [Nat]Added 362 Read/Feed constraints in 26 ms returned sat
[2024-05-20 20:53:11] [INFO ] Computed and/alt/rep : 229/578/229 causal constraints (skipped 160 transitions) in 23 ms.
[2024-05-20 20:53:11] [INFO ] Added : 5 causal constraints over 1 iterations in 66 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[10]
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:53:11] [INFO ] Invariant cache hit.
[2024-05-20 20:53:11] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-20 20:53:11] [INFO ] Invariant cache hit.
[2024-05-20 20:53:12] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:53:12] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2024-05-20 20:53:12] [INFO ] Redundant transitions in 4 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:53:12] [INFO ] Invariant cache hit.
[2024-05-20 20:53:12] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:53:14] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:53:15] [INFO ] Deduced a trap composed of 12 places in 21 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 23285 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 53442ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 53446ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54060 ms. Remains : 147/147 places, 399/399 transitions.
[2024-05-20 20:54:05] [INFO ] Flatten gal took : 15 ms
[2024-05-20 20:54:05] [INFO ] Flatten gal took : 30 ms
[2024-05-20 20:54:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality3076995101131365844.gal : 1 ms
[2024-05-20 20:54:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5280500920860550556.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality3076995101131365844.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5280500920860550556.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5280500920860550556.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,2 properties remain. new max is 16
SDD size :16 after 19
RANDOM walk for 40000 steps (903 resets) in 404 ms. (98 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 32
SDD size :19 after 28
BEST_FIRST walk for 40004 steps (81 resets) in 55 ms. (714 steps per ms) remains 2/2 properties
SDD proceeding with computation,2 properties remain. new max is 64
BEST_FIRST walk for 40003 steps (83 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
SDD size :28 after 155
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :155 after 849
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :849 after 1037
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1037 after 1062
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1062 after 3518
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :3518 after 8848
SDD proceeding with computation,2 properties remain. new max is 4096
SDD size :8848 after 18550
SDD proceeding with computation,2 properties remain. new max is 8192
SDD size :18550 after 44719
Interrupted probabilistic random walk after 1108551 steps, run timeout after 3001 ms. (steps per millisecond=369 ) properties seen :0 out of 2
Probabilistic random walk after 1108551 steps, saw 135082 distinct states, run finished after 3001 ms. (steps per millisecond=369 ) properties seen :0
[2024-05-20 20:54:09] [INFO ] Invariant cache hit.
[2024-05-20 20:54:09] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/233 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 271/504 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 233/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 1 solved, 1 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD proceeding with computation,2 properties remain. new max is 16384
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
SDD size :44719 after 277308
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/233 variables, 8/173 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 7/180 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-20 20:54:09] [INFO ] Deduced a trap composed of 12 places in 25 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 1/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 0/181 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/504 variables, 65/246 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 233/479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 446ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 4 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 147/147 places, 399/399 transitions.
RANDOM walk for 40000 steps (903 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (82 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1758912 steps, run timeout after 3001 ms. (steps per millisecond=586 ) properties seen :0 out of 1
Probabilistic random walk after 1758912 steps, saw 213951 distinct states, run finished after 3001 ms. (steps per millisecond=586 ) properties seen :0
[2024-05-20 20:54:12] [INFO ] Invariant cache hit.
[2024-05-20 20:54:12] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 11/233 variables, 8/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/233 variables, 7/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 0/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 271/504 variables, 65/244 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/504 variables, 233/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/504 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 42/546 variables, 36/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/546 variables, 6/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/546 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 51/56 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/56 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/56 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 143/199 variables, 30/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/199 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/199 variables, 114/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/199 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 23/222 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/222 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/222 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/222 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/233 variables, 8/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/233 variables, 7/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-20 20:54:12] [INFO ] Deduced a trap composed of 12 places in 22 ms of which 0 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/233 variables, 1/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/233 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 271/504 variables, 65/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/504 variables, 233/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/504 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 42/546 variables, 36/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/546 variables, 6/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 1 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 464ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 14 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 147/147 places, 399/399 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 147/147 places, 399/399 transitions.
Applied a total of 0 rules in 12 ms. Remains 147 /147 variables (removed 0) and now considering 399/399 (removed 0) transitions.
[2024-05-20 20:54:13] [INFO ] Invariant cache hit.
[2024-05-20 20:54:13] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-05-20 20:54:13] [INFO ] Invariant cache hit.
[2024-05-20 20:54:13] [INFO ] State equation strengthened by 362 read => feed constraints.
[2024-05-20 20:54:13] [INFO ] Implicit Places using invariants and state equation in 460 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-20 20:54:13] [INFO ] Redundant transitions in 3 ms returned []
Running 389 sub problems to find dead transitions.
[2024-05-20 20:54:13] [INFO ] Invariant cache hit.
[2024-05-20 20:54:13] [INFO ] State equation strengthened by 362 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:54:15] [INFO ] Deduced a trap composed of 12 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 389 unsolved
[2024-05-20 20:54:16] [INFO ] Deduced a trap composed of 12 places in 17 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 32768
SDD size :277308 after 2.23875e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 546/546 variables, and 521 constraints, problems are : Problem set: 0 solved, 389 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 389 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 399/545 variables, 146/158 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/545 variables, 362/520 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/545 variables, 389/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
SDD proceeding with computation,2 properties remain. new max is 65536
SDD size :2.23875e+06 after 6.74728e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 0/909 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/546 variables, 1/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
Detected timeout of ITS tools.
[2024-05-20 20:54:56] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:54:56] [INFO ] Applying decomposition
[2024-05-20 20:54:56] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph15261873938419195454.txt' '-o' '/tmp/graph15261873938419195454.bin' '-w' '/tmp/graph15261873938419195454.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph15261873938419195454.bin' '-l' '-1' '-v' '-w' '/tmp/graph15261873938419195454.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:54:56] [INFO ] Decomposing Gal with order
[2024-05-20 20:54:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:54:56] [INFO ] Removed a total of 327 redundant transitions.
[2024-05-20 20:54:56] [INFO ] Flatten gal took : 18 ms
[2024-05-20 20:54:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 283 labels/synchronizations in 4 ms.
[2024-05-20 20:54:56] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality12370960438959749285.gal : 3 ms
[2024-05-20 20:54:56] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10760339457586660895.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality12370960438959749285.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10760339457586660895.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality10760339457586660895.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 33
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :33 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 55
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :55 after 355
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :355 after 3956
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :3956 after 39900
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :39900 after 594428
At refinement iteration 9 (INCLUDED_ONLY) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
At refinement iteration 10 (OVERLAPS) 0/546 variables, 0/910 constraints. Problems are: Problem set: 0 solved, 389 unsolved
No progress, stopping.
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :2.46915e+08 after 7.1142e+08
After SMT solving in domain Int declared 546/546 variables, and 910 constraints, problems are : Problem set: 0 solved, 389 unsolved in 23917 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 147/147 constraints, ReadFeed: 362/362 constraints, PredecessorRefiner: 389/389 constraints, Known Traps: 2/2 constraints]
After SMT, in 54013ms problems are : Problem set: 0 solved, 389 unsolved
Search for dead transitions found 0 dead transitions in 54017ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54618 ms. Remains : 147/147 places, 399/399 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 325 edges and 147 vertex of which 107 / 147 are part of one of the 3 SCC in 0 ms
Free SCC test removed 104 places
Drop transitions (Empty/Sink Transition effects.) removed 260 transitions
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 354 transitions.
Graph (complete) has 97 edges and 43 vertex of which 12 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.0 ms
Discarding 31 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Drop transitions (Empty/Sink Transition effects.) removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 21 rules applied. Total rules applied 23 place count 12 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 11 transition count 12
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 32 place count 3 transition count 4
Iterating global reduction 2 with 8 rules applied. Total rules applied 40 place count 3 transition count 4
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 3 transition count 4
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 2 transition count 3
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 2 transition count 3
Applied a total of 43 rules in 16 ms. Remains 2 /147 variables (removed 145) and now considering 3/399 (removed 396) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 3 rows 2 cols
[2024-05-20 20:55:07] [INFO ] Computed 0 invariants in 1 ms
[2024-05-20 20:55:07] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-20 20:55:07] [INFO ] After 1ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-20 20:55:07] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:55:07] [INFO ] After 16ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-20 20:55:07] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:55:07] [INFO ] Flatten gal took : 0 ms
[2024-05-20 20:55:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9646100181387950877.gal : 0 ms
[2024-05-20 20:55:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10743811279225126739.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9646100181387950877.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10743811279225126739.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality10743811279225126739.prop.
Invariant property MIN0 does not hold.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,9,0.003774,3484,2,7,7,42,6,0,13,34,0
Total reachable state count : 9
Verifying 1 reachability properties.
Invariant property MIN0 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,2,0.004501,3860,2,3,7,42,7,0,16,34,0
Over-approximation ignoring read arcs solved 0 properties in 63 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:[1] Max Struct:[10]
Ending property specific reduction for CANInsertWithFailure-PT-010-UpperBounds-14 in 179365 ms.
[2024-05-20 20:55:07] [INFO ] Flatten gal took : 8 ms
[2024-05-20 20:55:07] [INFO ] Applying decomposition
[2024-05-20 20:55:07] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph11252783603778580536.txt' '-o' '/tmp/graph11252783603778580536.bin' '-w' '/tmp/graph11252783603778580536.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph11252783603778580536.bin' '-l' '-1' '-v' '-w' '/tmp/graph11252783603778580536.weights' '-q' '0' '-e' '0.001'
[2024-05-20 20:55:07] [INFO ] Decomposing Gal with order
[2024-05-20 20:55:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-20 20:55:07] [INFO ] Removed a total of 319 redundant transitions.
[2024-05-20 20:55:07] [INFO ] Flatten gal took : 18 ms
[2024-05-20 20:55:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 226 labels/synchronizations in 4 ms.
[2024-05-20 20:55:07] [INFO ] Time to serialize gal into /tmp/UpperBounds16444720899012401202.gal : 3 ms
[2024-05-20 20:55:07] [INFO ] Time to serialize properties into /tmp/UpperBounds9073426741388290775.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16444720899012401202.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds9073426741388290775.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds9073426741388290775.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.77361e+09,109.242,2173408,83238,4532,3.70682e+06,27932,921,6.74868e+06,306,421094,0
Total reachable state count : 1773613846
Verifying 10 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-00 :0 <= i4.u4.Node1requestsent3 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-00 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-00,0,116.281,2173408,1,0,3.70682e+06,27932,1051,6.74868e+06,326,421094,1331
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-01 :0 <= i11.u18.Node1requestsent9 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-01 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-01,0,116.827,2173408,1,0,3.70682e+06,27932,1090,6.74868e+06,335,421094,1807
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-02 :0 <= i11.u18.Node9requestsent1 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-02,0,117.078,2173408,1,0,3.70682e+06,27932,1117,6.74868e+06,345,421094,2182
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-03 :0 <= i9.u15.Node7requestsent8 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-03,0,117.126,2173408,1,0,3.70682e+06,27932,1141,6.74868e+06,350,421094,2385
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-05 :0 <= i0.u2.Node0requestsent1 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-05,0,117.126,2173408,1,0,3.70682e+06,27932,1161,6.74868e+06,350,421094,2414
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-07 :0 <= i11.u20.Node3GiveAnswer9 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-07,0,117.35,2173408,1,0,3.70682e+06,27932,1189,6.74868e+06,350,421094,2588
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-09 :0 <= i5.u11.Node5GiveAnswer4 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-09,0,117.357,2173408,1,0,3.70682e+06,27932,1211,6.74868e+06,350,421094,2886
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-10 :0 <= u14.Node6GiveAnswer3 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-10,0,117.843,2173408,1,0,3.70682e+06,27932,1237,6.74868e+06,350,421094,3031
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-11 :0 <= i4.u4.Node1GiveAnswer3 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-11 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-11,0,117.844,2173408,1,0,3.70682e+06,27932,1258,6.74868e+06,354,421094,3270
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property CANInsertWithFailure-PT-010-UpperBounds-14 :0 <= u5.Node3requestsent2 <= 1
FORMULA CANInsertWithFailure-PT-010-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
CANInsertWithFailure-PT-010-UpperBounds-14,0,117.848,2173408,1,0,3.70682e+06,27932,1276,6.74868e+06,354,421094,3333
Total runtime 2110917 ms.
BK_STOP 1716238626099
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANInsertWithFailure-PT-010"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is CANInsertWithFailure-PT-010, 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 r070-tall-171620505100101"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-010.tgz
mv CANInsertWithFailure-PT-010 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;