fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r064-tall-162038396800155
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for DES-PT-60b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3684.735 715854.00 708932.00 17085.40 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r064-tall-162038396800155.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-60b, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r064-tall-162038396800155
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 138K May 5 16:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 94K May 5 16:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 15:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 28 15:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Mar 28 15:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 15:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 03:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 22 12:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Mar 22 12:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 4 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 139K May 5 16:51 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 DES-PT-60b-UpperBounds-00
FORMULA_NAME DES-PT-60b-UpperBounds-01
FORMULA_NAME DES-PT-60b-UpperBounds-02
FORMULA_NAME DES-PT-60b-UpperBounds-03
FORMULA_NAME DES-PT-60b-UpperBounds-04
FORMULA_NAME DES-PT-60b-UpperBounds-05
FORMULA_NAME DES-PT-60b-UpperBounds-06
FORMULA_NAME DES-PT-60b-UpperBounds-07
FORMULA_NAME DES-PT-60b-UpperBounds-08
FORMULA_NAME DES-PT-60b-UpperBounds-09
FORMULA_NAME DES-PT-60b-UpperBounds-10
FORMULA_NAME DES-PT-60b-UpperBounds-11
FORMULA_NAME DES-PT-60b-UpperBounds-12
FORMULA_NAME DES-PT-60b-UpperBounds-13
FORMULA_NAME DES-PT-60b-UpperBounds-14
FORMULA_NAME DES-PT-60b-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1620485181060

Running Version 0
[2021-05-08 14:46:22] [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]
[2021-05-08 14:46:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-08 14:46:22] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2021-05-08 14:46:22] [INFO ] Transformed 519 places.
[2021-05-08 14:46:22] [INFO ] Transformed 470 transitions.
[2021-05-08 14:46:22] [INFO ] Found NUPN structural information;
[2021-05-08 14:46:22] [INFO ] Parsed PT model containing 519 places and 470 transitions in 118 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 470 rows 519 cols
[2021-05-08 14:46:22] [INFO ] Computed 65 place invariants in 45 ms
Incomplete random walk after 10000 steps, including 83 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 16) seen :7
FORMULA DES-PT-60b-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-60b-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 9) seen :0
// Phase 1: matrix 470 rows 519 cols
[2021-05-08 14:46:23] [INFO ] Computed 65 place invariants in 19 ms
[2021-05-08 14:46:23] [INFO ] [Real]Absence check using 39 positive place invariants in 20 ms returned sat
[2021-05-08 14:46:23] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 20 ms returned sat
[2021-05-08 14:46:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:23] [INFO ] [Real]Absence check using state equation in 161 ms returned sat
[2021-05-08 14:46:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:46:23] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2021-05-08 14:46:23] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 302 ms returned sat
[2021-05-08 14:46:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:24] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2021-05-08 14:46:24] [INFO ] Deduced a trap composed of 15 places in 172 ms of which 4 ms to minimize.
[2021-05-08 14:46:24] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 2 ms to minimize.
[2021-05-08 14:46:24] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 1 ms to minimize.
[2021-05-08 14:46:24] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2021-05-08 14:46:24] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2021-05-08 14:46:24] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2021-05-08 14:46:25] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 1 ms to minimize.
[2021-05-08 14:46:25] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 0 ms to minimize.
[2021-05-08 14:46:25] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2021-05-08 14:46:25] [INFO ] Deduced a trap composed of 36 places in 119 ms of which 1 ms to minimize.
[2021-05-08 14:46:25] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1262 ms
[2021-05-08 14:46:25] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 33 ms.
[2021-05-08 14:46:28] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2021-05-08 14:46:28] [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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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: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)
[2021-05-08 14:46:28] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2021-05-08 14:46:28] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 14:46:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:28] [INFO ] [Real]Absence check using state equation in 155 ms returned sat
[2021-05-08 14:46:28] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:46:28] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:28] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 16 ms returned sat
[2021-05-08 14:46:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:29] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2021-05-08 14:46:29] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 1 ms to minimize.
[2021-05-08 14:46:29] [INFO ] Deduced a trap composed of 12 places in 112 ms of which 0 ms to minimize.
[2021-05-08 14:46:29] [INFO ] Deduced a trap composed of 13 places in 112 ms of which 0 ms to minimize.
[2021-05-08 14:46:29] [INFO ] Deduced a trap composed of 33 places in 117 ms of which 0 ms to minimize.
[2021-05-08 14:46:29] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 1 ms to minimize.
[2021-05-08 14:46:29] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2021-05-08 14:46:29] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 5 ms to minimize.
[2021-05-08 14:46:29] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 896 ms
[2021-05-08 14:46:29] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 27 ms.
[2021-05-08 14:46:32] [INFO ] Added : 257 causal constraints over 52 iterations in 2315 ms. Result :sat
Minimization took 263 ms.
[2021-05-08 14:46:32] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:32] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 14:46:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:32] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-08 14:46:32] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:46:32] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:32] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2021-05-08 14:46:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:33] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2021-05-08 14:46:33] [INFO ] Deduced a trap composed of 10 places in 141 ms of which 1 ms to minimize.
[2021-05-08 14:46:33] [INFO ] Deduced a trap composed of 24 places in 118 ms of which 1 ms to minimize.
[2021-05-08 14:46:33] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2021-05-08 14:46:33] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 0 ms to minimize.
[2021-05-08 14:46:34] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2021-05-08 14:46:34] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 0 ms to minimize.
[2021-05-08 14:46:34] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 840 ms
[2021-05-08 14:46:34] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 36 ms.
[2021-05-08 14:46:37] [INFO ] Added : 380 causal constraints over 76 iterations in 3708 ms. Result :unknown
[2021-05-08 14:46:37] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:37] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 14:46:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:38] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-08 14:46:38] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:46:38] [INFO ] [Nat]Absence check using 39 positive place invariants in 15 ms returned sat
[2021-05-08 14:46:38] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 14:46:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:38] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2021-05-08 14:46:38] [INFO ] Deduced a trap composed of 12 places in 111 ms of which 1 ms to minimize.
[2021-05-08 14:46:38] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 0 ms to minimize.
[2021-05-08 14:46:38] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 0 ms to minimize.
[2021-05-08 14:46:38] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 1 ms to minimize.
[2021-05-08 14:46:39] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 0 ms to minimize.
[2021-05-08 14:46:39] [INFO ] Deduced a trap composed of 36 places in 96 ms of which 0 ms to minimize.
[2021-05-08 14:46:39] [INFO ] Deduced a trap composed of 27 places in 98 ms of which 0 ms to minimize.
[2021-05-08 14:46:39] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 880 ms
[2021-05-08 14:46:39] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 25 ms.
[2021-05-08 14:46:43] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2021-05-08 14:46:43] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 1 ms to minimize.
[2021-05-08 14:46:43] [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 3
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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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: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)
[2021-05-08 14:46:43] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:43] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2021-05-08 14:46:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:43] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-08 14:46:43] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:46:43] [INFO ] [Nat]Absence check using 39 positive place invariants in 16 ms returned sat
[2021-05-08 14:46:44] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 715 ms returned sat
[2021-05-08 14:46:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:44] [INFO ] [Nat]Absence check using state equation in 530 ms returned sat
[2021-05-08 14:46:44] [INFO ] Deduced a trap composed of 14 places in 97 ms of which 1 ms to minimize.
[2021-05-08 14:46:44] [INFO ] Deduced a trap composed of 23 places in 97 ms of which 0 ms to minimize.
[2021-05-08 14:46:45] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
[2021-05-08 14:46:45] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 1 ms to minimize.
[2021-05-08 14:46:45] [INFO ] Deduced a trap composed of 22 places in 96 ms of which 0 ms to minimize.
[2021-05-08 14:46:45] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2021-05-08 14:46:45] [INFO ] Deduced a trap composed of 24 places in 73 ms of which 0 ms to minimize.
[2021-05-08 14:46:45] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 814 ms
[2021-05-08 14:46:45] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 22 ms.
[2021-05-08 14:46:47] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 0 ms to minimize.
[2021-05-08 14:46:47] [INFO ] Deduced a trap composed of 22 places in 72 ms of which 0 ms to minimize.
[2021-05-08 14:46:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 223 ms
[2021-05-08 14:46:47] [INFO ] Added : 275 causal constraints over 55 iterations in 1874 ms. Result :sat
Minimization took 713 ms.
[2021-05-08 14:46:48] [INFO ] [Real]Absence check using 39 positive place invariants in 15 ms returned sat
[2021-05-08 14:46:48] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2021-05-08 14:46:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:48] [INFO ] [Real]Absence check using state equation in 153 ms returned sat
[2021-05-08 14:46:48] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:46:48] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:50] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 1758 ms returned sat
[2021-05-08 14:46:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:53] [INFO ] [Nat]Absence check using state equation in 3175 ms returned unknown
[2021-05-08 14:46:53] [INFO ] [Real]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:53] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 14:46:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:53] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2021-05-08 14:46:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:46:53] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:54] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 814 ms returned sat
[2021-05-08 14:46:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:55] [INFO ] [Nat]Absence check using state equation in 392 ms returned sat
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 20 places in 83 ms of which 0 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 0 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 29 places in 74 ms of which 0 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 0 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 53 places in 72 ms of which 1 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 0 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 1 ms to minimize.
[2021-05-08 14:46:55] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2021-05-08 14:46:56] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 0 ms to minimize.
[2021-05-08 14:46:56] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 0 ms to minimize.
[2021-05-08 14:46:56] [INFO ] Deduced a trap composed of 51 places in 73 ms of which 1 ms to minimize.
[2021-05-08 14:46:56] [INFO ] Deduced a trap composed of 53 places in 71 ms of which 0 ms to minimize.
[2021-05-08 14:46:56] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 0 ms to minimize.
[2021-05-08 14:46:56] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 1441 ms
[2021-05-08 14:46:56] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 18 ms.
[2021-05-08 14:46:58] [INFO ] Added : 100 causal constraints over 20 iterations in 2274 ms. Result :unknown
[2021-05-08 14:46:58] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2021-05-08 14:46:58] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 17 ms returned sat
[2021-05-08 14:46:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:59] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2021-05-08 14:46:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:46:59] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:46:59] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 19 ms returned sat
[2021-05-08 14:46:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:46:59] [INFO ] [Nat]Absence check using state equation in 170 ms returned sat
[2021-05-08 14:46:59] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 0 ms to minimize.
[2021-05-08 14:46:59] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2021-05-08 14:46:59] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 0 ms to minimize.
[2021-05-08 14:46:59] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 0 ms to minimize.
[2021-05-08 14:46:59] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 0 ms to minimize.
[2021-05-08 14:46:59] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 633 ms
[2021-05-08 14:46:59] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 21 ms.
[2021-05-08 14:47:02] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2021-05-08 14:47:02] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 0 ms to minimize.
[2021-05-08 14:47:02] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2021-05-08 14:47:02] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 0 ms to minimize.
[2021-05-08 14:47:03] [INFO ] Deduced a trap composed of 33 places in 91 ms of which 1 ms to minimize.
[2021-05-08 14:47:03] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 0 ms to minimize.
[2021-05-08 14:47:03] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2021-05-08 14:47:03] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 900 ms
[2021-05-08 14:47:03] [INFO ] Added : 269 causal constraints over 55 iterations in 3434 ms. Result :sat
Minimization took 176 ms.
[2021-05-08 14:47:03] [INFO ] [Real]Absence check using 39 positive place invariants in 13 ms returned sat
[2021-05-08 14:47:03] [INFO ] [Real]Absence check using 39 positive and 26 generalized place invariants in 18 ms returned sat
[2021-05-08 14:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:03] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2021-05-08 14:47:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:47:03] [INFO ] [Nat]Absence check using 39 positive place invariants in 14 ms returned sat
[2021-05-08 14:47:04] [INFO ] [Nat]Absence check using 39 positive and 26 generalized place invariants in 129 ms returned sat
[2021-05-08 14:47:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:04] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2021-05-08 14:47:04] [INFO ] Deduced a trap composed of 12 places in 76 ms of which 0 ms to minimize.
[2021-05-08 14:47:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2021-05-08 14:47:04] [INFO ] Computed and/alt/rep : 464/1033/464 causal constraints (skipped 5 transitions) in 23 ms.
[2021-05-08 14:47:08] [INFO ] Deduced a trap composed of 22 places in 36 ms of which 1 ms to minimize.
[2021-05-08 14:47:08] [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 8
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.refineWithTraps(DeadlockTester.java:906)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:849)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:595)
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:428)
at fr.lip6.move.gal.application.Application.start(Application.java:140)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:43)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:134)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:401)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:62)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:566)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:653)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:590)
at org.eclipse.equinox.launcher.Main.run(Main.java:1461)
at org.eclipse.equinox.launcher.Main.main(Main.java:1434)
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 545200 steps, including 5270 resets, run finished after 1662 ms. (steps per millisecond=328 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 219500 steps, including 2296 resets, run finished after 656 ms. (steps per millisecond=334 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 263300 steps, including 2824 resets, run finished after 821 ms. (steps per millisecond=320 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 690600 steps, including 6451 resets, run finished after 2040 ms. (steps per millisecond=338 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 519600 steps, including 4914 resets, run finished after 1538 ms. (steps per millisecond=337 ) properties (out of 9) seen :0 could not realise parikh vector
Support contains 9 out of 519 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 519/519 places, 470/470 transitions.
Graph (complete) has 1218 edges and 519 vertex of which 508 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.7 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 508 transition count 442
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 45 place count 487 transition count 442
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 45 place count 487 transition count 433
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 63 place count 478 transition count 433
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 82 place count 459 transition count 414
Iterating global reduction 2 with 19 rules applied. Total rules applied 101 place count 459 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 101 place count 459 transition count 413
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 103 place count 458 transition count 413
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 118 place count 443 transition count 398
Iterating global reduction 2 with 15 rules applied. Total rules applied 133 place count 443 transition count 398
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 15 rules applied. Total rules applied 148 place count 443 transition count 383
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 151 place count 441 transition count 382
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 151 place count 441 transition count 379
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 157 place count 438 transition count 379
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 4 with 154 rules applied. Total rules applied 311 place count 361 transition count 302
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 315 place count 359 transition count 304
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 359 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 358 transition count 303
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 318 place count 358 transition count 303
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 319 place count 357 transition count 302
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 320 place count 356 transition count 302
Applied a total of 320 rules in 255 ms. Remains 356 /519 variables (removed 163) and now considering 302/470 (removed 168) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/519 places, 302/470 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:47:15] [INFO ] Computed 60 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 47862 resets, run finished after 3043 ms. (steps per millisecond=328 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9203 resets, run finished after 1134 ms. (steps per millisecond=881 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9006 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9062 resets, run finished after 1128 ms. (steps per millisecond=886 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9086 resets, run finished after 1130 ms. (steps per millisecond=884 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9307 resets, run finished after 1112 ms. (steps per millisecond=899 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 8997 resets, run finished after 1108 ms. (steps per millisecond=902 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9217 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9187 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9009 resets, run finished after 1121 ms. (steps per millisecond=892 ) properties (out of 9) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:47:28] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-08 14:47:28] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:47:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:47:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:29] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2021-05-08 14:47:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:47:29] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:47:29] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 144 ms returned sat
[2021-05-08 14:47:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:30] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2021-05-08 14:47:30] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 14 ms.
[2021-05-08 14:47:30] [INFO ] Added : 188 causal constraints over 38 iterations in 749 ms. Result :sat
Minimization took 179 ms.
[2021-05-08 14:47:31] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:47:31] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:47:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:31] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-08 14:47:31] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:47:31] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:47:31] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 205 ms returned sat
[2021-05-08 14:47:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:37] [INFO ] [Nat]Absence check using state equation in 6036 ms returned sat
[2021-05-08 14:47:37] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:47:40] [INFO ] Added : 170 causal constraints over 72 iterations in 2686 ms. Result :sat
Minimization took 39 ms.
[2021-05-08 14:47:40] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:47:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:47:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:40] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-08 14:47:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:47:40] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:47:40] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 205 ms returned sat
[2021-05-08 14:47:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:46] [INFO ] [Nat]Absence check using state equation in 6289 ms returned sat
[2021-05-08 14:47:46] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:47:49] [INFO ] Added : 166 causal constraints over 71 iterations in 2866 ms. Result :sat
Minimization took 139 ms.
[2021-05-08 14:47:49] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:47:49] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:47:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:50] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-08 14:47:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:47:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:47:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 204 ms returned sat
[2021-05-08 14:47:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:56] [INFO ] [Nat]Absence check using state equation in 6025 ms returned sat
[2021-05-08 14:47:56] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:47:59] [INFO ] Added : 170 causal constraints over 72 iterations in 2758 ms. Result :sat
Minimization took 40 ms.
[2021-05-08 14:47:59] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:47:59] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:47:59] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2021-05-08 14:47:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:47:59] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:47:59] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 152 ms returned sat
[2021-05-08 14:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:00] [INFO ] [Nat]Absence check using state equation in 744 ms returned sat
[2021-05-08 14:48:00] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 12 ms.
[2021-05-08 14:48:01] [INFO ] Deduced a trap composed of 60 places in 26 ms of which 1 ms to minimize.
[2021-05-08 14:48:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2021-05-08 14:48:01] [INFO ] Added : 161 causal constraints over 33 iterations in 684 ms. Result :sat
Minimization took 150 ms.
[2021-05-08 14:48:01] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:48:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:01] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-08 14:48:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2021-05-08 14:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:01] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-08 14:48:01] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:48:02] [INFO ] Added : 174 causal constraints over 35 iterations in 719 ms. Result :sat
Minimization took 128 ms.
[2021-05-08 14:48:02] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:48:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:03] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-08 14:48:03] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:48:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 140 ms returned sat
[2021-05-08 14:48:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:03] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2021-05-08 14:48:03] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:48:04] [INFO ] Added : 108 causal constraints over 22 iterations in 519 ms. Result :sat
Minimization took 63 ms.
[2021-05-08 14:48:04] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:48:04] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:48:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:04] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2021-05-08 14:48:04] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:04] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:04] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 205 ms returned sat
[2021-05-08 14:48:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:10] [INFO ] [Nat]Absence check using state equation in 6032 ms returned sat
[2021-05-08 14:48:10] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 14 ms.
[2021-05-08 14:48:13] [INFO ] Added : 170 causal constraints over 72 iterations in 2628 ms. Result :sat
Minimization took 39 ms.
[2021-05-08 14:48:13] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:13] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:13] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-08 14:48:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:13] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:48:13] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 112 ms returned sat
[2021-05-08 14:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:20] [INFO ] [Nat]Absence check using state equation in 6223 ms returned unknown
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Parikh walk after 16500 steps, including 5500 resets, run finished after 62 ms. (steps per millisecond=266 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 75000 steps, including 4705 resets, run finished after 268 ms. (steps per millisecond=279 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 239500 steps, including 13644 resets, run finished after 739 ms. (steps per millisecond=324 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 236600 steps, including 13551 resets, run finished after 730 ms. (steps per millisecond=324 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16500 steps, including 5500 resets, run finished after 38 ms. (steps per millisecond=434 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14300 steps, including 4766 resets, run finished after 33 ms. (steps per millisecond=433 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 16500 steps, including 5500 resets, run finished after 39 ms. (steps per millisecond=423 ) properties (out of 9) seen :0 could not realise parikh vector
Incomplete Parikh walk after 156100 steps, including 8265 resets, run finished after 482 ms. (steps per millisecond=323 ) properties (out of 9) seen :0 could not realise parikh vector
Support contains 9 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:22] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:22] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:22] [INFO ] Computed 60 place invariants in 7 ms
[2021-05-08 14:48:23] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 612 ms to find 0 implicit places.
[2021-05-08 14:48:23] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:23] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 14:48:23] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting property specific reduction for DES-PT-60b-UpperBounds-02
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:23] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 489 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 95 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:23] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:48:23] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:23] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:48:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:23] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2021-05-08 14:48:23] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:23] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:23] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 146 ms returned sat
[2021-05-08 14:48:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:24] [INFO ] [Nat]Absence check using state equation in 662 ms returned sat
[2021-05-08 14:48:24] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:48:25] [INFO ] Added : 188 causal constraints over 38 iterations in 778 ms. Result :sat
Minimization took 180 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 156100 steps, including 8312 resets, run finished after 469 ms. (steps per millisecond=332 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 13 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:25] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47992 resets, run finished after 2811 ms. (steps per millisecond=355 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9131 resets, run finished after 1087 ms. (steps per millisecond=919 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:29] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:29] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:48:29] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 14:48:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:30] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-08 14:48:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:48:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 144 ms returned sat
[2021-05-08 14:48:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:30] [INFO ] [Nat]Absence check using state equation in 649 ms returned sat
[2021-05-08 14:48:30] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 14 ms.
[2021-05-08 14:48:31] [INFO ] Added : 188 causal constraints over 38 iterations in 752 ms. Result :sat
Minimization took 179 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 156100 steps, including 8185 resets, run finished after 461 ms. (steps per millisecond=338 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 12 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:32] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:32] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:32] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:32] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2021-05-08 14:48:32] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:32] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:33] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-02 in 9778 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-03
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:33] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 472 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:33] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:33] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:48:33] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:48:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:33] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-08 14:48:33] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:33] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:33] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 205 ms returned sat
[2021-05-08 14:48:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:38] [INFO ] [Nat]Absence check using state equation in 4757 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:38] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47610 resets, run finished after 2815 ms. (steps per millisecond=355 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9176 resets, run finished after 1093 ms. (steps per millisecond=914 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:42] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:42] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:42] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:48:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:42] [INFO ] [Real]Absence check using state equation in 98 ms returned sat
[2021-05-08 14:48:42] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 204 ms returned sat
[2021-05-08 14:48:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:48] [INFO ] [Nat]Absence check using state equation in 6023 ms returned sat
[2021-05-08 14:48:48] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:48:51] [INFO ] Added : 170 causal constraints over 72 iterations in 2597 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16500 steps, including 5500 resets, run finished after 36 ms. (steps per millisecond=458 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 11 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:51] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:51] [INFO ] Implicit Places using invariants in 177 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:51] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:48:52] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2021-05-08 14:48:52] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:52] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:52] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-03 in 19081 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-05
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:52] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 484 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 98 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:52] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:48:52] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:48:52] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:48:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:52] [INFO ] [Real]Absence check using state equation in 96 ms returned sat
[2021-05-08 14:48:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:48:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 8 ms returned sat
[2021-05-08 14:48:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 205 ms returned sat
[2021-05-08 14:48:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:48:57] [INFO ] [Nat]Absence check using state equation in 4756 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:48:57] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47920 resets, run finished after 2806 ms. (steps per millisecond=356 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9147 resets, run finished after 1092 ms. (steps per millisecond=915 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:01] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 14:49:01] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:01] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:49:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:01] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-08 14:49:01] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:01] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:01] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 205 ms returned sat
[2021-05-08 14:49:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:07] [INFO ] [Nat]Absence check using state equation in 6036 ms returned sat
[2021-05-08 14:49:07] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:49:10] [INFO ] Added : 170 causal constraints over 72 iterations in 2683 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16500 steps, including 5500 resets, run finished after 37 ms. (steps per millisecond=445 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 10 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:10] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:10] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:10] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:11] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
[2021-05-08 14:49:11] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:11] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:49:11] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-05 in 19170 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-06
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:11] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 482 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:11] [INFO ] Computed 60 place invariants in 5 ms
[2021-05-08 14:49:11] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:11] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:49:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:11] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-08 14:49:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:11] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:11] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 204 ms returned sat
[2021-05-08 14:49:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:16] [INFO ] [Nat]Absence check using state equation in 4759 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:16] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47906 resets, run finished after 2819 ms. (steps per millisecond=354 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9104 resets, run finished after 1088 ms. (steps per millisecond=919 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:20] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:20] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:20] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:49:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:20] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-08 14:49:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:20] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:20] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 205 ms returned sat
[2021-05-08 14:49:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:26] [INFO ] [Nat]Absence check using state equation in 6025 ms returned sat
[2021-05-08 14:49:26] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:49:29] [INFO ] Added : 170 causal constraints over 72 iterations in 2601 ms. Result :sat
Minimization took 41 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16500 steps, including 5500 resets, run finished after 36 ms. (steps per millisecond=458 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:29] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:29] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:29] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:49:30] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
[2021-05-08 14:49:30] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:30] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:30] [INFO ] Dead Transitions using invariants and state equation in 147 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-06 in 19088 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-08
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:30] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 474 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 100 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:30] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:30] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:30] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:49:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:30] [INFO ] [Real]Absence check using state equation in 169 ms returned sat
[2021-05-08 14:49:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:30] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:30] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 153 ms returned sat
[2021-05-08 14:49:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:31] [INFO ] [Nat]Absence check using state equation in 743 ms returned sat
[2021-05-08 14:49:31] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:49:32] [INFO ] Deduced a trap composed of 60 places in 21 ms of which 0 ms to minimize.
[2021-05-08 14:49:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 55 ms
[2021-05-08 14:49:32] [INFO ] Added : 161 causal constraints over 33 iterations in 698 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 236600 steps, including 13445 resets, run finished after 707 ms. (steps per millisecond=334 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:33] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47892 resets, run finished after 2827 ms. (steps per millisecond=353 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9109 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:37] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:49:37] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:37] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:49:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:37] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2021-05-08 14:49:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:37] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:37] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 153 ms returned sat
[2021-05-08 14:49:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:38] [INFO ] [Nat]Absence check using state equation in 742 ms returned sat
[2021-05-08 14:49:38] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:49:39] [INFO ] Deduced a trap composed of 60 places in 21 ms of which 0 ms to minimize.
[2021-05-08 14:49:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2021-05-08 14:49:39] [INFO ] Added : 161 causal constraints over 33 iterations in 684 ms. Result :sat
Minimization took 150 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 236600 steps, including 13543 resets, run finished after 692 ms. (steps per millisecond=341 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:39] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:40] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:40] [INFO ] Computed 60 place invariants in 6 ms
[2021-05-08 14:49:40] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2021-05-08 14:49:40] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:40] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:40] [INFO ] Dead Transitions using invariants and state equation in 137 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-08 in 10234 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-12
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:40] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 482 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:40] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:40] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:40] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:49:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:40] [INFO ] [Real]Absence check using state equation in 157 ms returned sat
[2021-05-08 14:49:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:41] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:41] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2021-05-08 14:49:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:41] [INFO ] [Nat]Absence check using state equation in 297 ms returned sat
[2021-05-08 14:49:41] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:49:42] [INFO ] Added : 174 causal constraints over 35 iterations in 733 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 239500 steps, including 13593 resets, run finished after 710 ms. (steps per millisecond=337 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:43] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47822 resets, run finished after 2820 ms. (steps per millisecond=354 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9026 resets, run finished after 1085 ms. (steps per millisecond=921 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:46] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:47] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:47] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:49:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:47] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2021-05-08 14:49:47] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:47] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:47] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2021-05-08 14:49:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:47] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2021-05-08 14:49:47] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 14 ms.
[2021-05-08 14:49:48] [INFO ] Added : 174 causal constraints over 35 iterations in 711 ms. Result :sat
Minimization took 127 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 239500 steps, including 13633 resets, run finished after 706 ms. (steps per millisecond=339 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 14 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:49] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:49] [INFO ] Implicit Places using invariants in 173 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:49] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:49] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2021-05-08 14:49:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:49] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:50] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-12 in 9321 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-13
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:50] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 520 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:50] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:49:50] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:50] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:49:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:50] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2021-05-08 14:49:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:50] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:50] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2021-05-08 14:49:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:51] [INFO ] [Nat]Absence check using state equation in 550 ms returned sat
[2021-05-08 14:49:51] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:49:51] [INFO ] Added : 108 causal constraints over 22 iterations in 516 ms. Result :sat
Minimization took 62 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 75000 steps, including 4680 resets, run finished after 216 ms. (steps per millisecond=347 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:51] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 47820 resets, run finished after 2829 ms. (steps per millisecond=353 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9268 resets, run finished after 1091 ms. (steps per millisecond=916 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:55] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:55] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:55] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:49:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:56] [INFO ] [Real]Absence check using state equation in 170 ms returned sat
[2021-05-08 14:49:56] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:56] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:56] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 145 ms returned sat
[2021-05-08 14:49:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:56] [INFO ] [Nat]Absence check using state equation in 551 ms returned sat
[2021-05-08 14:49:56] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:49:57] [INFO ] Added : 108 causal constraints over 22 iterations in 522 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 75000 steps, including 4707 resets, run finished after 215 ms. (steps per millisecond=348 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:57] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:57] [INFO ] Implicit Places using invariants in 168 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:57] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:49:58] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2021-05-08 14:49:58] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:58] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:49:58] [INFO ] Dead Transitions using invariants and state equation in 144 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-13 in 8326 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-14
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:58] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 483 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:49:58] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:49:58] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:49:58] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2021-05-08 14:49:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:49:58] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2021-05-08 14:49:58] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:49:58] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:49:58] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 205 ms returned sat
[2021-05-08 14:49:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:50:03] [INFO ] [Nat]Absence check using state equation in 4757 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:03] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 48085 resets, run finished after 2828 ms. (steps per millisecond=353 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 9208 resets, run finished after 1105 ms. (steps per millisecond=904 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:07] [INFO ] Computed 60 place invariants in 8 ms
[2021-05-08 14:50:07] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:50:07] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2021-05-08 14:50:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:50:07] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2021-05-08 14:50:07] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:50:07] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:50:07] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 207 ms returned sat
[2021-05-08 14:50:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:50:13] [INFO ] [Nat]Absence check using state equation in 6032 ms returned sat
[2021-05-08 14:50:14] [INFO ] Computed and/alt/rep : 288/500/288 causal constraints (skipped 11 transitions) in 15 ms.
[2021-05-08 14:50:16] [INFO ] Added : 170 causal constraints over 72 iterations in 2752 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Incomplete Parikh walk after 16500 steps, including 5500 resets, run finished after 37 ms. (steps per millisecond=445 ) properties (out of 1) seen :0 could not realise parikh vector
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 9 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:16] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:50:17] [INFO ] Implicit Places using invariants in 176 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:17] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:50:17] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
[2021-05-08 14:50:17] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:17] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:50:17] [INFO ] Dead Transitions using invariants and state equation in 146 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-14 in 19279 ms.
Starting property specific reduction for DES-PT-60b-UpperBounds-15
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:17] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 513 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:17] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:50:17] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:50:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:50:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:50:17] [INFO ] [Real]Absence check using state equation in 168 ms returned sat
[2021-05-08 14:50:17] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:50:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 7 ms returned sat
[2021-05-08 14:50:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 112 ms returned sat
[2021-05-08 14:50:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:50:22] [INFO ] [Nat]Absence check using state equation in 4845 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:22] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 47809 resets, run finished after 2837 ms. (steps per millisecond=352 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 9285 resets, run finished after 1101 ms. (steps per millisecond=908 ) properties (out of 1) seen :0
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:26] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:50:26] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:50:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2021-05-08 14:50:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-08 14:50:27] [INFO ] [Real]Absence check using state equation in 164 ms returned sat
[2021-05-08 14:50:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-08 14:50:27] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2021-05-08 14:50:27] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 112 ms returned sat
[2021-05-08 14:50:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-08 14:50:33] [INFO ] [Nat]Absence check using state equation in 6209 ms returned unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 356 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Starting structural reductions, iteration 0 : 356/356 places, 302/302 transitions.
Applied a total of 0 rules in 8 ms. Remains 356 /356 variables (removed 0) and now considering 302/302 (removed 0) transitions.
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:33] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:50:33] [INFO ] Implicit Places using invariants in 184 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:33] [INFO ] Computed 60 place invariants in 4 ms
[2021-05-08 14:50:34] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2021-05-08 14:50:34] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 302 rows 356 cols
[2021-05-08 14:50:34] [INFO ] Computed 60 place invariants in 3 ms
[2021-05-08 14:50:34] [INFO ] Dead Transitions using invariants and state equation in 145 ms returned []
Finished structural reductions, in 1 iterations. Remains : 356/356 places, 302/302 transitions.
Ending property specific reduction for DES-PT-60b-UpperBounds-15 in 16628 ms.
[2021-05-08 14:50:34] [INFO ] Flatten gal took : 68 ms
[2021-05-08 14:50:34] [INFO ] Applying decomposition
[2021-05-08 14:50:34] [INFO ] Flatten gal took : 29 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/graph7496364572746909168.txt, -o, /tmp/graph7496364572746909168.bin, -w, /tmp/graph7496364572746909168.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/graph7496364572746909168.bin, -l, -1, -v, -w, /tmp/graph7496364572746909168.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-08 14:50:34] [INFO ] Decomposing Gal with order
[2021-05-08 14:50:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-08 14:50:34] [INFO ] Removed a total of 47 redundant transitions.
[2021-05-08 14:50:34] [INFO ] Flatten gal took : 57 ms
[2021-05-08 14:50:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 7 ms.
[2021-05-08 14:50:34] [INFO ] Time to serialize gal into /tmp/UpperBounds9174284618384640937.gal : 63 ms
[2021-05-08 14:50:34] [INFO ] Time to serialize properties into /tmp/UpperBounds11426193178679851977.prop : 0 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/UpperBounds9174284618384640937.gal, -t, CGAL, -reachable-file, /tmp/UpperBounds11426193178679851977.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/UpperBounds9174284618384640937.gal -t CGAL -reachable-file /tmp/UpperBounds11426193178679851977.prop --nowitness
Loading property file /tmp/UpperBounds11426193178679851977.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.97064e+13,154.744,2482780,53998,12752,1.42492e+06,19648,286,2.68368e+07,541,356625,0
Total reachable state count : 99706440827392

Verifying 9 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-02 :0 <= u2.p220 <= 1
FORMULA DES-PT-60b-UpperBounds-02 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-02,0,239.404,2863676,1,0,1.42492e+06,19818,467,3.41077e+07,669,807186,1864
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-03 :0 <= u13.p146 <= 1
FORMULA DES-PT-60b-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-03,0,328.781,2863676,1,0,1.42492e+06,19843,430,3.41077e+07,693,808082,1845
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-05 :0 <= u13.p162 <= 1
FORMULA DES-PT-60b-UpperBounds-05 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-05,0,328.782,2863676,1,0,1.42492e+06,19869,452,3.41077e+07,746,808206,1856
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-06 :0 <= u13.p131 <= 1
FORMULA DES-PT-60b-UpperBounds-06 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-06,0,328.784,2863676,1,0,1.42492e+06,19870,474,3.41077e+07,867,808441,1867
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-08 :0 <= u48.p108 <= 1
FORMULA DES-PT-60b-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-08,0,340.819,3070124,1,0,1.42492e+06,20288,499,3.66343e+07,912,822547,2067
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-12 :0 <= u2.p221 <= 1
FORMULA DES-PT-60b-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-12,0,343.232,3147740,1,0,1.42492e+06,20317,522,3.75702e+07,971,822759,2102
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-13 :0 <= u2.p236 <= 1
FORMULA DES-PT-60b-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-13,0,343.383,3154076,1,0,1.42492e+06,20329,543,3.76518e+07,996,822836,2136
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-14 :0 <= u13.p134 <= 1
FORMULA DES-PT-60b-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-14,0,439.037,3120384,1,0,1.42492e+06,20329,430,3.76518e+07,717,822836,1845
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-60b-UpperBounds-15 :0 <= u48.p82 <= 1
FORMULA DES-PT-60b-UpperBounds-15 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-60b-UpperBounds-15,0,448.83,3120384,1,0,1.42492e+06,21780,455,3.76518e+07,822,827905,2045

BK_STOP 1620485896914

--------------------
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="DES-PT-60b"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-60b, 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 r064-tall-162038396800155"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-60b.tgz
mv DES-PT-60b 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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;