About the Execution of 2021-gold for CANInsertWithFailure-PT-070
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3215.199 | 3600000.00 | 3678840.00 | 8941.10 | [undef] | Time out reached |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878300022.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2021
Input is CANInsertWithFailure-PT-070, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878300022
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 30M
-rw-r--r-- 1 mcc users 9.0K May 30 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 30 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 30 15:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 30 15:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K May 25 12:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 12:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 25 12:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 25 12:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 13K May 30 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 30 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 30 15:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 30 15:40 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 12:20 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 12:20 instance
-rw-r--r-- 1 mcc users 6 May 29 12:20 iscolored
-rw-r--r-- 1 mcc users 30M May 29 12:20 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-070-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-070-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654698822652
Running Version 0
[2022-06-08 14:33:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-08 14:33:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 14:33:46] [INFO ] Load time of PNML (sax parser for PT used): 1296 ms
[2022-06-08 14:33:46] [INFO ] Transformed 10644 places.
[2022-06-08 14:33:46] [INFO ] Transformed 29820 transitions.
[2022-06-08 14:33:46] [INFO ] Parsed PT model containing 10644 places and 29820 transitions in 1498 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
// Phase 1: matrix 29820 rows 10644 cols
[2022-06-08 14:33:57] [INFO ] Computed 73 place invariants in 9836 ms
Incomplete random walk after 10000 steps, including 5 resets, run finished after 410 ms. (steps per millisecond=24 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 16) seen :0
// Phase 1: matrix 29820 rows 10644 cols
[2022-06-08 14:34:06] [INFO ] Computed 73 place invariants in 8602 ms
[2022-06-08 14:34:09] [INFO ] [Real]Absence check using 71 positive place invariants in 489 ms returned sat
[2022-06-08 14:34:09] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 144 ms returned sat
[2022-06-08 14:34:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Stream closed...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:13] [INFO ] [Real]Absence check using 71 positive place invariants in 470 ms returned sat
[2022-06-08 14:34:13] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 137 ms returned sat
[2022-06-08 14:34:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:18] [INFO ] [Real]Absence check using 71 positive place invariants in 440 ms returned sat
[2022-06-08 14:34:18] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 136 ms returned sat
[2022-06-08 14:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 2
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:23] [INFO ] [Real]Absence check using 71 positive place invariants in 456 ms returned sat
[2022-06-08 14:34:23] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 138 ms returned sat
[2022-06-08 14:34:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 3
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:28] [INFO ] [Real]Absence check using 71 positive place invariants in 455 ms returned sat
[2022-06-08 14:34:28] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 143 ms returned sat
[2022-06-08 14:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 4
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:33] [INFO ] [Real]Absence check using 71 positive place invariants in 456 ms returned sat
[2022-06-08 14:34:33] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 140 ms returned sat
[2022-06-08 14:34:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:38] [INFO ] [Real]Absence check using 71 positive place invariants in 440 ms returned sat
[2022-06-08 14:34:38] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 142 ms returned sat
[2022-06-08 14:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:41] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:43] [INFO ] [Real]Absence check using 71 positive place invariants in 447 ms returned sat
[2022-06-08 14:34:43] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 135 ms returned sat
[2022-06-08 14:34:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:46] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:48] [INFO ] [Real]Absence check using 71 positive place invariants in 441 ms returned sat
[2022-06-08 14:34:48] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 138 ms returned sat
[2022-06-08 14:34:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:51] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:53] [INFO ] [Real]Absence check using 71 positive place invariants in 442 ms returned sat
[2022-06-08 14:34:53] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 136 ms returned sat
[2022-06-08 14:34:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:34:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 9
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:34:58] [INFO ] [Real]Absence check using 71 positive place invariants in 455 ms returned sat
[2022-06-08 14:34:58] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 137 ms returned sat
[2022-06-08 14:34:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:35:01] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:35:03] [INFO ] [Real]Absence check using 71 positive place invariants in 438 ms returned sat
[2022-06-08 14:35:03] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 138 ms returned sat
[2022-06-08 14:35:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:35:06] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 11
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:35:08] [INFO ] [Real]Absence check using 71 positive place invariants in 444 ms returned sat
[2022-06-08 14:35:08] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 139 ms returned sat
[2022-06-08 14:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:35:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:35:13] [INFO ] [Real]Absence check using 71 positive place invariants in 439 ms returned sat
[2022-06-08 14:35:13] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 135 ms returned sat
[2022-06-08 14:35:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:35:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:35:18] [INFO ] [Real]Absence check using 71 positive place invariants in 463 ms returned sat
[2022-06-08 14:35:19] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 140 ms returned sat
[2022-06-08 14:35:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:35:21] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
[2022-06-08 14:35:23] [INFO ] [Real]Absence check using 71 positive place invariants in 465 ms returned sat
[2022-06-08 14:35:24] [INFO ] [Real]Absence check using 71 positive and 2 generalized place invariants in 139 ms returned sat
[2022-06-08 14:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:35:26] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 15
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:571)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2242)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0]
Support contains 16 out of 10644 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 10644/10644 places, 29820/29820 transitions.
Graph (complete) has 40251 edges and 10644 vertex of which 10643 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.56 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 490 transitions
Trivial Post-agglo rules discarded 490 transitions
Performed 490 trivial Post agglomeration. Transition count delta: 490
Iterating post reduction 0 with 490 rules applied. Total rules applied 491 place count 10643 transition count 29330
Reduce places removed 490 places and 0 transitions.
Iterating post reduction 1 with 490 rules applied. Total rules applied 981 place count 10153 transition count 29330
Performed 4821 Post agglomeration using F-continuation condition.Transition count delta: 4821
Deduced a syphon composed of 4821 places in 21 ms
Reduce places removed 4821 places and 0 transitions.
Iterating global reduction 2 with 9642 rules applied. Total rules applied 10623 place count 5332 transition count 24509
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 10624 place count 5332 transition count 24508
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10625 place count 5331 transition count 24508
Partial Free-agglomeration rule applied 4964 times.
Drop transitions removed 4964 transitions
Iterating global reduction 3 with 4964 rules applied. Total rules applied 15589 place count 5331 transition count 24508
Applied a total of 15589 rules in 14973 ms. Remains 5331 /10644 variables (removed 5313) and now considering 24508/29820 (removed 5312) transitions.
Finished structural reductions, in 1 iterations. Remains : 5331/10644 places, 24508/29820 transitions.
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:35:44] [INFO ] Computed 72 place invariants in 2148 ms
Interrupted random walk after 974268 steps, including 2326 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1}
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2510 ms. (steps per millisecond=398 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2522 ms. (steps per millisecond=396 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2515 ms. (steps per millisecond=397 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2541 ms. (steps per millisecond=393 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2526 ms. (steps per millisecond=395 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2522 ms. (steps per millisecond=396 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2519 ms. (steps per millisecond=396 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2508 ms. (steps per millisecond=398 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2516 ms. (steps per millisecond=397 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2515 ms. (steps per millisecond=397 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2485 ms. (steps per millisecond=402 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2521 ms. (steps per millisecond=396 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2505 ms. (steps per millisecond=399 ) properties (out of 16) seen :10
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2496 ms. (steps per millisecond=400 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2477 ms. (steps per millisecond=403 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2518 ms. (steps per millisecond=397 ) properties (out of 16) seen :5
[2022-06-08 14:36:54] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:36:56] [INFO ] Computed 72 place invariants in 2328 ms
[2022-06-08 14:36:57] [INFO ] [Real]Absence check using 70 positive place invariants in 162 ms returned sat
[2022-06-08 14:36:57] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 14:36:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:37:17] [INFO ] [Real]Absence check using state equation in 19808 ms returned unknown
[2022-06-08 14:37:18] [INFO ] [Real]Absence check using 70 positive place invariants in 160 ms returned sat
[2022-06-08 14:37:18] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 14:37:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:37:37] [INFO ] [Real]Absence check using state equation in 18733 ms returned unknown
[2022-06-08 14:37:37] [INFO ] [Real]Absence check using 70 positive place invariants in 163 ms returned sat
[2022-06-08 14:37:37] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 14:37:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:38:02] [INFO ] [Real]Absence check using state equation in 24911 ms returned unknown
[2022-06-08 14:38:03] [INFO ] [Real]Absence check using 70 positive place invariants in 173 ms returned sat
[2022-06-08 14:38:03] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 66 ms returned sat
[2022-06-08 14:38:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:38:28] [INFO ] [Real]Absence check using state equation in 24296 ms returned unknown
[2022-06-08 14:38:28] [INFO ] [Real]Absence check using 70 positive place invariants in 175 ms returned sat
[2022-06-08 14:38:29] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 65 ms returned sat
[2022-06-08 14:38:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:38:44] [INFO ] [Real]Absence check using state equation in 15559 ms returned sat
[2022-06-08 14:38:45] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:38:46] [INFO ] [Nat]Absence check using 70 positive place invariants in 150 ms returned sat
[2022-06-08 14:38:46] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 57 ms returned sat
[2022-06-08 14:38:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:39:01] [INFO ] [Nat]Absence check using state equation in 14938 ms returned sat
[2022-06-08 14:39:01] [INFO ] State equation strengthened by 24265 read => feed constraints.
[2022-06-08 14:39:06] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:39:09] [INFO ] [Nat]Added 24265 Read/Feed constraints in 8143 ms returned unknown
[2022-06-08 14:39:10] [INFO ] [Real]Absence check using 70 positive place invariants in 182 ms returned sat
[2022-06-08 14:39:10] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 67 ms returned sat
[2022-06-08 14:39:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:39:26] [INFO ] [Real]Absence check using state equation in 15354 ms returned sat
[2022-06-08 14:39:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:39:27] [INFO ] [Nat]Absence check using 70 positive place invariants in 152 ms returned sat
[2022-06-08 14:39:27] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 59 ms returned sat
[2022-06-08 14:39:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:39:42] [INFO ] [Nat]Absence check using state equation in 14797 ms returned sat
[2022-06-08 14:39:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:39:50] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7916 ms returned unknown
[2022-06-08 14:39:51] [INFO ] [Real]Absence check using 70 positive place invariants in 188 ms returned sat
[2022-06-08 14:39:51] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 14:39:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:40:10] [INFO ] [Real]Absence check using state equation in 18394 ms returned unknown
[2022-06-08 14:40:10] [INFO ] [Real]Absence check using 70 positive place invariants in 154 ms returned sat
[2022-06-08 14:40:10] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 14:40:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:40:24] [INFO ] [Real]Absence check using state equation in 13815 ms returned sat
[2022-06-08 14:40:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:40:26] [INFO ] [Nat]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 14:40:26] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 14:40:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:40:41] [INFO ] [Nat]Absence check using state equation in 15430 ms returned sat
[2022-06-08 14:40:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:40:49] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7914 ms returned unknown
[2022-06-08 14:40:50] [INFO ] [Real]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 14:40:50] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 14:40:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:41:10] [INFO ] [Real]Absence check using state equation in 19619 ms returned unknown
[2022-06-08 14:41:10] [INFO ] [Real]Absence check using 70 positive place invariants in 152 ms returned sat
[2022-06-08 14:41:11] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 14:41:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:41:25] [INFO ] [Real]Absence check using state equation in 14034 ms returned sat
[2022-06-08 14:41:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:41:26] [INFO ] [Nat]Absence check using 70 positive place invariants in 154 ms returned sat
[2022-06-08 14:41:26] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 14:41:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:41:42] [INFO ] [Nat]Absence check using state equation in 15817 ms returned sat
[2022-06-08 14:41:47] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:41:50] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7929 ms returned unknown
[2022-06-08 14:41:51] [INFO ] [Real]Absence check using 70 positive place invariants in 166 ms returned sat
[2022-06-08 14:41:51] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 14:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:42:05] [INFO ] [Real]Absence check using state equation in 14330 ms returned sat
[2022-06-08 14:42:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:42:07] [INFO ] [Nat]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 14:42:07] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 60 ms returned sat
[2022-06-08 14:42:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:42:20] [INFO ] [Nat]Absence check using state equation in 13717 ms returned sat
[2022-06-08 14:42:25] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:42:28] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7897 ms returned unknown
[2022-06-08 14:42:29] [INFO ] [Real]Absence check using 70 positive place invariants in 153 ms returned sat
[2022-06-08 14:42:29] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 60 ms returned sat
[2022-06-08 14:42:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:42:53] [INFO ] [Real]Absence check using state equation in 23762 ms returned unknown
[2022-06-08 14:42:54] [INFO ] [Real]Absence check using 70 positive place invariants in 185 ms returned sat
[2022-06-08 14:42:54] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 68 ms returned sat
[2022-06-08 14:42:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:43:11] [INFO ] [Real]Absence check using state equation in 17555 ms returned sat
[2022-06-08 14:43:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:43:13] [INFO ] [Nat]Absence check using 70 positive place invariants in 178 ms returned sat
[2022-06-08 14:43:13] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 14:43:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:43:31] [INFO ] [Nat]Absence check using state equation in 17516 ms returned sat
[2022-06-08 14:43:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:43:39] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7986 ms returned unknown
[2022-06-08 14:43:40] [INFO ] [Real]Absence check using 70 positive place invariants in 192 ms returned sat
[2022-06-08 14:43:40] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 66 ms returned sat
[2022-06-08 14:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:43:55] [INFO ] [Real]Absence check using state equation in 15143 ms returned sat
[2022-06-08 14:43:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:43:56] [INFO ] [Nat]Absence check using 70 positive place invariants in 157 ms returned sat
[2022-06-08 14:43:56] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 60 ms returned sat
[2022-06-08 14:43:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:44:11] [INFO ] [Nat]Absence check using state equation in 14577 ms returned sat
[2022-06-08 14:44:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:44:19] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7938 ms returned unknown
[2022-06-08 14:44:20] [INFO ] [Real]Absence check using 70 positive place invariants in 152 ms returned sat
[2022-06-08 14:44:20] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 14:44:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:44:42] [INFO ] [Real]Absence check using state equation in 22271 ms returned unknown
[2022-06-08 14:44:43] [INFO ] [Real]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 14:44:43] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 14:44:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:45:04] [INFO ] [Real]Absence check using state equation in 21034 ms returned unknown
Current structural bounds on expressions (after SMT) : [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 16 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Applied a total of 0 rules in 1853 ms. Remains 5331 /5331 variables (removed 0) and now considering 24508/24508 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5331/5331 places, 24508/24508 transitions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Applied a total of 0 rules in 1622 ms. Remains 5331 /5331 variables (removed 0) and now considering 24508/24508 (removed 0) transitions.
[2022-06-08 14:45:07] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:45:10] [INFO ] Computed 72 place invariants in 2337 ms
[2022-06-08 14:45:10] [INFO ] Implicit Places using invariants in 3045 ms returned []
Implicit Place search using SMT only with invariants took 3051 ms to find 0 implicit places.
[2022-06-08 14:45:11] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:45:13] [INFO ] Computed 72 place invariants in 2314 ms
[2022-06-08 14:45:42] [INFO ] Dead Transitions using invariants and state equation in 31873 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5331/5331 places, 24508/24508 transitions.
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:45:45] [INFO ] Computed 72 place invariants in 2683 ms
Interrupted random walk after 977663 steps, including 2328 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 11=1, 12=1, 13=1, 14=1, 15=1}
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2311 ms. (steps per millisecond=432 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2318 ms. (steps per millisecond=431 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2318 ms. (steps per millisecond=431 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 2319 ms. (steps per millisecond=431 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2317 ms. (steps per millisecond=431 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2323 ms. (steps per millisecond=430 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2323 ms. (steps per millisecond=430 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2341 ms. (steps per millisecond=427 ) properties (out of 16) seen :3
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2340 ms. (steps per millisecond=427 ) properties (out of 16) seen :7
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2341 ms. (steps per millisecond=427 ) properties (out of 16) seen :9
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2330 ms. (steps per millisecond=429 ) properties (out of 16) seen :8
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2340 ms. (steps per millisecond=427 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2318 ms. (steps per millisecond=431 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2311 ms. (steps per millisecond=432 ) properties (out of 16) seen :6
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2323 ms. (steps per millisecond=430 ) properties (out of 16) seen :5
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2320 ms. (steps per millisecond=431 ) properties (out of 16) seen :4
[2022-06-08 14:46:52] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:46:54] [INFO ] Computed 72 place invariants in 1892 ms
[2022-06-08 14:46:55] [INFO ] [Real]Absence check using 70 positive place invariants in 141 ms returned sat
[2022-06-08 14:46:55] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 57 ms returned sat
[2022-06-08 14:46:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:47:11] [INFO ] [Real]Absence check using state equation in 15889 ms returned unknown
[2022-06-08 14:47:12] [INFO ] [Real]Absence check using 70 positive place invariants in 144 ms returned sat
[2022-06-08 14:47:12] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 58 ms returned sat
[2022-06-08 14:47:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:47:29] [INFO ] [Real]Absence check using state equation in 17284 ms returned sat
[2022-06-08 14:47:30] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:47:31] [INFO ] [Nat]Absence check using 70 positive place invariants in 144 ms returned sat
[2022-06-08 14:47:31] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 56 ms returned sat
[2022-06-08 14:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:47:48] [INFO ] [Nat]Absence check using state equation in 17381 ms returned sat
[2022-06-08 14:47:49] [INFO ] State equation strengthened by 24265 read => feed constraints.
[2022-06-08 14:47:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:47:57] [INFO ] [Nat]Added 24265 Read/Feed constraints in 8060 ms returned unknown
[2022-06-08 14:47:58] [INFO ] [Real]Absence check using 70 positive place invariants in 145 ms returned sat
[2022-06-08 14:47:58] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 57 ms returned sat
[2022-06-08 14:47:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:48:17] [INFO ] [Real]Absence check using state equation in 19536 ms returned unknown
[2022-06-08 14:48:18] [INFO ] [Real]Absence check using 70 positive place invariants in 146 ms returned sat
[2022-06-08 14:48:18] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 59 ms returned sat
[2022-06-08 14:48:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:48:39] [INFO ] [Real]Absence check using state equation in 21212 ms returned unknown
[2022-06-08 14:48:40] [INFO ] [Real]Absence check using 70 positive place invariants in 146 ms returned sat
[2022-06-08 14:48:40] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 59 ms returned sat
[2022-06-08 14:48:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:48:52] [INFO ] [Real]Absence check using state equation in 12042 ms returned sat
[2022-06-08 14:48:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:48:54] [INFO ] [Nat]Absence check using 70 positive place invariants in 140 ms returned sat
[2022-06-08 14:48:54] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 54 ms returned sat
[2022-06-08 14:48:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:49:09] [INFO ] [Nat]Absence check using state equation in 15117 ms returned sat
[2022-06-08 14:49:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:49:17] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7930 ms returned unknown
[2022-06-08 14:49:18] [INFO ] [Real]Absence check using 70 positive place invariants in 212 ms returned sat
[2022-06-08 14:49:18] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 60 ms returned sat
[2022-06-08 14:49:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:49:30] [INFO ] [Real]Absence check using state equation in 12704 ms returned sat
[2022-06-08 14:49:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:49:32] [INFO ] [Nat]Absence check using 70 positive place invariants in 143 ms returned sat
[2022-06-08 14:49:32] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 56 ms returned sat
[2022-06-08 14:49:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:49:49] [INFO ] [Nat]Absence check using state equation in 16477 ms returned sat
[2022-06-08 14:49:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:49:57] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7925 ms returned unknown
[2022-06-08 14:49:57] [INFO ] [Real]Absence check using 70 positive place invariants in 144 ms returned sat
[2022-06-08 14:49:57] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 59 ms returned sat
[2022-06-08 14:49:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:50:13] [INFO ] [Real]Absence check using state equation in 15249 ms returned sat
[2022-06-08 14:50:13] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:50:14] [INFO ] [Nat]Absence check using 70 positive place invariants in 142 ms returned sat
[2022-06-08 14:50:14] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 55 ms returned sat
[2022-06-08 14:50:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:50:31] [INFO ] [Nat]Absence check using state equation in 16247 ms returned sat
[2022-06-08 14:50:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:50:39] [INFO ] [Nat]Added 24265 Read/Feed constraints in 8001 ms returned unknown
[2022-06-08 14:50:39] [INFO ] [Real]Absence check using 70 positive place invariants in 142 ms returned sat
[2022-06-08 14:50:40] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 57 ms returned sat
[2022-06-08 14:50:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:50:52] [INFO ] [Real]Absence check using state equation in 12863 ms returned sat
[2022-06-08 14:50:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:50:54] [INFO ] [Nat]Absence check using 70 positive place invariants in 153 ms returned sat
[2022-06-08 14:50:54] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 59 ms returned sat
[2022-06-08 14:50:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:51:07] [INFO ] [Nat]Absence check using state equation in 12735 ms returned sat
[2022-06-08 14:51:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:51:15] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7887 ms returned unknown
[2022-06-08 14:51:16] [INFO ] [Real]Absence check using 70 positive place invariants in 142 ms returned sat
[2022-06-08 14:51:16] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 59 ms returned sat
[2022-06-08 14:51:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:51:35] [INFO ] [Real]Absence check using state equation in 19848 ms returned unknown
[2022-06-08 14:51:36] [INFO ] [Real]Absence check using 70 positive place invariants in 141 ms returned sat
[2022-06-08 14:51:36] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 57 ms returned sat
[2022-06-08 14:51:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:51:51] [INFO ] [Real]Absence check using state equation in 14776 ms returned sat
[2022-06-08 14:51:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:51:53] [INFO ] [Nat]Absence check using 70 positive place invariants in 164 ms returned sat
[2022-06-08 14:51:53] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 14:51:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:52:08] [INFO ] [Nat]Absence check using state equation in 14662 ms returned sat
[2022-06-08 14:52:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:52:16] [INFO ] [Nat]Added 24265 Read/Feed constraints in 8010 ms returned unknown
[2022-06-08 14:52:17] [INFO ] [Real]Absence check using 70 positive place invariants in 150 ms returned sat
[2022-06-08 14:52:17] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 14:52:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:52:30] [INFO ] [Real]Absence check using state equation in 13765 ms returned sat
[2022-06-08 14:52:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:52:32] [INFO ] [Nat]Absence check using 70 positive place invariants in 144 ms returned sat
[2022-06-08 14:52:32] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 56 ms returned sat
[2022-06-08 14:52:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:52:46] [INFO ] [Nat]Absence check using state equation in 13962 ms returned sat
[2022-06-08 14:52:51] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:52:54] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7815 ms returned unknown
[2022-06-08 14:52:55] [INFO ] [Real]Absence check using 70 positive place invariants in 210 ms returned sat
[2022-06-08 14:52:55] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 85 ms returned sat
[2022-06-08 14:52:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:53:16] [INFO ] [Real]Absence check using state equation in 21727 ms returned unknown
[2022-06-08 14:53:17] [INFO ] [Real]Absence check using 70 positive place invariants in 146 ms returned sat
[2022-06-08 14:53:18] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 58 ms returned sat
[2022-06-08 14:53:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:53:32] [INFO ] [Real]Absence check using state equation in 14100 ms returned sat
[2022-06-08 14:53:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:53:34] [INFO ] [Nat]Absence check using 70 positive place invariants in 145 ms returned sat
[2022-06-08 14:53:34] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 57 ms returned sat
[2022-06-08 14:53:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:53:50] [INFO ] [Nat]Absence check using state equation in 16055 ms returned sat
[2022-06-08 14:53:54] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:53:57] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7839 ms returned unknown
[2022-06-08 14:53:58] [INFO ] [Real]Absence check using 70 positive place invariants in 142 ms returned sat
[2022-06-08 14:53:58] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 57 ms returned sat
[2022-06-08 14:53:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:54:11] [INFO ] [Real]Absence check using state equation in 12756 ms returned sat
[2022-06-08 14:54:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:54:13] [INFO ] [Nat]Absence check using 70 positive place invariants in 144 ms returned sat
[2022-06-08 14:54:13] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 55 ms returned sat
[2022-06-08 14:54:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:54:27] [INFO ] [Nat]Absence check using state equation in 14230 ms returned sat
[2022-06-08 14:54:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:54:35] [INFO ] [Nat]Added 24265 Read/Feed constraints in 7895 ms returned unknown
[2022-06-08 14:54:36] [INFO ] [Real]Absence check using 70 positive place invariants in 151 ms returned sat
[2022-06-08 14:54:36] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 60 ms returned sat
[2022-06-08 14:54:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:54:57] [INFO ] [Real]Absence check using state equation in 20921 ms returned unknown
[2022-06-08 14:54:58] [INFO ] [Real]Absence check using 70 positive place invariants in 153 ms returned sat
[2022-06-08 14:54:58] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 14:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:55:18] [INFO ] [Real]Absence check using state equation in 20480 ms returned unknown
Current structural bounds on expressions (after SMT) : [70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70, 70] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 16 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Applied a total of 0 rules in 1748 ms. Remains 5331 /5331 variables (removed 0) and now considering 24508/24508 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5331/5331 places, 24508/24508 transitions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Applied a total of 0 rules in 1723 ms. Remains 5331 /5331 variables (removed 0) and now considering 24508/24508 (removed 0) transitions.
[2022-06-08 14:55:22] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:55:24] [INFO ] Computed 72 place invariants in 2028 ms
[2022-06-08 14:55:24] [INFO ] Implicit Places using invariants in 2742 ms returned []
Implicit Place search using SMT only with invariants took 2744 ms to find 0 implicit places.
[2022-06-08 14:55:24] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:55:26] [INFO ] Computed 72 place invariants in 2037 ms
[2022-06-08 14:55:27] [INFO ] Dead Transitions using invariants and state equation in 2710 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5331/5331 places, 24508/24508 transitions.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-00
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:55:29] [INFO ] Computed 72 place invariants in 2078 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 14:55:30] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:55:32] [INFO ] Computed 72 place invariants in 2068 ms
[2022-06-08 14:55:32] [INFO ] [Real]Absence check using 70 positive place invariants in 153 ms returned sat
[2022-06-08 14:55:33] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 14:55:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:55:37] [INFO ] [Real]Absence check using state equation in 4110 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[0]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 5322 transition count 24499
Applied a total of 24 rules in 5039 ms. Remains 5322 /5331 variables (removed 9) and now considering 24499/24508 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5331 places, 24499/24508 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:55:44] [INFO ] Computed 72 place invariants in 2041 ms
Incomplete random walk after 1000000 steps, including 2380 resets, run finished after 29416 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2472 ms. (steps per millisecond=404 ) properties (out of 1) seen :1
[2022-06-08 14:56:16] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:56:18] [INFO ] Computed 72 place invariants in 2210 ms
[2022-06-08 14:56:19] [INFO ] [Real]Absence check using 70 positive place invariants in 151 ms returned sat
[2022-06-08 14:56:19] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 60 ms returned sat
[2022-06-08 14:56:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:56:32] [INFO ] [Real]Absence check using state equation in 13204 ms returned sat
[2022-06-08 14:56:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:56:34] [INFO ] [Nat]Absence check using 70 positive place invariants in 153 ms returned sat
[2022-06-08 14:56:34] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 58 ms returned sat
[2022-06-08 14:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:56:47] [INFO ] [Nat]Absence check using state equation in 13716 ms returned sat
[2022-06-08 14:56:48] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 14:56:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:56:56] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7947 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1710 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1696 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 14:56:59] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:57:01] [INFO ] Computed 72 place invariants in 2031 ms
[2022-06-08 14:57:02] [INFO ] Implicit Places using invariants in 2745 ms returned []
Implicit Place search using SMT only with invariants took 2746 ms to find 0 implicit places.
[2022-06-08 14:57:02] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:57:04] [INFO ] Computed 72 place invariants in 2075 ms
[2022-06-08 14:57:26] [INFO ] Dead Transitions using invariants and state equation in 23806 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:57:28] [INFO ] Computed 72 place invariants in 2105 ms
Incomplete random walk after 1000000 steps, including 2380 resets, run finished after 29709 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2493 ms. (steps per millisecond=401 ) properties (out of 1) seen :1
[2022-06-08 14:58:00] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:58:02] [INFO ] Computed 72 place invariants in 2122 ms
[2022-06-08 14:58:03] [INFO ] [Real]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 14:58:03] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 14:58:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:58:17] [INFO ] [Real]Absence check using state equation in 13736 ms returned sat
[2022-06-08 14:58:17] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:58:18] [INFO ] [Nat]Absence check using 70 positive place invariants in 160 ms returned sat
[2022-06-08 14:58:18] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 60 ms returned sat
[2022-06-08 14:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 14:58:33] [INFO ] [Nat]Absence check using state equation in 15070 ms returned sat
[2022-06-08 14:58:34] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 14:58:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 14:58:42] [INFO ] [Nat]Added 24289 Read/Feed constraints in 8041 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1745 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1745 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 14:58:45] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:58:47] [INFO ] Computed 72 place invariants in 2160 ms
[2022-06-08 14:58:48] [INFO ] Implicit Places using invariants in 2896 ms returned []
Implicit Place search using SMT only with invariants took 2897 ms to find 0 implicit places.
[2022-06-08 14:58:48] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:58:50] [INFO ] Computed 72 place invariants in 2118 ms
[2022-06-08 14:58:51] [INFO ] Dead Transitions using invariants and state equation in 2811 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-00 in 203736 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-01
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:58:53] [INFO ] Computed 72 place invariants in 2080 ms
Incomplete random walk after 10000 steps, including 24 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2022-06-08 14:58:53] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 14:58:55] [INFO ] Computed 72 place invariants in 2098 ms
[2022-06-08 14:58:56] [INFO ] [Real]Absence check using 70 positive place invariants in 168 ms returned sat
[2022-06-08 14:58:56] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 14:58:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:59:00] [INFO ] [Real]Absence check using state equation in 4072 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[0]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 5322 transition count 24499
Applied a total of 24 rules in 5253 ms. Remains 5322 /5331 variables (removed 9) and now considering 24499/24508 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5331 places, 24499/24508 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:59:08] [INFO ] Computed 72 place invariants in 2125 ms
Interrupted random walk after 989303 steps, including 2355 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2508 ms. (steps per millisecond=398 ) properties (out of 1) seen :1
[2022-06-08 14:59:40] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 14:59:42] [INFO ] Computed 72 place invariants in 2049 ms
[2022-06-08 14:59:43] [INFO ] [Real]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 14:59:43] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 14:59:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 14:59:57] [INFO ] [Real]Absence check using state equation in 13794 ms returned sat
[2022-06-08 14:59:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 14:59:59] [INFO ] [Nat]Absence check using 70 positive place invariants in 159 ms returned sat
[2022-06-08 14:59:59] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 14:59:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:00:13] [INFO ] [Nat]Absence check using state equation in 14529 ms returned sat
[2022-06-08 15:00:14] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 15:00:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:00:21] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7956 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1765 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1847 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 15:00:25] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:00:27] [INFO ] Computed 72 place invariants in 2103 ms
[2022-06-08 15:00:28] [INFO ] Implicit Places using invariants in 2816 ms returned []
Implicit Place search using SMT only with invariants took 2818 ms to find 0 implicit places.
[2022-06-08 15:00:28] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:00:30] [INFO ] Computed 72 place invariants in 2241 ms
[2022-06-08 15:00:31] [INFO ] Dead Transitions using invariants and state equation in 2950 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:00:33] [INFO ] Computed 72 place invariants in 2145 ms
Interrupted random walk after 994020 steps, including 2369 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2517 ms. (steps per millisecond=397 ) properties (out of 1) seen :1
[2022-06-08 15:01:06] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:01:08] [INFO ] Computed 72 place invariants in 2101 ms
[2022-06-08 15:01:09] [INFO ] [Real]Absence check using 70 positive place invariants in 158 ms returned sat
[2022-06-08 15:01:09] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:01:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:01:23] [INFO ] [Real]Absence check using state equation in 14081 ms returned sat
[2022-06-08 15:01:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:01:24] [INFO ] [Nat]Absence check using 70 positive place invariants in 161 ms returned sat
[2022-06-08 15:01:24] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 59 ms returned sat
[2022-06-08 15:01:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:01:39] [INFO ] [Nat]Absence check using state equation in 14094 ms returned sat
[2022-06-08 15:01:39] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 15:01:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:01:47] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7955 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1738 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1741 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 15:01:50] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:01:52] [INFO ] Computed 72 place invariants in 2063 ms
[2022-06-08 15:01:53] [INFO ] Implicit Places using invariants in 2766 ms returned []
Implicit Place search using SMT only with invariants took 2767 ms to find 0 implicit places.
[2022-06-08 15:01:53] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:01:55] [INFO ] Computed 72 place invariants in 2036 ms
[2022-06-08 15:01:56] [INFO ] Dead Transitions using invariants and state equation in 2748 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-01 in 184880 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-02
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:01:58] [INFO ] Computed 72 place invariants in 2063 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 15:01:58] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:02:00] [INFO ] Computed 72 place invariants in 2087 ms
[2022-06-08 15:02:01] [INFO ] [Real]Absence check using 70 positive place invariants in 159 ms returned sat
[2022-06-08 15:02:01] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:02:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:02:05] [INFO ] [Real]Absence check using state equation in 4098 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 5322 transition count 24499
Applied a total of 24 rules in 5087 ms. Remains 5322 /5331 variables (removed 9) and now considering 24499/24508 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5331 places, 24499/24508 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:02:12] [INFO ] Computed 72 place invariants in 2046 ms
Interrupted random walk after 989372 steps, including 2356 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2509 ms. (steps per millisecond=398 ) properties (out of 1) seen :1
[2022-06-08 15:02:45] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:02:47] [INFO ] Computed 72 place invariants in 2196 ms
[2022-06-08 15:02:48] [INFO ] [Real]Absence check using 70 positive place invariants in 151 ms returned sat
[2022-06-08 15:02:48] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:02:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:03:02] [INFO ] [Real]Absence check using state equation in 13595 ms returned sat
[2022-06-08 15:03:02] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:03:03] [INFO ] [Nat]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 15:03:03] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:03:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:03:18] [INFO ] [Nat]Absence check using state equation in 14295 ms returned sat
[2022-06-08 15:03:18] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 15:03:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:03:26] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7971 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1816 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1814 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 15:03:29] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:03:32] [INFO ] Computed 72 place invariants in 2164 ms
[2022-06-08 15:03:32] [INFO ] Implicit Places using invariants in 2905 ms returned []
Implicit Place search using SMT only with invariants took 2906 ms to find 0 implicit places.
[2022-06-08 15:03:32] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:03:34] [INFO ] Computed 72 place invariants in 2047 ms
[2022-06-08 15:03:35] [INFO ] Dead Transitions using invariants and state equation in 2701 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-02 in 99263 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-03
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:03:37] [INFO ] Computed 72 place invariants in 2068 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2022-06-08 15:03:37] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:03:40] [INFO ] Computed 72 place invariants in 2061 ms
[2022-06-08 15:03:40] [INFO ] [Real]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 15:03:40] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 60 ms returned sat
[2022-06-08 15:03:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:03:45] [INFO ] [Real]Absence check using state equation in 4096 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 5322 transition count 24499
Applied a total of 24 rules in 5236 ms. Remains 5322 /5331 variables (removed 9) and now considering 24499/24508 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5331 places, 24499/24508 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:03:52] [INFO ] Computed 72 place invariants in 2098 ms
Incomplete random walk after 1000000 steps, including 2379 resets, run finished after 29778 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2463 ms. (steps per millisecond=406 ) properties (out of 1) seen :1
[2022-06-08 15:04:24] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:04:26] [INFO ] Computed 72 place invariants in 2297 ms
[2022-06-08 15:04:27] [INFO ] [Real]Absence check using 70 positive place invariants in 166 ms returned sat
[2022-06-08 15:04:27] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:04:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:04:41] [INFO ] [Real]Absence check using state equation in 13729 ms returned sat
[2022-06-08 15:04:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:04:43] [INFO ] [Nat]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 15:04:43] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:04:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:04:58] [INFO ] [Nat]Absence check using state equation in 14991 ms returned sat
[2022-06-08 15:04:58] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 15:05:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:05:06] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7943 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1718 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1708 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 15:05:09] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:05:12] [INFO ] Computed 72 place invariants in 2097 ms
[2022-06-08 15:05:12] [INFO ] Implicit Places using invariants in 2820 ms returned []
Implicit Place search using SMT only with invariants took 2821 ms to find 0 implicit places.
[2022-06-08 15:05:12] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:05:14] [INFO ] Computed 72 place invariants in 2048 ms
[2022-06-08 15:05:15] [INFO ] Dead Transitions using invariants and state equation in 2761 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-03 in 99993 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-04
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:05:17] [INFO ] Computed 72 place invariants in 2156 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 15:05:18] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:05:20] [INFO ] Computed 72 place invariants in 2091 ms
[2022-06-08 15:05:20] [INFO ] [Real]Absence check using 70 positive place invariants in 147 ms returned sat
[2022-06-08 15:05:20] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:05:25] [INFO ] [Real]Absence check using state equation in 4177 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[0]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5069 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:05:32] [INFO ] Computed 72 place invariants in 2120 ms
Incomplete random walk after 1000000 steps, including 2375 resets, run finished after 29818 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2525 ms. (steps per millisecond=396 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:06:06] [INFO ] Computed 72 place invariants in 2086 ms
[2022-06-08 15:06:07] [INFO ] [Real]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 15:06:07] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:06:21] [INFO ] [Real]Absence check using state equation in 13783 ms returned sat
[2022-06-08 15:06:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:06:23] [INFO ] [Nat]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 15:06:23] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 70 ms returned sat
[2022-06-08 15:06:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:06:37] [INFO ] [Nat]Absence check using state equation in 14562 ms returned sat
[2022-06-08 15:06:38] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:06:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:06:46] [INFO ] [Nat]Added 24288 Read/Feed constraints in 8056 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1707 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1725 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:06:51] [INFO ] Computed 72 place invariants in 2204 ms
[2022-06-08 15:06:52] [INFO ] Implicit Places using invariants in 2922 ms returned []
Implicit Place search using SMT only with invariants took 2924 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:06:54] [INFO ] Computed 72 place invariants in 2124 ms
[2022-06-08 15:06:55] [INFO ] Dead Transitions using invariants and state equation in 2769 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:06:57] [INFO ] Computed 72 place invariants in 2094 ms
Incomplete random walk after 1000000 steps, including 2376 resets, run finished after 29849 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2506 ms. (steps per millisecond=399 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:07:31] [INFO ] Computed 72 place invariants in 2152 ms
[2022-06-08 15:07:32] [INFO ] [Real]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 15:07:32] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:07:47] [INFO ] [Real]Absence check using state equation in 14683 ms returned sat
[2022-06-08 15:07:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:07:49] [INFO ] [Nat]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 15:07:49] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:08:03] [INFO ] [Nat]Absence check using state equation in 14843 ms returned sat
[2022-06-08 15:08:04] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:08:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:08:12] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7973 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1738 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1739 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:08:17] [INFO ] Computed 72 place invariants in 2077 ms
[2022-06-08 15:08:18] [INFO ] Implicit Places using invariants in 2798 ms returned []
Implicit Place search using SMT only with invariants took 2799 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:08:20] [INFO ] Computed 72 place invariants in 2146 ms
[2022-06-08 15:08:21] [INFO ] Dead Transitions using invariants and state equation in 2868 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-04 in 185828 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-05
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:08:23] [INFO ] Computed 72 place invariants in 2038 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2022-06-08 15:08:23] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:08:25] [INFO ] Computed 72 place invariants in 2013 ms
[2022-06-08 15:08:26] [INFO ] [Real]Absence check using 70 positive place invariants in 160 ms returned sat
[2022-06-08 15:08:26] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:08:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:08:30] [INFO ] [Real]Absence check using state equation in 4081 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5090 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:08:37] [INFO ] Computed 72 place invariants in 2018 ms
Incomplete random walk after 1000000 steps, including 2378 resets, run finished after 29911 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2506 ms. (steps per millisecond=399 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:09:12] [INFO ] Computed 72 place invariants in 2034 ms
[2022-06-08 15:09:13] [INFO ] [Real]Absence check using 70 positive place invariants in 160 ms returned sat
[2022-06-08 15:09:13] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:09:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:09:27] [INFO ] [Real]Absence check using state equation in 14153 ms returned sat
[2022-06-08 15:09:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:09:29] [INFO ] [Nat]Absence check using 70 positive place invariants in 162 ms returned sat
[2022-06-08 15:09:29] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:09:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:09:44] [INFO ] [Nat]Absence check using state equation in 15389 ms returned sat
[2022-06-08 15:09:44] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:09:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:09:52] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7966 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1713 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1732 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:09:58] [INFO ] Computed 72 place invariants in 2053 ms
[2022-06-08 15:09:58] [INFO ] Implicit Places using invariants in 2734 ms returned []
Implicit Place search using SMT only with invariants took 2739 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:10:00] [INFO ] Computed 72 place invariants in 2093 ms
[2022-06-08 15:10:01] [INFO ] Dead Transitions using invariants and state equation in 2833 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-05 in 100392 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-06
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:10:03] [INFO ] Computed 72 place invariants in 2035 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2022-06-08 15:10:04] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:10:06] [INFO ] Computed 72 place invariants in 2034 ms
[2022-06-08 15:10:06] [INFO ] [Real]Absence check using 70 positive place invariants in 163 ms returned sat
[2022-06-08 15:10:07] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:10:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:10:11] [INFO ] [Real]Absence check using state equation in 4158 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5111 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:10:18] [INFO ] Computed 72 place invariants in 2039 ms
Incomplete random walk after 1000000 steps, including 2384 resets, run finished after 29832 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2556 ms. (steps per millisecond=391 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:10:52] [INFO ] Computed 72 place invariants in 2055 ms
[2022-06-08 15:10:53] [INFO ] [Real]Absence check using 70 positive place invariants in 164 ms returned sat
[2022-06-08 15:10:53] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:10:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:11:08] [INFO ] [Real]Absence check using state equation in 14586 ms returned sat
[2022-06-08 15:11:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:11:09] [INFO ] [Nat]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 15:11:09] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:11:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:11:25] [INFO ] [Nat]Absence check using state equation in 15517 ms returned sat
[2022-06-08 15:11:25] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:11:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:11:33] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7960 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1715 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1740 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:11:39] [INFO ] Computed 72 place invariants in 2159 ms
[2022-06-08 15:11:40] [INFO ] Implicit Places using invariants in 2897 ms returned []
Implicit Place search using SMT only with invariants took 2901 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:11:42] [INFO ] Computed 72 place invariants in 2113 ms
[2022-06-08 15:11:42] [INFO ] Dead Transitions using invariants and state equation in 2838 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-06 in 101195 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-07
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:11:44] [INFO ] Computed 72 place invariants in 2038 ms
Incomplete random walk after 10000 steps, including 24 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 15:11:45] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:11:47] [INFO ] Computed 72 place invariants in 2066 ms
[2022-06-08 15:11:48] [INFO ] [Real]Absence check using 70 positive place invariants in 167 ms returned sat
[2022-06-08 15:11:48] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 15:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:11:52] [INFO ] [Real]Absence check using state equation in 4061 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[0]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5183 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:11:59] [INFO ] Computed 72 place invariants in 2095 ms
Incomplete random walk after 1000000 steps, including 2387 resets, run finished after 29815 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2531 ms. (steps per millisecond=395 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:12:34] [INFO ] Computed 72 place invariants in 2140 ms
[2022-06-08 15:12:35] [INFO ] [Real]Absence check using 70 positive place invariants in 159 ms returned sat
[2022-06-08 15:12:35] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:12:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:12:49] [INFO ] [Real]Absence check using state equation in 14241 ms returned sat
[2022-06-08 15:12:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:12:50] [INFO ] [Nat]Absence check using 70 positive place invariants in 158 ms returned sat
[2022-06-08 15:12:51] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:12:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:13:06] [INFO ] [Nat]Absence check using state equation in 15546 ms returned sat
[2022-06-08 15:13:06] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:13:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:13:14] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7901 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1707 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1716 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:13:20] [INFO ] Computed 72 place invariants in 2054 ms
[2022-06-08 15:13:20] [INFO ] Implicit Places using invariants in 2763 ms returned []
Implicit Place search using SMT only with invariants took 2764 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:13:22] [INFO ] Computed 72 place invariants in 2086 ms
[2022-06-08 15:13:23] [INFO ] Dead Transitions using invariants and state equation in 2709 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:13:25] [INFO ] Computed 72 place invariants in 2011 ms
Interrupted random walk after 989808 steps, including 2358 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2507 ms. (steps per millisecond=398 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:14:00] [INFO ] Computed 72 place invariants in 2049 ms
[2022-06-08 15:14:01] [INFO ] [Real]Absence check using 70 positive place invariants in 161 ms returned sat
[2022-06-08 15:14:01] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:14:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:14:15] [INFO ] [Real]Absence check using state equation in 14171 ms returned sat
[2022-06-08 15:14:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:14:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 160 ms returned sat
[2022-06-08 15:14:16] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:14:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:14:31] [INFO ] [Nat]Absence check using state equation in 14531 ms returned sat
[2022-06-08 15:14:31] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:14:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:14:39] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7972 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1782 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1750 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:14:45] [INFO ] Computed 72 place invariants in 2049 ms
[2022-06-08 15:14:46] [INFO ] Implicit Places using invariants in 2755 ms returned []
Implicit Place search using SMT only with invariants took 2758 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:14:48] [INFO ] Computed 72 place invariants in 2124 ms
[2022-06-08 15:14:48] [INFO ] Dead Transitions using invariants and state equation in 2837 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-07 in 185944 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-08
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:14:50] [INFO ] Computed 72 place invariants in 2031 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 15:14:51] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:14:53] [INFO ] Computed 72 place invariants in 2030 ms
[2022-06-08 15:14:54] [INFO ] [Real]Absence check using 70 positive place invariants in 160 ms returned sat
[2022-06-08 15:14:54] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:14:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:14:58] [INFO ] [Real]Absence check using state equation in 4096 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 5322 transition count 24499
Applied a total of 24 rules in 5130 ms. Remains 5322 /5331 variables (removed 9) and now considering 24499/24508 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5331 places, 24499/24508 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:15:05] [INFO ] Computed 72 place invariants in 2166 ms
Incomplete random walk after 1000000 steps, including 2384 resets, run finished after 29832 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2496 ms. (steps per millisecond=400 ) properties (out of 1) seen :1
[2022-06-08 15:15:37] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:15:40] [INFO ] Computed 72 place invariants in 2100 ms
[2022-06-08 15:15:40] [INFO ] [Real]Absence check using 70 positive place invariants in 170 ms returned sat
[2022-06-08 15:15:40] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:15:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:15:55] [INFO ] [Real]Absence check using state equation in 14154 ms returned sat
[2022-06-08 15:15:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:15:56] [INFO ] [Nat]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 15:15:56] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:15:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:16:11] [INFO ] [Nat]Absence check using state equation in 14809 ms returned sat
[2022-06-08 15:16:11] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 15:16:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:16:19] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7962 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1774 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1731 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 15:16:23] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:16:25] [INFO ] Computed 72 place invariants in 2051 ms
[2022-06-08 15:16:26] [INFO ] Implicit Places using invariants in 2761 ms returned []
Implicit Place search using SMT only with invariants took 2762 ms to find 0 implicit places.
[2022-06-08 15:16:26] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:16:28] [INFO ] Computed 72 place invariants in 2113 ms
[2022-06-08 15:16:28] [INFO ] Dead Transitions using invariants and state equation in 2791 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-08 in 100037 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-09
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:16:30] [INFO ] Computed 72 place invariants in 2035 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 15:16:31] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:16:33] [INFO ] Computed 72 place invariants in 2017 ms
[2022-06-08 15:16:34] [INFO ] [Real]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 15:16:34] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:16:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:16:38] [INFO ] [Real]Absence check using state equation in 4102 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[0]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5078 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:16:45] [INFO ] Computed 72 place invariants in 2171 ms
Incomplete random walk after 1000000 steps, including 2380 resets, run finished after 29800 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2480 ms. (steps per millisecond=403 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:17:19] [INFO ] Computed 72 place invariants in 2020 ms
[2022-06-08 15:17:20] [INFO ] [Real]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 15:17:20] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:17:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:17:35] [INFO ] [Real]Absence check using state equation in 14239 ms returned sat
[2022-06-08 15:17:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:17:36] [INFO ] [Nat]Absence check using 70 positive place invariants in 159 ms returned sat
[2022-06-08 15:17:36] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:17:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:17:51] [INFO ] [Nat]Absence check using state equation in 14950 ms returned sat
[2022-06-08 15:17:51] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:17:56] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:17:59] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7962 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1722 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1711 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:18:05] [INFO ] Computed 72 place invariants in 2019 ms
[2022-06-08 15:18:06] [INFO ] Implicit Places using invariants in 2729 ms returned []
Implicit Place search using SMT only with invariants took 2730 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:18:08] [INFO ] Computed 72 place invariants in 2066 ms
[2022-06-08 15:18:08] [INFO ] Dead Transitions using invariants and state equation in 2778 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:18:10] [INFO ] Computed 72 place invariants in 2016 ms
Interrupted random walk after 998584 steps, including 2369 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2512 ms. (steps per millisecond=398 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:18:45] [INFO ] Computed 72 place invariants in 2055 ms
[2022-06-08 15:18:46] [INFO ] [Real]Absence check using 70 positive place invariants in 159 ms returned sat
[2022-06-08 15:18:46] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:18:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:19:00] [INFO ] [Real]Absence check using state equation in 14347 ms returned sat
[2022-06-08 15:19:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:19:02] [INFO ] [Nat]Absence check using 70 positive place invariants in 159 ms returned sat
[2022-06-08 15:19:02] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:19:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:19:17] [INFO ] [Nat]Absence check using state equation in 15293 ms returned sat
[2022-06-08 15:19:17] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:19:22] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:19:25] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7994 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1758 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1716 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:19:31] [INFO ] Computed 72 place invariants in 2019 ms
[2022-06-08 15:19:31] [INFO ] Implicit Places using invariants in 2720 ms returned []
Implicit Place search using SMT only with invariants took 2721 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:19:34] [INFO ] Computed 72 place invariants in 2033 ms
[2022-06-08 15:19:34] [INFO ] Dead Transitions using invariants and state equation in 2668 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-09 in 185766 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-10
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:19:36] [INFO ] Computed 72 place invariants in 2070 ms
Incomplete random walk after 10000 steps, including 24 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2022-06-08 15:19:37] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:19:39] [INFO ] Computed 72 place invariants in 2080 ms
[2022-06-08 15:19:40] [INFO ] [Real]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 15:19:40] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:19:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:19:44] [INFO ] [Real]Absence check using state equation in 4116 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[0]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 6 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 5322 transition count 24499
Applied a total of 24 rules in 5159 ms. Remains 5322 /5331 variables (removed 9) and now considering 24499/24508 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5331 places, 24499/24508 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:19:51] [INFO ] Computed 72 place invariants in 2099 ms
Interrupted random walk after 997640 steps, including 2377 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2514 ms. (steps per millisecond=397 ) properties (out of 1) seen :1
[2022-06-08 15:20:24] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:20:26] [INFO ] Computed 72 place invariants in 2108 ms
[2022-06-08 15:20:26] [INFO ] [Real]Absence check using 70 positive place invariants in 164 ms returned sat
[2022-06-08 15:20:26] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:20:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:20:42] [INFO ] [Real]Absence check using state equation in 15180 ms returned sat
[2022-06-08 15:20:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:20:43] [INFO ] [Nat]Absence check using 70 positive place invariants in 168 ms returned sat
[2022-06-08 15:20:43] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:20:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:20:59] [INFO ] [Nat]Absence check using state equation in 15467 ms returned sat
[2022-06-08 15:20:59] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 15:21:04] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:21:07] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7979 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1725 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1731 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 15:21:10] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:21:13] [INFO ] Computed 72 place invariants in 2069 ms
[2022-06-08 15:21:13] [INFO ] Implicit Places using invariants in 2783 ms returned []
Implicit Place search using SMT only with invariants took 2784 ms to find 0 implicit places.
[2022-06-08 15:21:13] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:21:15] [INFO ] Computed 72 place invariants in 2088 ms
[2022-06-08 15:21:16] [INFO ] Dead Transitions using invariants and state equation in 2799 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:21:18] [INFO ] Computed 72 place invariants in 2143 ms
Interrupted random walk after 977808 steps, including 2325 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2533 ms. (steps per millisecond=394 ) properties (out of 1) seen :1
[2022-06-08 15:21:51] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:21:53] [INFO ] Computed 72 place invariants in 2126 ms
[2022-06-08 15:21:54] [INFO ] [Real]Absence check using 70 positive place invariants in 172 ms returned sat
[2022-06-08 15:21:54] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 15:21:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:22:08] [INFO ] [Real]Absence check using state equation in 14291 ms returned sat
[2022-06-08 15:22:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:22:10] [INFO ] [Nat]Absence check using 70 positive place invariants in 154 ms returned sat
[2022-06-08 15:22:10] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:22:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:22:25] [INFO ] [Nat]Absence check using state equation in 15012 ms returned sat
[2022-06-08 15:22:25] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 15:22:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:22:33] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7968 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1701 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1700 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 15:22:36] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:22:39] [INFO ] Computed 72 place invariants in 2204 ms
[2022-06-08 15:22:39] [INFO ] Implicit Places using invariants in 2900 ms returned []
Implicit Place search using SMT only with invariants took 2907 ms to find 0 implicit places.
[2022-06-08 15:22:39] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:22:41] [INFO ] Computed 72 place invariants in 2152 ms
[2022-06-08 15:22:42] [INFO ] Dead Transitions using invariants and state equation in 2843 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-10 in 187986 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-11
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:22:44] [INFO ] Computed 72 place invariants in 2045 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 321 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
[2022-06-08 15:22:45] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:22:47] [INFO ] Computed 72 place invariants in 2058 ms
[2022-06-08 15:22:47] [INFO ] [Real]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 15:22:47] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:22:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:22:52] [INFO ] [Real]Absence check using state equation in 4174 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[0]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5038 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:22:59] [INFO ] Computed 72 place invariants in 2111 ms
Incomplete random walk after 1000000 steps, including 2381 resets, run finished after 29926 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2499 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:23:33] [INFO ] Computed 72 place invariants in 2070 ms
[2022-06-08 15:23:34] [INFO ] [Real]Absence check using 70 positive place invariants in 153 ms returned sat
[2022-06-08 15:23:34] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:23:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:23:49] [INFO ] [Real]Absence check using state equation in 14697 ms returned sat
[2022-06-08 15:23:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:23:51] [INFO ] [Nat]Absence check using 70 positive place invariants in 162 ms returned sat
[2022-06-08 15:23:51] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:23:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:24:06] [INFO ] [Nat]Absence check using state equation in 15219 ms returned sat
[2022-06-08 15:24:06] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:24:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:24:14] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7939 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1688 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1699 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:24:19] [INFO ] Computed 72 place invariants in 2033 ms
[2022-06-08 15:24:20] [INFO ] Implicit Places using invariants in 2728 ms returned []
Implicit Place search using SMT only with invariants took 2728 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:24:22] [INFO ] Computed 72 place invariants in 2052 ms
[2022-06-08 15:24:23] [INFO ] Dead Transitions using invariants and state equation in 2744 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:24:25] [INFO ] Computed 72 place invariants in 2028 ms
Interrupted random walk after 992321 steps, including 2364 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2486 ms. (steps per millisecond=402 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:24:59] [INFO ] Computed 72 place invariants in 2091 ms
[2022-06-08 15:25:00] [INFO ] [Real]Absence check using 70 positive place invariants in 162 ms returned sat
[2022-06-08 15:25:00] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 15:25:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:25:15] [INFO ] [Real]Absence check using state equation in 14418 ms returned sat
[2022-06-08 15:25:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:25:16] [INFO ] [Nat]Absence check using 70 positive place invariants in 164 ms returned sat
[2022-06-08 15:25:16] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:25:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:25:31] [INFO ] [Nat]Absence check using state equation in 14585 ms returned sat
[2022-06-08 15:25:31] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:25:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:25:39] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7944 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1744 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1737 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:25:45] [INFO ] Computed 72 place invariants in 2057 ms
[2022-06-08 15:25:46] [INFO ] Implicit Places using invariants in 2767 ms returned []
Implicit Place search using SMT only with invariants took 2768 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:25:48] [INFO ] Computed 72 place invariants in 2119 ms
[2022-06-08 15:25:48] [INFO ] Dead Transitions using invariants and state equation in 2811 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-11 in 186161 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-12
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:25:50] [INFO ] Computed 72 place invariants in 2041 ms
Incomplete random walk after 10000 steps, including 24 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 15:25:51] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:25:53] [INFO ] Computed 72 place invariants in 2008 ms
[2022-06-08 15:25:54] [INFO ] [Real]Absence check using 70 positive place invariants in 164 ms returned sat
[2022-06-08 15:25:54] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:25:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:25:58] [INFO ] [Real]Absence check using state equation in 4095 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5102 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:26:05] [INFO ] Computed 72 place invariants in 2195 ms
Incomplete random walk after 1000000 steps, including 2376 resets, run finished after 29896 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 27 resets, run finished after 2512 ms. (steps per millisecond=398 ) properties (out of 1) seen :1
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:26:40] [INFO ] Computed 72 place invariants in 2096 ms
[2022-06-08 15:26:40] [INFO ] [Real]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 15:26:40] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 62 ms returned sat
[2022-06-08 15:26:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:26:55] [INFO ] [Real]Absence check using state equation in 14203 ms returned sat
[2022-06-08 15:26:56] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:26:56] [INFO ] [Nat]Absence check using 70 positive place invariants in 167 ms returned sat
[2022-06-08 15:26:56] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:27:11] [INFO ] [Nat]Absence check using state equation in 14547 ms returned sat
[2022-06-08 15:27:11] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:27:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:27:19] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7971 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1711 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1707 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:27:25] [INFO ] Computed 72 place invariants in 2050 ms
[2022-06-08 15:27:25] [INFO ] Implicit Places using invariants in 2685 ms returned []
Implicit Place search using SMT only with invariants took 2691 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:27:27] [INFO ] Computed 72 place invariants in 2107 ms
[2022-06-08 15:27:53] [INFO ] Dead Transitions using invariants and state equation in 27311 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-12 in 124279 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-13
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:27:55] [INFO ] Computed 72 place invariants in 2097 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 303 ms. (steps per millisecond=33 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2022-06-08 15:27:55] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:27:57] [INFO ] Computed 72 place invariants in 2005 ms
[2022-06-08 15:27:58] [INFO ] [Real]Absence check using 70 positive place invariants in 155 ms returned sat
[2022-06-08 15:27:58] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:27:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:28:02] [INFO ] [Real]Absence check using state equation in 4131 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[0]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 5 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5062 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:28:09] [INFO ] Computed 72 place invariants in 2087 ms
Interrupted random walk after 991600 steps, including 2361 resets, run timeout after 30001 ms. (steps per millisecond=33 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2455 ms. (steps per millisecond=407 ) properties (out of 1) seen :1
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:28:44] [INFO ] Computed 72 place invariants in 2056 ms
[2022-06-08 15:28:45] [INFO ] [Real]Absence check using 70 positive place invariants in 156 ms returned sat
[2022-06-08 15:28:45] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 70 ms returned sat
[2022-06-08 15:28:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:28:59] [INFO ] [Real]Absence check using state equation in 14760 ms returned sat
[2022-06-08 15:29:00] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:29:01] [INFO ] [Nat]Absence check using 70 positive place invariants in 159 ms returned sat
[2022-06-08 15:29:01] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 61 ms returned sat
[2022-06-08 15:29:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:29:16] [INFO ] [Nat]Absence check using state equation in 14969 ms returned sat
[2022-06-08 15:29:16] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:29:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:29:24] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7973 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1706 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1736 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:29:30] [INFO ] Computed 72 place invariants in 2154 ms
[2022-06-08 15:29:31] [INFO ] Implicit Places using invariants in 2870 ms returned []
Implicit Place search using SMT only with invariants took 2873 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:29:33] [INFO ] Computed 72 place invariants in 2072 ms
[2022-06-08 15:29:33] [INFO ] Dead Transitions using invariants and state equation in 2779 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:29:36] [INFO ] Computed 72 place invariants in 2169 ms
Interrupted random walk after 982410 steps, including 2339 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 24 resets, run finished after 2546 ms. (steps per millisecond=392 ) properties (out of 1) seen :1
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:30:11] [INFO ] Computed 72 place invariants in 2406 ms
[2022-06-08 15:30:11] [INFO ] [Real]Absence check using 70 positive place invariants in 163 ms returned sat
[2022-06-08 15:30:11] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:30:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:30:27] [INFO ] [Real]Absence check using state equation in 15246 ms returned sat
[2022-06-08 15:30:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:30:28] [INFO ] [Nat]Absence check using 70 positive place invariants in 153 ms returned sat
[2022-06-08 15:30:28] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 59 ms returned sat
[2022-06-08 15:30:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:30:44] [INFO ] [Nat]Absence check using state equation in 15502 ms returned sat
[2022-06-08 15:30:44] [INFO ] State equation strengthened by 24288 read => feed constraints.
[2022-06-08 15:30:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:30:52] [INFO ] [Nat]Added 24288 Read/Feed constraints in 7941 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5323 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1779 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Starting structural reductions, iteration 0 : 5323/5323 places, 24500/24500 transitions.
Applied a total of 0 rules in 1751 ms. Remains 5323 /5323 variables (removed 0) and now considering 24500/24500 (removed 0) transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:30:58] [INFO ] Computed 72 place invariants in 2116 ms
[2022-06-08 15:30:58] [INFO ] Implicit Places using invariants in 2825 ms returned []
Implicit Place search using SMT only with invariants took 2826 ms to find 0 implicit places.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:31:01] [INFO ] Computed 72 place invariants in 2091 ms
[2022-06-08 15:31:01] [INFO ] Dead Transitions using invariants and state equation in 2731 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5323/5323 places, 24500/24500 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-13 in 188583 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-14
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:31:03] [INFO ] Computed 72 place invariants in 2205 ms
Incomplete random walk after 10000 steps, including 23 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
[2022-06-08 15:31:04] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:31:06] [INFO ] Computed 72 place invariants in 2112 ms
[2022-06-08 15:31:07] [INFO ] [Real]Absence check using 70 positive place invariants in 162 ms returned sat
[2022-06-08 15:31:07] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:31:11] [INFO ] [Real]Absence check using state equation in 4099 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 5 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 18 place count 5322 transition count 24499
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 5322 transition count 24499
Applied a total of 24 rules in 5163 ms. Remains 5322 /5331 variables (removed 9) and now considering 24499/24508 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5331 places, 24499/24508 transitions.
Normalized transition count is 24498 out of 24499 initially.
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:31:18] [INFO ] Computed 72 place invariants in 2146 ms
Incomplete random walk after 1000000 steps, including 2381 resets, run finished after 29824 ms. (steps per millisecond=33 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 26 resets, run finished after 2573 ms. (steps per millisecond=388 ) properties (out of 1) seen :1
[2022-06-08 15:31:51] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:31:53] [INFO ] Computed 72 place invariants in 2095 ms
[2022-06-08 15:31:54] [INFO ] [Real]Absence check using 70 positive place invariants in 163 ms returned sat
[2022-06-08 15:31:54] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 15:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:32:09] [INFO ] [Real]Absence check using state equation in 14880 ms returned sat
[2022-06-08 15:32:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 15:32:10] [INFO ] [Nat]Absence check using 70 positive place invariants in 178 ms returned sat
[2022-06-08 15:32:10] [INFO ] [Nat]Absence check using 70 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 15:32:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 15:32:27] [INFO ] [Nat]Absence check using state equation in 16911 ms returned sat
[2022-06-08 15:32:27] [INFO ] State equation strengthened by 24289 read => feed constraints.
[2022-06-08 15:32:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 15:32:35] [INFO ] [Nat]Added 24289 Read/Feed constraints in 7972 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5322 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1720 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Starting structural reductions, iteration 0 : 5322/5322 places, 24499/24499 transitions.
Applied a total of 0 rules in 1749 ms. Remains 5322 /5322 variables (removed 0) and now considering 24499/24499 (removed 0) transitions.
[2022-06-08 15:32:39] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:32:41] [INFO ] Computed 72 place invariants in 2229 ms
[2022-06-08 15:32:42] [INFO ] Implicit Places using invariants in 2880 ms returned []
Implicit Place search using SMT only with invariants took 2881 ms to find 0 implicit places.
[2022-06-08 15:32:42] [INFO ] Flow matrix only has 24498 transitions (discarded 1 similar events)
// Phase 1: matrix 24498 rows 5322 cols
[2022-06-08 15:32:44] [INFO ] Computed 72 place invariants in 2107 ms
[2022-06-08 15:32:45] [INFO ] Dead Transitions using invariants and state equation in 2816 ms returned []
Finished structural reductions, in 1 iterations. Remains : 5322/5322 places, 24499/24499 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-14 in 103414 ms.
Starting property specific reduction for CANInsertWithFailure-PT-070-UpperBounds-15
Normalized transition count is 24501 out of 24508 initially.
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:32:47] [INFO ] Computed 72 place invariants in 2066 ms
Incomplete random walk after 10000 steps, including 24 resets, run finished after 309 ms. (steps per millisecond=32 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
[2022-06-08 15:32:47] [INFO ] Flow matrix only has 24501 transitions (discarded 7 similar events)
// Phase 1: matrix 24501 rows 5331 cols
[2022-06-08 15:32:49] [INFO ] Computed 72 place invariants in 2257 ms
[2022-06-08 15:32:50] [INFO ] [Real]Absence check using 70 positive place invariants in 191 ms returned sat
[2022-06-08 15:32:50] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 66 ms returned sat
[2022-06-08 15:32:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 15:32:54] [INFO ] [Real]Absence check using state equation in 4041 ms returned unknown
Current structural bounds on expressions (after SMT) : [70] Max seen :[1]
Support contains 1 out of 5331 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5331/5331 places, 24508/24508 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 6 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 5323 transition count 24500
Partial Free-agglomeration rule applied 7 times.
Drop transitions removed 7 transitions
Iterating global reduction 0 with 7 rules applied. Total rules applied 23 place count 5323 transition count 24500
Applied a total of 23 rules in 5148 ms. Remains 5323 /5331 variables (removed 8) and now considering 24500/24508 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 5323/5331 places, 24500/24508 transitions.
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:33:02] [INFO ] Computed 72 place invariants in 2171 ms
Interrupted random walk after 981009 steps, including 2331 resets, run timeout after 30001 ms. (steps per millisecond=32 ) properties seen :{0=1}
Incomplete Best-First random walk after 1000001 steps, including 25 resets, run finished after 2529 ms. (steps per millisecond=395 ) properties (out of 1) seen :0
// Phase 1: matrix 24500 rows 5323 cols
[2022-06-08 15:33:36] [INFO ] Computed 72 place invariants in 2158 ms
[2022-06-08 15:33:37] [INFO ] [Real]Absence check using 70 positive place invariants in 202 ms returned sat
[2022-06-08 15:33:37] [INFO ] [Real]Absence check using 70 positive and 2 generalized place invariants in 66 ms returned sat
[2022-06-08 15:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m
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-070"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2021"
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-4028"
echo " Executing tool gold2021"
echo " Input is CANInsertWithFailure-PT-070, 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 r305-smll-165463878300022"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-070.tgz
mv CANInsertWithFailure-PT-070 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 ;