About the Execution of 2021-gold for CANInsertWithFailure-PT-050
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16241.544 | 3600000.00 | 3518078.00 | 86029.20 | ? ? ? ? ? ? ? ? ? ? ? 1 ? ? ? ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2022-input.r305-smll-165463878300016.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-050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r305-smll-165463878300016
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.4K May 30 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 30 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 30 15:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K May 30 15:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 25 12:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 25 12:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.3K May 25 12:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 25 12:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 29 12:20 NewModel
-rw-r--r-- 1 mcc users 16K May 30 15:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 30 15:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K May 30 15:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K May 30 15:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 25 12:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K May 25 12:58 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 16M 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-050-UpperBounds-00
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-01
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-02
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-03
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-04
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-05
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-06
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-07
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-08
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-09
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-10
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-11
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-12
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-13
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-14
FORMULA_NAME CANInsertWithFailure-PT-050-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1654687970600
Running Version 0
[2022-06-08 11:32:53] [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 11:32:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-08 11:32:54] [INFO ] Load time of PNML (sax parser for PT used): 840 ms
[2022-06-08 11:32:54] [INFO ] Transformed 5604 places.
[2022-06-08 11:32:54] [INFO ] Transformed 15300 transitions.
[2022-06-08 11:32:54] [INFO ] Parsed PT model containing 5604 places and 15300 transitions in 974 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 15300 rows 5604 cols
[2022-06-08 11:32:56] [INFO ] Computed 53 place invariants in 1860 ms
Incomplete random walk after 10000 steps, including 7 resets, run finished after 249 ms. (steps per millisecond=40 ) properties (out of 16) seen :7
FORMULA CANInsertWithFailure-PT-050-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) 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 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 15) seen :0
// Phase 1: matrix 15300 rows 5604 cols
[2022-06-08 11:32:58] [INFO ] Computed 53 place invariants in 1574 ms
[2022-06-08 11:33:00] [INFO ] [Real]Absence check using 51 positive place invariants in 196 ms returned sat
[2022-06-08 11:33:00] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 68 ms returned sat
[2022-06-08 11:33:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java: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 11:33:04] [INFO ] [Real]Absence check using 51 positive place invariants in 182 ms returned sat
[2022-06-08 11:33:04] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 11:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:08] [INFO ] [Real]Absence check using state equation in 3907 ms returned unknown
[2022-06-08 11:33:09] [INFO ] [Real]Absence check using 51 positive place invariants in 189 ms returned sat
[2022-06-08 11:33:09] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 11:33:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:13] [INFO ] [Real]Absence check using state equation in 3863 ms returned unknown
[2022-06-08 11:33:14] [INFO ] [Real]Absence check using 51 positive place invariants in 164 ms returned sat
[2022-06-08 11:33:14] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 64 ms returned sat
[2022-06-08 11:33:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:18] [INFO ] [Real]Absence check using state equation in 4031 ms returned unknown
[2022-06-08 11:33:19] [INFO ] [Real]Absence check using 51 positive place invariants in 162 ms returned sat
[2022-06-08 11:33:19] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 66 ms returned sat
[2022-06-08 11:33:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:23] [INFO ] [Real]Absence check using state equation in 4039 ms returned unknown
[2022-06-08 11:33:24] [INFO ] [Real]Absence check using 51 positive place invariants in 186 ms returned sat
[2022-06-08 11:33:24] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 68 ms returned sat
[2022-06-08 11:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:28] [INFO ] [Real]Absence check using state equation in 3935 ms returned sat
[2022-06-08 11:33:29] [INFO ] State equation strengthened by 4950 read => feed constraints.
[2022-06-08 11:33:29] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 5
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:580)
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 11:33:29] [INFO ] [Real]Absence check using 51 positive place invariants in 164 ms returned sat
[2022-06-08 11:33:30] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 67 ms returned sat
[2022-06-08 11:33:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:34] [INFO ] [Real]Absence check using state equation in 4012 ms returned unknown
[2022-06-08 11:33:35] [INFO ] [Real]Absence check using 51 positive place invariants in 193 ms returned sat
[2022-06-08 11:33:35] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 70 ms returned sat
[2022-06-08 11:33:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:39] [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 11:33:40] [INFO ] [Real]Absence check using 51 positive place invariants in 195 ms returned sat
[2022-06-08 11:33:40] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 66 ms returned sat
[2022-06-08 11:33:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:44] [INFO ] [Real]Absence check using state equation in 3914 ms returned unknown
[2022-06-08 11:33:45] [INFO ] [Real]Absence check using 51 positive place invariants in 212 ms returned sat
[2022-06-08 11:33:45] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 75 ms returned sat
[2022-06-08 11:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:49] [INFO ] [Real]Absence check using state equation in 3933 ms returned unknown
[2022-06-08 11:33:50] [INFO ] [Real]Absence check using 51 positive place invariants in 173 ms returned sat
[2022-06-08 11:33:50] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 65 ms returned sat
[2022-06-08 11:33:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:54] [INFO ] [Real]Absence check using state equation in 4002 ms returned unknown
[2022-06-08 11:33:55] [INFO ] [Real]Absence check using 51 positive place invariants in 165 ms returned sat
[2022-06-08 11:33:55] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 63 ms returned sat
[2022-06-08 11:33:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:33:59] [INFO ] [Real]Absence check using state equation in 4043 ms returned unknown
[2022-06-08 11:34:00] [INFO ] [Real]Absence check using 51 positive place invariants in 179 ms returned sat
[2022-06-08 11:34:00] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 66 ms returned sat
[2022-06-08 11:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:34:04] [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 12
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 11:34:05] [INFO ] [Real]Absence check using 51 positive place invariants in 172 ms returned sat
[2022-06-08 11:34:05] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 65 ms returned sat
[2022-06-08 11:34:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:34:09] [INFO ] [Real]Absence check using state equation in 3948 ms returned unknown
[2022-06-08 11:34:10] [INFO ] [Real]Absence check using 51 positive place invariants in 178 ms returned sat
[2022-06-08 11:34:10] [INFO ] [Real]Absence check using 51 positive and 2 generalized place invariants in 67 ms returned sat
[2022-06-08 11:34:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:34:14] [INFO ] [Real]Absence check using state equation in 3956 ms returned unknown
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[0, 0, 0, 1, 1, 1, 0, 0, 1, 0, 0, 0, 1, 0, 1]
Support contains 15 out of 5604 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Graph (complete) has 20751 edges and 5604 vertex of which 5603 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.40 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 351 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 701 place count 5253 transition count 14950
Performed 2393 Post agglomeration using F-continuation condition.Transition count delta: 2393
Deduced a syphon composed of 2393 places in 10 ms
Reduce places removed 2393 places and 0 transitions.
Iterating global reduction 2 with 4786 rules applied. Total rules applied 5487 place count 2860 transition count 12557
Drop transitions removed 2296 transitions
Redundant transition composition rules discarded 2296 transitions
Iterating global reduction 2 with 2296 rules applied. Total rules applied 7783 place count 2860 transition count 10261
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7784 place count 2860 transition count 10260
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7785 place count 2859 transition count 10260
Partial Free-agglomeration rule applied 2643 times.
Drop transitions removed 2643 transitions
Iterating global reduction 3 with 2643 rules applied. Total rules applied 10428 place count 2859 transition count 10260
Applied a total of 10428 rules in 6012 ms. Remains 2859 /5604 variables (removed 2745) and now considering 10260/15300 (removed 5040) transitions.
Finished structural reductions, in 1 iterations. Remains : 2859/5604 places, 10260/15300 transitions.
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:34:20] [INFO ] Computed 52 place invariants in 594 ms
Incomplete random walk after 1000000 steps, including 4214 resets, run finished after 18491 ms. (steps per millisecond=54 ) properties (out of 15) seen :15
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1861 ms. (steps per millisecond=537 ) properties (out of 15) seen :7
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1863 ms. (steps per millisecond=536 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1868 ms. (steps per millisecond=535 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1854 ms. (steps per millisecond=539 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1838 ms. (steps per millisecond=544 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1798 ms. (steps per millisecond=556 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1772 ms. (steps per millisecond=564 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1837 ms. (steps per millisecond=544 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1875 ms. (steps per millisecond=533 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1898 ms. (steps per millisecond=526 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1945 ms. (steps per millisecond=514 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1912 ms. (steps per millisecond=523 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1897 ms. (steps per millisecond=527 ) properties (out of 15) seen :11
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:35:08] [INFO ] Computed 52 place invariants in 570 ms
[2022-06-08 11:35:08] [INFO ] [Real]Absence check using 50 positive place invariants in 72 ms returned sat
[2022-06-08 11:35:08] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:35:12] [INFO ] [Real]Absence check using state equation in 4014 ms returned sat
[2022-06-08 11:35:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:35:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 72 ms returned sat
[2022-06-08 11:35:13] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:35:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:35:17] [INFO ] [Nat]Absence check using state equation in 3931 ms returned sat
[2022-06-08 11:35:17] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:35:21] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:35:24] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6816 ms returned unknown
[2022-06-08 11:35:24] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:35:24] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:35:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:35:28] [INFO ] [Real]Absence check using state equation in 3812 ms returned sat
[2022-06-08 11:35:29] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:35:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:35:29] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:35:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:35:33] [INFO ] [Nat]Absence check using state equation in 3812 ms returned sat
[2022-06-08 11:35:37] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:35:40] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6809 ms returned unknown
[2022-06-08 11:35:40] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:35:40] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:35:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:35:45] [INFO ] [Real]Absence check using state equation in 4938 ms returned sat
[2022-06-08 11:35:46] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:35:46] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:35:46] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:35:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:35:51] [INFO ] [Nat]Absence check using state equation in 5355 ms returned sat
[2022-06-08 11:35:55] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:35:58] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6814 ms returned unknown
[2022-06-08 11:35:59] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:35:59] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:35:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:36:03] [INFO ] [Real]Absence check using state equation in 4071 ms returned sat
[2022-06-08 11:36:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:36:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:36:03] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:36:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:36:08] [INFO ] [Nat]Absence check using state equation in 4175 ms returned sat
[2022-06-08 11:36:11] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:36:14] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6850 ms returned unknown
[2022-06-08 11:36:15] [INFO ] [Real]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 11:36:15] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:36:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:36:19] [INFO ] [Real]Absence check using state equation in 3645 ms returned sat
[2022-06-08 11:36:19] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:36:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:36:19] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:36:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:36:23] [INFO ] [Nat]Absence check using state equation in 3573 ms returned sat
[2022-06-08 11:36:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:36:30] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6786 ms returned unknown
[2022-06-08 11:36:30] [INFO ] [Real]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 11:36:30] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:36:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:36:34] [INFO ] [Real]Absence check using state equation in 3810 ms returned sat
[2022-06-08 11:36:34] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:36:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:36:35] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:36:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:36:39] [INFO ] [Nat]Absence check using state equation in 4012 ms returned sat
[2022-06-08 11:36:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:36:46] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6797 ms returned unknown
[2022-06-08 11:36:46] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:36:46] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 11:36:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:36:50] [INFO ] [Real]Absence check using state equation in 3624 ms returned sat
[2022-06-08 11:36:50] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:36:50] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:36:50] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:36:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:36:54] [INFO ] [Nat]Absence check using state equation in 3668 ms returned sat
[2022-06-08 11:36:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:37:01] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6775 ms returned unknown
[2022-06-08 11:37:01] [INFO ] [Real]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 11:37:01] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:37:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:37:05] [INFO ] [Real]Absence check using state equation in 3533 ms returned sat
[2022-06-08 11:37:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:37:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:37:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:37:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:37:09] [INFO ] [Nat]Absence check using state equation in 3727 ms returned sat
[2022-06-08 11:37:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:37:16] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6789 ms returned unknown
[2022-06-08 11:37:17] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 11:37:17] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:37:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:37:20] [INFO ] [Real]Absence check using state equation in 3470 ms returned sat
[2022-06-08 11:37:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:37:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 11:37:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:37:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:37:25] [INFO ] [Nat]Absence check using state equation in 3509 ms returned sat
[2022-06-08 11:37:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:37:31] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6851 ms returned unknown
[2022-06-08 11:37:32] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 11:37:32] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:37:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:37:35] [INFO ] [Real]Absence check using state equation in 3505 ms returned sat
[2022-06-08 11:37:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:37:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 67 ms returned sat
[2022-06-08 11:37:36] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:37:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:37:40] [INFO ] [Nat]Absence check using state equation in 3582 ms returned sat
[2022-06-08 11:37:43] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:37:46] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6764 ms returned unknown
[2022-06-08 11:37:47] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 11:37:47] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:37:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:37:52] [INFO ] [Real]Absence check using state equation in 5602 ms returned sat
[2022-06-08 11:37:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:37:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 11:37:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:37:59] [INFO ] [Nat]Absence check using state equation in 5579 ms returned sat
[2022-06-08 11:38:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:38:06] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6760 ms returned unknown
[2022-06-08 11:38:06] [INFO ] [Real]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:38:06] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 11:38:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:38:10] [INFO ] [Real]Absence check using state equation in 3760 ms returned sat
[2022-06-08 11:38:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:38:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:38:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:38:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:38:14] [INFO ] [Nat]Absence check using state equation in 3778 ms returned sat
[2022-06-08 11:38:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:38:21] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6839 ms returned unknown
[2022-06-08 11:38:22] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:38:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:38:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:38:26] [INFO ] [Real]Absence check using state equation in 4508 ms returned sat
[2022-06-08 11:38:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:38:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 72 ms returned sat
[2022-06-08 11:38:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:38:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:38:32] [INFO ] [Nat]Absence check using state equation in 4967 ms returned sat
[2022-06-08 11:38:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:38:39] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6820 ms returned unknown
[2022-06-08 11:38:39] [INFO ] [Real]Absence check using 50 positive place invariants in 66 ms returned sat
[2022-06-08 11:38:39] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:38:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:38:44] [INFO ] [Real]Absence check using state equation in 4764 ms returned sat
[2022-06-08 11:38:44] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:38:45] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:38:45] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:38:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:38:50] [INFO ] [Nat]Absence check using state equation in 4936 ms returned sat
[2022-06-08 11:38:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:38:56] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6832 ms returned unknown
[2022-06-08 11:38:57] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:38:57] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:38:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:39:01] [INFO ] [Real]Absence check using state equation in 3707 ms returned sat
[2022-06-08 11:39:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:39:01] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:39:01] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:39:05] [INFO ] [Nat]Absence check using state equation in 3950 ms returned sat
[2022-06-08 11:39:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:39:12] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6774 ms returned unknown
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 15 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Applied a total of 0 rules in 661 ms. Remains 2859 /2859 variables (removed 0) and now considering 10260/10260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2859/2859 places, 10260/10260 transitions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Applied a total of 0 rules in 653 ms. Remains 2859 /2859 variables (removed 0) and now considering 10260/10260 (removed 0) transitions.
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:39:14] [INFO ] Computed 52 place invariants in 535 ms
[2022-06-08 11:39:18] [INFO ] Implicit Places using invariants in 4211 ms returned []
Implicit Place search using SMT only with invariants took 4212 ms to find 0 implicit places.
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:39:18] [INFO ] Computed 52 place invariants in 564 ms
[2022-06-08 11:39:27] [INFO ] Dead Transitions using invariants and state equation in 9261 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2859/2859 places, 10260/10260 transitions.
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:39:28] [INFO ] Computed 52 place invariants in 646 ms
Incomplete random walk after 1000000 steps, including 4208 resets, run finished after 18966 ms. (steps per millisecond=52 ) properties (out of 15) seen :15
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1883 ms. (steps per millisecond=531 ) properties (out of 15) seen :8
Incomplete Best-First random walk after 1000001 steps, including 66 resets, run finished after 1919 ms. (steps per millisecond=521 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 1000001 steps, including 70 resets, run finished after 1901 ms. (steps per millisecond=526 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 1000001 steps, including 66 resets, run finished after 1908 ms. (steps per millisecond=524 ) properties (out of 15) seen :10
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1859 ms. (steps per millisecond=537 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1870 ms. (steps per millisecond=534 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 1000001 steps, including 70 resets, run finished after 1859 ms. (steps per millisecond=537 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1877 ms. (steps per millisecond=532 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1872 ms. (steps per millisecond=534 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1863 ms. (steps per millisecond=536 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties (out of 15) seen :9
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1869 ms. (steps per millisecond=535 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1930 ms. (steps per millisecond=518 ) properties (out of 15) seen :13
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1936 ms. (steps per millisecond=516 ) properties (out of 15) seen :10
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:40:15] [INFO ] Computed 52 place invariants in 559 ms
[2022-06-08 11:40:16] [INFO ] [Real]Absence check using 50 positive place invariants in 66 ms returned sat
[2022-06-08 11:40:16] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:40:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:40:20] [INFO ] [Real]Absence check using state equation in 3905 ms returned sat
[2022-06-08 11:40:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:40:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:40:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:40:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:40:25] [INFO ] [Nat]Absence check using state equation in 4022 ms returned sat
[2022-06-08 11:40:25] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:40:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:40:32] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6815 ms returned unknown
[2022-06-08 11:40:32] [INFO ] [Real]Absence check using 50 positive place invariants in 66 ms returned sat
[2022-06-08 11:40:32] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:40:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:40:36] [INFO ] [Real]Absence check using state equation in 3576 ms returned sat
[2022-06-08 11:40:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:40:36] [INFO ] [Nat]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 11:40:36] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:40:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:40:40] [INFO ] [Nat]Absence check using state equation in 3738 ms returned sat
[2022-06-08 11:40:44] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:40:47] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6796 ms returned unknown
[2022-06-08 11:40:47] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:40:47] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:40:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:40:52] [INFO ] [Real]Absence check using state equation in 4429 ms returned sat
[2022-06-08 11:40:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:40:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 73 ms returned sat
[2022-06-08 11:40:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:40:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:40:57] [INFO ] [Nat]Absence check using state equation in 4601 ms returned sat
[2022-06-08 11:41:01] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:41:04] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6793 ms returned unknown
[2022-06-08 11:41:05] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:41:05] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 11:41:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:41:08] [INFO ] [Real]Absence check using state equation in 3564 ms returned sat
[2022-06-08 11:41:08] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:41:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 11:41:09] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 11:41:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:41:13] [INFO ] [Nat]Absence check using state equation in 3733 ms returned sat
[2022-06-08 11:41:16] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:41:19] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6779 ms returned unknown
[2022-06-08 11:41:20] [INFO ] [Real]Absence check using 50 positive place invariants in 67 ms returned sat
[2022-06-08 11:41:20] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:41:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:41:24] [INFO ] [Real]Absence check using state equation in 3728 ms returned sat
[2022-06-08 11:41:24] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:41:24] [INFO ] [Nat]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:41:24] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:41:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:41:28] [INFO ] [Nat]Absence check using state equation in 3813 ms returned sat
[2022-06-08 11:41:32] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:41:35] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6829 ms returned unknown
[2022-06-08 11:41:35] [INFO ] [Real]Absence check using 50 positive place invariants in 66 ms returned sat
[2022-06-08 11:41:35] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:41:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:41:39] [INFO ] [Real]Absence check using state equation in 3902 ms returned sat
[2022-06-08 11:41:40] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:41:40] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:41:40] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 11:41:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:41:44] [INFO ] [Nat]Absence check using state equation in 4039 ms returned sat
[2022-06-08 11:41:48] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:41:51] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6828 ms returned unknown
[2022-06-08 11:41:51] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:41:51] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:41:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:41:55] [INFO ] [Real]Absence check using state equation in 3460 ms returned sat
[2022-06-08 11:41:55] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:41:56] [INFO ] [Nat]Absence check using 50 positive place invariants in 67 ms returned sat
[2022-06-08 11:41:56] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 11:41:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:41:59] [INFO ] [Nat]Absence check using state equation in 3666 ms returned sat
[2022-06-08 11:42:03] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:42:06] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6771 ms returned unknown
[2022-06-08 11:42:07] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:42:07] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2022-06-08 11:42:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:42:10] [INFO ] [Real]Absence check using state equation in 3540 ms returned sat
[2022-06-08 11:42:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:42:11] [INFO ] [Nat]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 11:42:11] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 34 ms returned sat
[2022-06-08 11:42:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:42:15] [INFO ] [Nat]Absence check using state equation in 3626 ms returned sat
[2022-06-08 11:42:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:42:21] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6771 ms returned unknown
[2022-06-08 11:42:22] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 11:42:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:42:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:42:25] [INFO ] [Real]Absence check using state equation in 3565 ms returned sat
[2022-06-08 11:42:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:42:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:42:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:42:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:42:30] [INFO ] [Nat]Absence check using state equation in 3628 ms returned sat
[2022-06-08 11:42:33] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:42:37] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6758 ms returned unknown
[2022-06-08 11:42:37] [INFO ] [Real]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 11:42:37] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:42:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:42:40] [INFO ] [Real]Absence check using state equation in 3535 ms returned sat
[2022-06-08 11:42:41] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:42:41] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:42:41] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:42:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:42:45] [INFO ] [Nat]Absence check using state equation in 3687 ms returned sat
[2022-06-08 11:42:49] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:42:52] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6779 ms returned unknown
[2022-06-08 11:42:52] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 11:42:52] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:42:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:42:58] [INFO ] [Real]Absence check using state equation in 5572 ms returned sat
[2022-06-08 11:42:58] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:42:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 66 ms returned sat
[2022-06-08 11:42:59] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:42:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:43:04] [INFO ] [Nat]Absence check using state equation in 5663 ms returned sat
[2022-06-08 11:43:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:43:11] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6773 ms returned unknown
[2022-06-08 11:43:11] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:43:11] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:43:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:43:15] [INFO ] [Real]Absence check using state equation in 3748 ms returned sat
[2022-06-08 11:43:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:43:16] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:43:16] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:43:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:43:20] [INFO ] [Nat]Absence check using state equation in 3659 ms returned sat
[2022-06-08 11:43:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:43:26] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6781 ms returned unknown
[2022-06-08 11:43:27] [INFO ] [Real]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 11:43:27] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:43:31] [INFO ] [Real]Absence check using state equation in 4436 ms returned sat
[2022-06-08 11:43:32] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:43:32] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:43:32] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 33 ms returned sat
[2022-06-08 11:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:43:37] [INFO ] [Nat]Absence check using state equation in 4468 ms returned sat
[2022-06-08 11:43:40] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:43:43] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6780 ms returned unknown
[2022-06-08 11:43:44] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 11:43:44] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:43:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:43:49] [INFO ] [Real]Absence check using state equation in 4784 ms returned sat
[2022-06-08 11:43:49] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:43:49] [INFO ] [Nat]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:43:49] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:43:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:43:54] [INFO ] [Nat]Absence check using state equation in 4953 ms returned sat
[2022-06-08 11:43:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:44:01] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6837 ms returned unknown
[2022-06-08 11:44:02] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 11:44:02] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:44:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:44:05] [INFO ] [Real]Absence check using state equation in 3548 ms returned sat
[2022-06-08 11:44:05] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:44:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:44:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:44:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:44:10] [INFO ] [Nat]Absence check using state equation in 3726 ms returned sat
[2022-06-08 11:44:13] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:44:16] [INFO ] [Nat]Added 10032 Read/Feed constraints in 6793 ms returned unknown
Current structural bounds on expressions (after SMT) : [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50] Max seen :[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Support contains 15 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Applied a total of 0 rules in 585 ms. Remains 2859 /2859 variables (removed 0) and now considering 10260/10260 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2859/2859 places, 10260/10260 transitions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Applied a total of 0 rules in 586 ms. Remains 2859 /2859 variables (removed 0) and now considering 10260/10260 (removed 0) transitions.
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:44:18] [INFO ] Computed 52 place invariants in 542 ms
[2022-06-08 11:44:21] [INFO ] Implicit Places using invariants in 3870 ms returned []
Implicit Place search using SMT only with invariants took 3875 ms to find 0 implicit places.
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:44:22] [INFO ] Computed 52 place invariants in 529 ms
[2022-06-08 11:44:30] [INFO ] Dead Transitions using invariants and state equation in 8635 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2859/2859 places, 10260/10260 transitions.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-00
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:44:31] [INFO ] Computed 52 place invariants in 532 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:44:32] [INFO ] Computed 52 place invariants in 594 ms
[2022-06-08 11:44:32] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:44:32] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:44:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:44:36] [INFO ] [Real]Absence check using state equation in 3878 ms returned sat
[2022-06-08 11:44:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:44:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 73 ms returned sat
[2022-06-08 11:44:37] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:44:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:44:41] [INFO ] [Nat]Absence check using state equation in 4078 ms returned sat
[2022-06-08 11:44:41] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:44: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 0
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:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [50] Max seen :[0]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 2852 transition count 10253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 2852 transition count 10252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 2305 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:44:44] [INFO ] Computed 52 place invariants in 672 ms
Incomplete random walk after 1000000 steps, including 4227 resets, run finished after 17957 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1755 ms. (steps per millisecond=569 ) properties (out of 1) seen :0
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:45:04] [INFO ] Computed 52 place invariants in 508 ms
[2022-06-08 11:45:05] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:45:05] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:45:08] [INFO ] [Real]Absence check using state equation in 3542 ms returned sat
[2022-06-08 11:45:09] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:45:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:45:09] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:45:13] [INFO ] [Nat]Absence check using state equation in 3804 ms returned sat
[2022-06-08 11:45:13] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:45:17] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:45:20] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6814 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 604 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 571 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:45:22] [INFO ] Computed 52 place invariants in 512 ms
[2022-06-08 11:45:25] [INFO ] Implicit Places using invariants in 4106 ms returned []
Implicit Place search using SMT only with invariants took 4126 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:45:26] [INFO ] Computed 52 place invariants in 543 ms
[2022-06-08 11:45:34] [INFO ] Dead Transitions using invariants and state equation in 8629 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:45:34] [INFO ] Computed 52 place invariants in 494 ms
Incomplete random walk after 1000000 steps, including 4234 resets, run finished after 17815 ms. (steps per millisecond=56 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1757 ms. (steps per millisecond=569 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:45:55] [INFO ] Computed 52 place invariants in 497 ms
[2022-06-08 11:45:55] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:45:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:45:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:45:59] [INFO ] [Real]Absence check using state equation in 3686 ms returned sat
[2022-06-08 11:45:59] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:45:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:45:59] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 11:45:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:46:03] [INFO ] [Nat]Absence check using state equation in 3684 ms returned sat
[2022-06-08 11:46:03] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:46:07] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:46:10] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6814 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 582 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 568 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:46:12] [INFO ] Computed 52 place invariants in 489 ms
[2022-06-08 11:46:16] [INFO ] Implicit Places using invariants in 4281 ms returned []
Implicit Place search using SMT only with invariants took 4283 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:46:16] [INFO ] Computed 52 place invariants in 491 ms
[2022-06-08 11:46:25] [INFO ] Dead Transitions using invariants and state equation in 9106 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-00 in 114519 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-01
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:46:25] [INFO ] Computed 52 place invariants in 579 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 192 ms. (steps per millisecond=52 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:46:26] [INFO ] Computed 52 place invariants in 626 ms
[2022-06-08 11:46:27] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:46:27] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:46:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:46:30] [INFO ] [Real]Absence check using state equation in 3851 ms returned sat
[2022-06-08 11:46:31] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:46:31] [INFO ] [Nat]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:46:31] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:46:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:46:35] [INFO ] [Nat]Absence check using state equation in 4009 ms returned sat
[2022-06-08 11:46:35] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:46:36] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [50] Max seen :[1]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 2852 transition count 10253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 2852 transition count 10252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 2206 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:46:39] [INFO ] Computed 52 place invariants in 532 ms
Incomplete random walk after 1000000 steps, including 4243 resets, run finished after 18487 ms. (steps per millisecond=54 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1872 ms. (steps per millisecond=534 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:46:59] [INFO ] Computed 52 place invariants in 530 ms
[2022-06-08 11:47:00] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:47:00] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:47:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:47:04] [INFO ] [Real]Absence check using state equation in 3751 ms returned sat
[2022-06-08 11:47:04] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:47:04] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:47:04] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:47:08] [INFO ] [Nat]Absence check using state equation in 3996 ms returned sat
[2022-06-08 11:47:09] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:47:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:47:15] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6853 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 588 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 582 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:47:17] [INFO ] Computed 52 place invariants in 533 ms
[2022-06-08 11:47:20] [INFO ] Implicit Places using invariants in 3841 ms returned []
Implicit Place search using SMT only with invariants took 3862 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:47:21] [INFO ] Computed 52 place invariants in 530 ms
[2022-06-08 11:47:29] [INFO ] Dead Transitions using invariants and state equation in 8219 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-01 in 64007 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-02
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:47:29] [INFO ] Computed 52 place invariants in 593 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 1) 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 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:47:30] [INFO ] Computed 52 place invariants in 572 ms
[2022-06-08 11:47:31] [INFO ] [Real]Absence check using 50 positive place invariants in 66 ms returned sat
[2022-06-08 11:47:31] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 36 ms returned sat
[2022-06-08 11:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:47:34] [INFO ] [Real]Absence check using state equation in 3890 ms returned sat
[2022-06-08 11:47:35] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:47:35] [INFO ] [Nat]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:47:35] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:47:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:47:39] [INFO ] [Nat]Absence check using state equation in 4190 ms returned sat
[2022-06-08 11:47:40] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:47:40] [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 0
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:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [50] Max seen :[0]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 2852 transition count 10253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 2852 transition count 10252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 2190 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:47:43] [INFO ] Computed 52 place invariants in 525 ms
Incomplete random walk after 1000000 steps, including 4234 resets, run finished after 18696 ms. (steps per millisecond=53 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1881 ms. (steps per millisecond=531 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:48:04] [INFO ] Computed 52 place invariants in 523 ms
[2022-06-08 11:48:04] [INFO ] [Real]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:48:04] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:48:11] [INFO ] [Real]Absence check using state equation in 7223 ms returned sat
[2022-06-08 11:48:12] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:48:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 74 ms returned sat
[2022-06-08 11:48:12] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:48:16] [INFO ] [Nat]Absence check using state equation in 4000 ms returned sat
[2022-06-08 11:48:16] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:48:20] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:48:23] [INFO ] [Nat]Added 10052 Read/Feed constraints in 7073 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 594 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 577 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:48:25] [INFO ] Computed 52 place invariants in 525 ms
[2022-06-08 11:48:28] [INFO ] Implicit Places using invariants in 3885 ms returned []
Implicit Place search using SMT only with invariants took 3899 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:48:29] [INFO ] Computed 52 place invariants in 553 ms
[2022-06-08 11:48:37] [INFO ] Dead Transitions using invariants and state equation in 8103 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:48:37] [INFO ] Computed 52 place invariants in 501 ms
Incomplete random walk after 1000000 steps, including 4237 resets, run finished after 18269 ms. (steps per millisecond=54 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1853 ms. (steps per millisecond=539 ) properties (out of 1) seen :0
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:48:58] [INFO ] Computed 52 place invariants in 550 ms
[2022-06-08 11:48:58] [INFO ] [Real]Absence check using 50 positive place invariants in 67 ms returned sat
[2022-06-08 11:48:58] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:48:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:49:05] [INFO ] [Real]Absence check using state equation in 6951 ms returned sat
[2022-06-08 11:49:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:49:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:49:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:49:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:49:10] [INFO ] [Nat]Absence check using state equation in 4029 ms returned sat
[2022-06-08 11:49:10] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:49:14] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:49:17] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6821 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 596 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 604 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:49:19] [INFO ] Computed 52 place invariants in 523 ms
[2022-06-08 11:49:22] [INFO ] Implicit Places using invariants in 3812 ms returned []
Implicit Place search using SMT only with invariants took 3827 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:49:23] [INFO ] Computed 52 place invariants in 523 ms
[2022-06-08 11:49:30] [INFO ] Dead Transitions using invariants and state equation in 8221 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-02 in 121552 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-03
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:49:31] [INFO ] Computed 52 place invariants in 573 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 216 ms. (steps per millisecond=46 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:49:32] [INFO ] Computed 52 place invariants in 584 ms
[2022-06-08 11:49:32] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:49:32] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:49:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:49:36] [INFO ] [Real]Absence check using state equation in 3808 ms returned sat
[2022-06-08 11:49:36] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:49:37] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:49:37] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:49:41] [INFO ] [Nat]Absence check using state equation in 4042 ms returned sat
[2022-06-08 11:49:41] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:49: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 0
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:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [50] Max seen :[0]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 2852 transition count 10253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 2852 transition count 10252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 2166 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:49:44] [INFO ] Computed 52 place invariants in 498 ms
Incomplete random walk after 1000000 steps, including 4228 resets, run finished after 18651 ms. (steps per millisecond=53 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 66 resets, run finished after 1876 ms. (steps per millisecond=533 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:50:05] [INFO ] Computed 52 place invariants in 528 ms
[2022-06-08 11:50:05] [INFO ] [Real]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:50:05] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:50:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:50:09] [INFO ] [Real]Absence check using state equation in 3829 ms returned sat
[2022-06-08 11:50:10] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:50:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:50:10] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:50:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:50:14] [INFO ] [Nat]Absence check using state equation in 3996 ms returned sat
[2022-06-08 11:50:14] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:50:18] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:50:21] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6807 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 584 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 576 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:50:23] [INFO ] Computed 52 place invariants in 523 ms
[2022-06-08 11:50:26] [INFO ] Implicit Places using invariants in 4003 ms returned []
Implicit Place search using SMT only with invariants took 4004 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:50:27] [INFO ] Computed 52 place invariants in 523 ms
[2022-06-08 11:50:35] [INFO ] Dead Transitions using invariants and state equation in 8537 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:50:35] [INFO ] Computed 52 place invariants in 530 ms
Incomplete random walk after 1000000 steps, including 4228 resets, run finished after 18545 ms. (steps per millisecond=53 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1883 ms. (steps per millisecond=531 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:50:56] [INFO ] Computed 52 place invariants in 532 ms
[2022-06-08 11:50:57] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:50:57] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:50:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:51:01] [INFO ] [Real]Absence check using state equation in 3907 ms returned sat
[2022-06-08 11:51:01] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:51:01] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:51:01] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:51:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:51:05] [INFO ] [Nat]Absence check using state equation in 4102 ms returned sat
[2022-06-08 11:51:06] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:51:09] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:51:12] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6827 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 586 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 581 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:51:14] [INFO ] Computed 52 place invariants in 561 ms
[2022-06-08 11:51:18] [INFO ] Implicit Places using invariants in 4354 ms returned []
Implicit Place search using SMT only with invariants took 4355 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:51:18] [INFO ] Computed 52 place invariants in 534 ms
[2022-06-08 11:51:27] [INFO ] Dead Transitions using invariants and state equation in 8618 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-03 in 116304 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-04
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:51:27] [INFO ] Computed 52 place invariants in 574 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:51:28] [INFO ] Computed 52 place invariants in 585 ms
[2022-06-08 11:51:28] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:51:28] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:51:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:51:32] [INFO ] [Real]Absence check using state equation in 4013 ms returned sat
[2022-06-08 11:51:33] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:51:33] [INFO ] [Nat]Absence check using 50 positive place invariants in 74 ms returned sat
[2022-06-08 11:51:33] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2022-06-08 11:51:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:51:37] [INFO ] [Nat]Absence check using state equation in 3911 ms returned sat
[2022-06-08 11:51:37] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:51:38] [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 0
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:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [50] Max seen :[1]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2851 transition count 10252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 2851 transition count 10251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 2850 transition count 10251
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 2850 transition count 10251
Applied a total of 23 rules in 2182 ms. Remains 2850 /2859 variables (removed 9) and now considering 10251/10260 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2859 places, 10251/10260 transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:51:41] [INFO ] Computed 52 place invariants in 503 ms
Incomplete random walk after 1000000 steps, including 4235 resets, run finished after 18800 ms. (steps per millisecond=53 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 70 resets, run finished after 1915 ms. (steps per millisecond=522 ) properties (out of 1) seen :1
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:52:02] [INFO ] Computed 52 place invariants in 498 ms
[2022-06-08 11:52:02] [INFO ] [Real]Absence check using 50 positive place invariants in 59 ms returned sat
[2022-06-08 11:52:02] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2022-06-08 11:52:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:52:06] [INFO ] [Real]Absence check using state equation in 3723 ms returned sat
[2022-06-08 11:52:06] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:52:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 11:52:07] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:52:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:52:11] [INFO ] [Nat]Absence check using state equation in 3947 ms returned sat
[2022-06-08 11:52:11] [INFO ] State equation strengthened by 10053 read => feed constraints.
[2022-06-08 11:52:15] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:52:18] [INFO ] [Nat]Added 10053 Read/Feed constraints in 6843 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 572 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 585 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:52:19] [INFO ] Computed 52 place invariants in 515 ms
[2022-06-08 11:52:24] [INFO ] Implicit Places using invariants in 5624 ms returned []
Implicit Place search using SMT only with invariants took 5628 ms to find 0 implicit places.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:52:25] [INFO ] Computed 52 place invariants in 496 ms
[2022-06-08 11:52:35] [INFO ] Dead Transitions using invariants and state equation in 10920 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-04 in 68766 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-05
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:52:36] [INFO ] Computed 52 place invariants in 587 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:52:37] [INFO ] Computed 52 place invariants in 584 ms
[2022-06-08 11:52:37] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:52:37] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 35 ms returned sat
[2022-06-08 11:52:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:52:41] [INFO ] [Real]Absence check using state equation in 4023 ms returned sat
[2022-06-08 11:52:42] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:52:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:52:42] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:52:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:52:46] [INFO ] [Nat]Absence check using state equation in 4194 ms returned sat
[2022-06-08 11:52:46] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:52:47] [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 0
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:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [50] Max seen :[1]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 1759 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:52:49] [INFO ] Computed 52 place invariants in 525 ms
Incomplete random walk after 1000000 steps, including 4216 resets, run finished after 19428 ms. (steps per millisecond=51 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1950 ms. (steps per millisecond=512 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:53:11] [INFO ] Computed 52 place invariants in 531 ms
[2022-06-08 11:53:11] [INFO ] [Real]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:53:11] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:53:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:53:16] [INFO ] [Real]Absence check using state equation in 4620 ms returned sat
[2022-06-08 11:53:16] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:53:17] [INFO ] [Nat]Absence check using 50 positive place invariants in 75 ms returned sat
[2022-06-08 11:53:17] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:53:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:53:22] [INFO ] [Nat]Absence check using state equation in 5019 ms returned sat
[2022-06-08 11:53:22] [INFO ] State equation strengthened by 10054 read => feed constraints.
[2022-06-08 11:53:26] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:53:29] [INFO ] [Nat]Added 10054 Read/Feed constraints in 6835 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 580 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 555 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:53:30] [INFO ] Computed 52 place invariants in 485 ms
[2022-06-08 11:53:34] [INFO ] Implicit Places using invariants in 3869 ms returned []
Implicit Place search using SMT only with invariants took 3886 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:53:34] [INFO ] Computed 52 place invariants in 541 ms
[2022-06-08 11:53:42] [INFO ] Dead Transitions using invariants and state equation in 8493 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-05 in 66840 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-06
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:53:43] [INFO ] Computed 52 place invariants in 544 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:53:43] [INFO ] Computed 52 place invariants in 550 ms
[2022-06-08 11:53:44] [INFO ] [Real]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 11:53:44] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:53:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:53:47] [INFO ] [Real]Absence check using state equation in 3495 ms returned sat
[2022-06-08 11:53:48] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:53:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 11:53:48] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:53:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:53:52] [INFO ] [Nat]Absence check using state equation in 3604 ms returned sat
[2022-06-08 11:53:52] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:53:53] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:53:53] [INFO ] [Nat]Added 10032 Read/Feed constraints in 886 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[0]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2851 transition count 10252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 2851 transition count 10251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 2850 transition count 10251
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 2850 transition count 10251
Applied a total of 23 rules in 2068 ms. Remains 2850 /2859 variables (removed 9) and now considering 10251/10260 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2859 places, 10251/10260 transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:53:55] [INFO ] Computed 52 place invariants in 506 ms
Incomplete random walk after 1000000 steps, including 4236 resets, run finished after 19617 ms. (steps per millisecond=50 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1920 ms. (steps per millisecond=520 ) properties (out of 1) seen :1
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:54:17] [INFO ] Computed 52 place invariants in 511 ms
[2022-06-08 11:54:18] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:54:18] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:54:22] [INFO ] [Real]Absence check using state equation in 3764 ms returned sat
[2022-06-08 11:54:22] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:54:22] [INFO ] [Nat]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 11:54:22] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:54:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:54:26] [INFO ] [Nat]Absence check using state equation in 3829 ms returned sat
[2022-06-08 11:54:26] [INFO ] State equation strengthened by 10053 read => feed constraints.
[2022-06-08 11:54:30] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:54:33] [INFO ] [Nat]Added 10053 Read/Feed constraints in 6808 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 585 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 583 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:54:35] [INFO ] Computed 52 place invariants in 492 ms
[2022-06-08 11:54:40] [INFO ] Implicit Places using invariants in 5863 ms returned []
Implicit Place search using SMT only with invariants took 5877 ms to find 0 implicit places.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:54:41] [INFO ] Computed 52 place invariants in 496 ms
[2022-06-08 11:54:49] [INFO ] Dead Transitions using invariants and state equation in 8746 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:54:49] [INFO ] Computed 52 place invariants in 496 ms
Incomplete random walk after 1000000 steps, including 4230 resets, run finished after 18161 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1866 ms. (steps per millisecond=535 ) properties (out of 1) seen :1
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:55:10] [INFO ] Computed 52 place invariants in 493 ms
[2022-06-08 11:55:10] [INFO ] [Real]Absence check using 50 positive place invariants in 60 ms returned sat
[2022-06-08 11:55:10] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:55:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:55:14] [INFO ] [Real]Absence check using state equation in 3615 ms returned sat
[2022-06-08 11:55:14] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:55:15] [INFO ] [Nat]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 11:55:15] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:55:15] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:55:19] [INFO ] [Nat]Absence check using state equation in 3756 ms returned sat
[2022-06-08 11:55:19] [INFO ] State equation strengthened by 10053 read => feed constraints.
[2022-06-08 11:55:23] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:55:26] [INFO ] [Nat]Added 10053 Read/Feed constraints in 6833 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 581 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 591 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:55:27] [INFO ] Computed 52 place invariants in 501 ms
[2022-06-08 11:55:32] [INFO ] Implicit Places using invariants in 5622 ms returned []
Implicit Place search using SMT only with invariants took 5633 ms to find 0 implicit places.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:55:33] [INFO ] Computed 52 place invariants in 497 ms
[2022-06-08 11:55:41] [INFO ] Dead Transitions using invariants and state equation in 8866 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-06 in 119089 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-07
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:55:42] [INFO ] Computed 52 place invariants in 609 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:55:43] [INFO ] Computed 52 place invariants in 594 ms
[2022-06-08 11:55:43] [INFO ] [Real]Absence check using 50 positive place invariants in 70 ms returned sat
[2022-06-08 11:55:43] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 39 ms returned sat
[2022-06-08 11:55:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:55:47] [INFO ] [Real]Absence check using state equation in 3696 ms returned sat
[2022-06-08 11:55:47] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:55:48] [INFO ] [Nat]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:55:48] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:55:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:55:52] [INFO ] [Nat]Absence check using state equation in 3844 ms returned sat
[2022-06-08 11:55:52] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:55:52] [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 0
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:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [50] Max seen :[1]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 2852 transition count 10253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 2852 transition count 10252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 2160 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:55:55] [INFO ] Computed 52 place invariants in 503 ms
Incomplete random walk after 1000000 steps, including 4224 resets, run finished after 18237 ms. (steps per millisecond=54 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1850 ms. (steps per millisecond=540 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:56:16] [INFO ] Computed 52 place invariants in 504 ms
[2022-06-08 11:56:16] [INFO ] [Real]Absence check using 50 positive place invariants in 68 ms returned sat
[2022-06-08 11:56:16] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:56:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:56:20] [INFO ] [Real]Absence check using state equation in 3808 ms returned sat
[2022-06-08 11:56:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:56:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 71 ms returned sat
[2022-06-08 11:56:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 11:56:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:56:25] [INFO ] [Nat]Absence check using state equation in 4009 ms returned sat
[2022-06-08 11:56:25] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:56:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:56:32] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6825 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 581 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 617 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:56:33] [INFO ] Computed 52 place invariants in 523 ms
[2022-06-08 11:56:37] [INFO ] Implicit Places using invariants in 4165 ms returned []
Implicit Place search using SMT only with invariants took 4171 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:56:37] [INFO ] Computed 52 place invariants in 525 ms
[2022-06-08 11:56:46] [INFO ] Dead Transitions using invariants and state equation in 9332 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-07 in 64989 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-08
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:56:47] [INFO ] Computed 52 place invariants in 568 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:56:48] [INFO ] Computed 52 place invariants in 566 ms
[2022-06-08 11:56:48] [INFO ] [Real]Absence check using 50 positive place invariants in 67 ms returned sat
[2022-06-08 11:56:48] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 11:56:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:56:52] [INFO ] [Real]Absence check using state equation in 3744 ms returned sat
[2022-06-08 11:56:52] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:56:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 67 ms returned sat
[2022-06-08 11:56:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:56:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:56:56] [INFO ] [Nat]Absence check using state equation in 3831 ms returned sat
[2022-06-08 11:56:57] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:56:57] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 0
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:580)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2244)
at fr.lip6.move.gal.application.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:187)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:446)
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) : [50] Max seen :[1]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2851 transition count 10252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 2851 transition count 10251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 2850 transition count 10251
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 2850 transition count 10251
Applied a total of 23 rules in 2222 ms. Remains 2850 /2859 variables (removed 9) and now considering 10251/10260 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2859 places, 10251/10260 transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:57:00] [INFO ] Computed 52 place invariants in 495 ms
Incomplete random walk after 1000000 steps, including 4236 resets, run finished after 18143 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1840 ms. (steps per millisecond=543 ) properties (out of 1) seen :1
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:57:20] [INFO ] Computed 52 place invariants in 494 ms
[2022-06-08 11:57:21] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 11:57:21] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 11:57:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:57:27] [INFO ] [Real]Absence check using state equation in 6624 ms returned sat
[2022-06-08 11:57:28] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:57:28] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:57:28] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:57:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:57:35] [INFO ] [Nat]Absence check using state equation in 6518 ms returned sat
[2022-06-08 11:57:35] [INFO ] State equation strengthened by 10053 read => feed constraints.
[2022-06-08 11:57:39] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:57:42] [INFO ] [Nat]Added 10053 Read/Feed constraints in 6812 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 572 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 573 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:57:43] [INFO ] Computed 52 place invariants in 488 ms
[2022-06-08 11:57:49] [INFO ] Implicit Places using invariants in 5913 ms returned []
Implicit Place search using SMT only with invariants took 5914 ms to find 0 implicit places.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 11:57:49] [INFO ] Computed 52 place invariants in 501 ms
[2022-06-08 11:57:58] [INFO ] Dead Transitions using invariants and state equation in 9169 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-08 in 71688 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-09
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:57:58] [INFO ] Computed 52 place invariants in 546 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:57:59] [INFO ] Computed 52 place invariants in 545 ms
[2022-06-08 11:58:00] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 11:58:00] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:58:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:58:03] [INFO ] [Real]Absence check using state equation in 3451 ms returned sat
[2022-06-08 11:58:03] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:58:04] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:58:04] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 11:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:58:07] [INFO ] [Nat]Absence check using state equation in 3519 ms returned sat
[2022-06-08 11:58:07] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:58:08] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:58:08] [INFO ] [Nat]Added 10032 Read/Feed constraints in 967 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 2852 transition count 10253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 2852 transition count 10252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 2117 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:58:11] [INFO ] Computed 52 place invariants in 471 ms
Incomplete random walk after 1000000 steps, including 4237 resets, run finished after 17039 ms. (steps per millisecond=58 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1771 ms. (steps per millisecond=564 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:58:30] [INFO ] Computed 52 place invariants in 469 ms
[2022-06-08 11:58:31] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 11:58:31] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 11:58:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:58:38] [INFO ] [Real]Absence check using state equation in 6857 ms returned sat
[2022-06-08 11:58:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:58:38] [INFO ] [Nat]Absence check using 50 positive place invariants in 67 ms returned sat
[2022-06-08 11:58:38] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 11:58:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:58:42] [INFO ] [Nat]Absence check using state equation in 3474 ms returned sat
[2022-06-08 11:58:42] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:58:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:58:49] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6809 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 561 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 566 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:58:50] [INFO ] Computed 52 place invariants in 478 ms
[2022-06-08 11:58:54] [INFO ] Implicit Places using invariants in 3866 ms returned []
Implicit Place search using SMT only with invariants took 3878 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:58:54] [INFO ] Computed 52 place invariants in 474 ms
[2022-06-08 11:59:02] [INFO ] Dead Transitions using invariants and state equation in 7942 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-09 in 63881 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-10
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:59:02] [INFO ] Computed 52 place invariants in 543 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 11:59:03] [INFO ] Computed 52 place invariants in 540 ms
[2022-06-08 11:59:04] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 11:59:04] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 11:59:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:59:07] [INFO ] [Real]Absence check using state equation in 3464 ms returned sat
[2022-06-08 11:59:07] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:59:08] [INFO ] [Nat]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 11:59:08] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2022-06-08 11:59:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:59:11] [INFO ] [Nat]Absence check using state equation in 3514 ms returned sat
[2022-06-08 11:59:11] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 11:59:12] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:59:12] [INFO ] [Nat]Added 10032 Read/Feed constraints in 969 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[0]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 2852 transition count 10253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 2852 transition count 10252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 2057 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:59:15] [INFO ] Computed 52 place invariants in 487 ms
Incomplete random walk after 1000000 steps, including 4238 resets, run finished after 16917 ms. (steps per millisecond=59 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1755 ms. (steps per millisecond=569 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:59:34] [INFO ] Computed 52 place invariants in 489 ms
[2022-06-08 11:59:35] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 11:59:35] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 11:59:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 11:59:38] [INFO ] [Real]Absence check using state equation in 3405 ms returned sat
[2022-06-08 11:59:38] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 11:59:39] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 11:59:39] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 11:59:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 11:59:42] [INFO ] [Nat]Absence check using state equation in 3436 ms returned sat
[2022-06-08 11:59:42] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 11:59:46] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 11:59:49] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6801 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 564 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 562 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:59:51] [INFO ] Computed 52 place invariants in 502 ms
[2022-06-08 11:59:54] [INFO ] Implicit Places using invariants in 3994 ms returned []
Implicit Place search using SMT only with invariants took 3995 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 11:59:55] [INFO ] Computed 52 place invariants in 682 ms
[2022-06-08 12:00:02] [INFO ] Dead Transitions using invariants and state equation in 8207 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:00:03] [INFO ] Computed 52 place invariants in 498 ms
Incomplete random walk after 1000000 steps, including 4240 resets, run finished after 17345 ms. (steps per millisecond=57 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1806 ms. (steps per millisecond=553 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:00:23] [INFO ] Computed 52 place invariants in 494 ms
[2022-06-08 12:00:23] [INFO ] [Real]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 12:00:23] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 12:00:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:00:27] [INFO ] [Real]Absence check using state equation in 3505 ms returned sat
[2022-06-08 12:00:27] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 12:00:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 12:00:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2022-06-08 12:00:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 12:00:31] [INFO ] [Nat]Absence check using state equation in 3511 ms returned sat
[2022-06-08 12:00:31] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 12:00:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:00:38] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6865 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 553 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 554 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:00:39] [INFO ] Computed 52 place invariants in 511 ms
[2022-06-08 12:00:43] [INFO ] Implicit Places using invariants in 3850 ms returned []
Implicit Place search using SMT only with invariants took 3871 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:00:43] [INFO ] Computed 52 place invariants in 527 ms
[2022-06-08 12:00:52] [INFO ] Dead Transitions using invariants and state equation in 9185 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-10 in 110122 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-12
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 12:00:53] [INFO ] Computed 52 place invariants in 571 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 12:00:53] [INFO ] Computed 52 place invariants in 567 ms
[2022-06-08 12:00:54] [INFO ] [Real]Absence check using 50 positive place invariants in 69 ms returned sat
[2022-06-08 12:00:54] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 32 ms returned sat
[2022-06-08 12:00:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:00:58] [INFO ] [Real]Absence check using state equation in 4335 ms returned sat
[2022-06-08 12:00:58] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 12:00:58] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:240)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:580)
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:446)
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) : [50] Max seen :[0]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2851 transition count 10252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 2851 transition count 10251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 2850 transition count 10251
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 2850 transition count 10251
Applied a total of 23 rules in 2313 ms. Remains 2850 /2859 variables (removed 9) and now considering 10251/10260 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2859 places, 10251/10260 transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:01:01] [INFO ] Computed 52 place invariants in 495 ms
Incomplete random walk after 1000000 steps, including 4234 resets, run finished after 18068 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 66 resets, run finished after 1857 ms. (steps per millisecond=538 ) properties (out of 1) seen :1
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:01:22] [INFO ] Computed 52 place invariants in 508 ms
[2022-06-08 12:01:22] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 12:01:22] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 12:01:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:01:26] [INFO ] [Real]Absence check using state equation in 3935 ms returned sat
[2022-06-08 12:01:26] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 12:01:27] [INFO ] [Nat]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 12:01:27] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 12:01:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 12:01:31] [INFO ] [Nat]Absence check using state equation in 3981 ms returned sat
[2022-06-08 12:01:31] [INFO ] State equation strengthened by 10053 read => feed constraints.
[2022-06-08 12:01:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:01:38] [INFO ] [Nat]Added 10053 Read/Feed constraints in 6843 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 575 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 570 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:01:40] [INFO ] Computed 52 place invariants in 502 ms
[2022-06-08 12:01:45] [INFO ] Implicit Places using invariants in 5559 ms returned []
Implicit Place search using SMT only with invariants took 5574 ms to find 0 implicit places.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:01:45] [INFO ] Computed 52 place invariants in 505 ms
[2022-06-08 12:01:53] [INFO ] Dead Transitions using invariants and state equation in 8410 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:01:54] [INFO ] Computed 52 place invariants in 515 ms
Incomplete random walk after 1000000 steps, including 4238 resets, run finished after 17966 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 69 resets, run finished after 1834 ms. (steps per millisecond=545 ) properties (out of 1) seen :1
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:02:14] [INFO ] Computed 52 place invariants in 495 ms
[2022-06-08 12:02:14] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 12:02:14] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 12:02:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:02:18] [INFO ] [Real]Absence check using state equation in 3715 ms returned sat
[2022-06-08 12:02:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 12:02:19] [INFO ] [Nat]Absence check using 50 positive place invariants in 62 ms returned sat
[2022-06-08 12:02:19] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 12:02:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 12:02:23] [INFO ] [Nat]Absence check using state equation in 3827 ms returned sat
[2022-06-08 12:02:23] [INFO ] State equation strengthened by 10053 read => feed constraints.
[2022-06-08 12:02:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:02:30] [INFO ] [Nat]Added 10053 Read/Feed constraints in 6850 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 574 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 569 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:02:31] [INFO ] Computed 52 place invariants in 494 ms
[2022-06-08 12:02:36] [INFO ] Implicit Places using invariants in 5560 ms returned []
Implicit Place search using SMT only with invariants took 5569 ms to find 0 implicit places.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:02:37] [INFO ] Computed 52 place invariants in 522 ms
[2022-06-08 12:02:46] [INFO ] Dead Transitions using invariants and state equation in 9143 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-12 in 113655 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-13
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 12:02:46] [INFO ] Computed 52 place invariants in 574 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 12:02:47] [INFO ] Computed 52 place invariants in 574 ms
[2022-06-08 12:02:47] [INFO ] [Real]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 12:02:47] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 12:02:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:02:52] [INFO ] [Real]Absence check using state equation in 4554 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2851 transition count 10252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 2851 transition count 10251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 2850 transition count 10251
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 2850 transition count 10251
Applied a total of 23 rules in 2156 ms. Remains 2850 /2859 variables (removed 9) and now considering 10251/10260 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2859 places, 10251/10260 transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:02:55] [INFO ] Computed 52 place invariants in 499 ms
Incomplete random walk after 1000000 steps, including 4230 resets, run finished after 18068 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1846 ms. (steps per millisecond=541 ) properties (out of 1) seen :1
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:03:15] [INFO ] Computed 52 place invariants in 497 ms
[2022-06-08 12:03:15] [INFO ] [Real]Absence check using 50 positive place invariants in 59 ms returned sat
[2022-06-08 12:03:16] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2022-06-08 12:03:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:03:19] [INFO ] [Real]Absence check using state equation in 3808 ms returned sat
[2022-06-08 12:03:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 12:03:20] [INFO ] [Nat]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 12:03:20] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 12:03:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 12:03:24] [INFO ] [Nat]Absence check using state equation in 3835 ms returned sat
[2022-06-08 12:03:24] [INFO ] State equation strengthened by 10053 read => feed constraints.
[2022-06-08 12:03:28] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:03:31] [INFO ] [Nat]Added 10053 Read/Feed constraints in 6839 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 573 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 569 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:03:33] [INFO ] Computed 52 place invariants in 498 ms
[2022-06-08 12:03:37] [INFO ] Implicit Places using invariants in 5406 ms returned []
Implicit Place search using SMT only with invariants took 5406 ms to find 0 implicit places.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:03:38] [INFO ] Computed 52 place invariants in 495 ms
[2022-06-08 12:03:47] [INFO ] Dead Transitions using invariants and state equation in 9017 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-13 in 60950 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-14
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 12:03:47] [INFO ] Computed 52 place invariants in 592 ms
Incomplete random walk after 10000 steps, including 41 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 12:03:48] [INFO ] Computed 52 place invariants in 570 ms
[2022-06-08 12:03:48] [INFO ] [Real]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 12:03:48] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 12:03:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:03:53] [INFO ] [Real]Absence check using state equation in 4545 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2851 transition count 10252
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 2851 transition count 10251
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 2850 transition count 10251
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 23 place count 2850 transition count 10251
Applied a total of 23 rules in 2168 ms. Remains 2850 /2859 variables (removed 9) and now considering 10251/10260 (removed 9) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2859 places, 10251/10260 transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:03:56] [INFO ] Computed 52 place invariants in 490 ms
Incomplete random walk after 1000000 steps, including 4239 resets, run finished after 18020 ms. (steps per millisecond=55 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 67 resets, run finished after 1906 ms. (steps per millisecond=524 ) properties (out of 1) seen :1
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:04:16] [INFO ] Computed 52 place invariants in 492 ms
[2022-06-08 12:04:16] [INFO ] [Real]Absence check using 50 positive place invariants in 59 ms returned sat
[2022-06-08 12:04:16] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 30 ms returned sat
[2022-06-08 12:04:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:04:20] [INFO ] [Real]Absence check using state equation in 3664 ms returned sat
[2022-06-08 12:04:20] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 12:04:21] [INFO ] [Nat]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 12:04:21] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 29 ms returned sat
[2022-06-08 12:04:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 12:04:25] [INFO ] [Nat]Absence check using state equation in 3767 ms returned sat
[2022-06-08 12:04:25] [INFO ] State equation strengthened by 10053 read => feed constraints.
[2022-06-08 12:04:29] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:04:32] [INFO ] [Nat]Added 10053 Read/Feed constraints in 6842 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2850 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 593 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Starting structural reductions, iteration 0 : 2850/2850 places, 10251/10251 transitions.
Applied a total of 0 rules in 571 ms. Remains 2850 /2850 variables (removed 0) and now considering 10251/10251 (removed 0) transitions.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:04:33] [INFO ] Computed 52 place invariants in 491 ms
[2022-06-08 12:04:38] [INFO ] Implicit Places using invariants in 5492 ms returned []
Implicit Place search using SMT only with invariants took 5503 ms to find 0 implicit places.
// Phase 1: matrix 10251 rows 2850 cols
[2022-06-08 12:04:39] [INFO ] Computed 52 place invariants in 490 ms
[2022-06-08 12:04:47] [INFO ] Dead Transitions using invariants and state equation in 8753 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2850/2850 places, 10251/10251 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-14 in 60576 ms.
Starting property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-15
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 12:04:48] [INFO ] Computed 52 place invariants in 561 ms
Incomplete random walk after 10000 steps, including 42 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 10260 rows 2859 cols
[2022-06-08 12:04:48] [INFO ] Computed 52 place invariants in 555 ms
[2022-06-08 12:04:49] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 12:04:49] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 12:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:04:52] [INFO ] [Real]Absence check using state equation in 3488 ms returned sat
[2022-06-08 12:04:53] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 12:04:53] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 12:04:53] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2022-06-08 12:04:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 12:04:57] [INFO ] [Nat]Absence check using state equation in 3574 ms returned sat
[2022-06-08 12:04:57] [INFO ] State equation strengthened by 10032 read => feed constraints.
[2022-06-08 12:04:58] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:04:58] [INFO ] [Nat]Added 10032 Read/Feed constraints in 917 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[0]
Support contains 1 out of 2859 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2859/2859 places, 10260/10260 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 2852 transition count 10253
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 2852 transition count 10252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 2851 transition count 10252
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 22 place count 2851 transition count 10252
Applied a total of 22 rules in 2105 ms. Remains 2851 /2859 variables (removed 8) and now considering 10252/10260 (removed 8) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2859 places, 10252/10260 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:05:00] [INFO ] Computed 52 place invariants in 509 ms
Incomplete random walk after 1000000 steps, including 4234 resets, run finished after 16968 ms. (steps per millisecond=58 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1743 ms. (steps per millisecond=573 ) properties (out of 1) seen :0
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:05:20] [INFO ] Computed 52 place invariants in 551 ms
[2022-06-08 12:05:20] [INFO ] [Real]Absence check using 50 positive place invariants in 65 ms returned sat
[2022-06-08 12:05:20] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 12:05:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:05:25] [INFO ] [Real]Absence check using state equation in 4978 ms returned sat
[2022-06-08 12:05:25] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 12:05:26] [INFO ] [Nat]Absence check using 50 positive place invariants in 64 ms returned sat
[2022-06-08 12:05:26] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 12:05:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 12:05:31] [INFO ] [Nat]Absence check using state equation in 5000 ms returned sat
[2022-06-08 12:05:31] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 12:05:35] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:05:38] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6788 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 554 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 543 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:05:39] [INFO ] Computed 52 place invariants in 500 ms
[2022-06-08 12:05:43] [INFO ] Implicit Places using invariants in 4401 ms returned []
Implicit Place search using SMT only with invariants took 4402 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:05:44] [INFO ] Computed 52 place invariants in 684 ms
[2022-06-08 12:05:52] [INFO ] Dead Transitions using invariants and state equation in 8520 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:05:52] [INFO ] Computed 52 place invariants in 540 ms
Incomplete random walk after 1000000 steps, including 4237 resets, run finished after 17165 ms. (steps per millisecond=58 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 1000001 steps, including 68 resets, run finished after 1768 ms. (steps per millisecond=565 ) properties (out of 1) seen :1
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:06:12] [INFO ] Computed 52 place invariants in 501 ms
[2022-06-08 12:06:12] [INFO ] [Real]Absence check using 50 positive place invariants in 61 ms returned sat
[2022-06-08 12:06:12] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 28 ms returned sat
[2022-06-08 12:06:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-06-08 12:06:17] [INFO ] [Real]Absence check using state equation in 5073 ms returned sat
[2022-06-08 12:06:18] [INFO ] Solution in real domain found non-integer solution.
[2022-06-08 12:06:18] [INFO ] [Nat]Absence check using 50 positive place invariants in 63 ms returned sat
[2022-06-08 12:06:18] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 27 ms returned sat
[2022-06-08 12:06:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-06-08 12:06:23] [INFO ] [Nat]Absence check using state equation in 5068 ms returned sat
[2022-06-08 12:06:23] [INFO ] State equation strengthened by 10052 read => feed constraints.
[2022-06-08 12:06:27] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:06:30] [INFO ] [Nat]Added 10052 Read/Feed constraints in 6819 ms returned unknown
Current structural bounds on expressions (after SMT) : [50] Max seen :[1]
Support contains 1 out of 2851 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 561 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Starting structural reductions, iteration 0 : 2851/2851 places, 10252/10252 transitions.
Applied a total of 0 rules in 549 ms. Remains 2851 /2851 variables (removed 0) and now considering 10252/10252 (removed 0) transitions.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:06:32] [INFO ] Computed 52 place invariants in 505 ms
[2022-06-08 12:06:35] [INFO ] Implicit Places using invariants in 3874 ms returned []
Implicit Place search using SMT only with invariants took 3888 ms to find 0 implicit places.
// Phase 1: matrix 10252 rows 2851 cols
[2022-06-08 12:06:36] [INFO ] Computed 52 place invariants in 505 ms
[2022-06-08 12:06:36] [INFO ] SMT solver returned unknown. Retrying;
[2022-06-08 12:06:44] [INFO ] Dead Transitions using invariants and state equation in 9402 ms returned []
Finished structural reductions, in 1 iterations. Remains : 2851/2851 places, 10252/10252 transitions.
Ending property specific reduction for CANInsertWithFailure-PT-050-UpperBounds-15 in 117316 ms.
[2022-06-08 12:06:46] [INFO ] Flatten gal took : 1060 ms
[2022-06-08 12:06:46] [INFO ] Applying decomposition
[2022-06-08 12:06:47] [INFO ] Flatten gal took : 461 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph14882250033695970568.txt, -o, /tmp/graph14882250033695970568.bin, -w, /tmp/graph14882250033695970568.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph14882250033695970568.bin, -l, -1, -v, -w, /tmp/graph14882250033695970568.weights, -q, 0, -e, 0.001], workingDir=null]
[2022-06-08 12:06:48] [INFO ] Decomposing Gal with order
[2022-06-08 12:06:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-08 12:06:50] [INFO ] Removed a total of 7789 redundant transitions.
[2022-06-08 12:06:51] [INFO ] Flatten gal took : 2018 ms
[2022-06-08 12:06:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 8818 labels/synchronizations in 1086 ms.
[2022-06-08 12:06:52] [INFO ] Time to serialize gal into /tmp/UpperBounds14419041402779877170.gal : 181 ms
[2022-06-08 12:06:52] [INFO ] Time to serialize properties into /tmp/UpperBounds969281495028092283.prop : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64, --gc-threshold, 2000000, --quiet, -i, /tmp/UpperBounds14419041402779877170.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds969281495028092283.prop, --nowitness], workingDir=/home/mcc/execution]
its-reach command run as :
/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp/UpperBounds14419041402779877170.gal -t CGAL -reachable-file /tmp/UpperBounds969281495028092283.prop --nowitness
Loading property file /tmp/UpperBounds969281495028092283.prop.
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-050"
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-050, 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-165463878300016"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CANInsertWithFailure-PT-050.tgz
mv CANInsertWithFailure-PT-050 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 ;