fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r267-smll-167863542100629
Last Updated
May 14, 2023

About the Execution of Smart+red for Peterson-PT-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
11375.220 3600000.00 3648733.00 8403.10 6 5 6 ? 6 6 6 6 ? 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/mcc2023-input.r267-smll-167863542100629.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Peterson-PT-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-167863542100629
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.3M
-rw-r--r-- 1 mcc users 139K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 565K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 124K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 584K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 64K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 201K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 166K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 161K Feb 25 22:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 668K Feb 25 22:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 22:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 841K Feb 25 22:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K Mar 5 18:23 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 Peterson-PT-5-UpperBounds-00
FORMULA_NAME Peterson-PT-5-UpperBounds-01
FORMULA_NAME Peterson-PT-5-UpperBounds-02
FORMULA_NAME Peterson-PT-5-UpperBounds-03
FORMULA_NAME Peterson-PT-5-UpperBounds-04
FORMULA_NAME Peterson-PT-5-UpperBounds-05
FORMULA_NAME Peterson-PT-5-UpperBounds-06
FORMULA_NAME Peterson-PT-5-UpperBounds-07
FORMULA_NAME Peterson-PT-5-UpperBounds-08
FORMULA_NAME Peterson-PT-5-UpperBounds-09
FORMULA_NAME Peterson-PT-5-UpperBounds-10
FORMULA_NAME Peterson-PT-5-UpperBounds-11
FORMULA_NAME Peterson-PT-5-UpperBounds-12
FORMULA_NAME Peterson-PT-5-UpperBounds-13
FORMULA_NAME Peterson-PT-5-UpperBounds-14
FORMULA_NAME Peterson-PT-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678946903061

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-5
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-16 06:08:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-16 06:08:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 06:08:26] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2023-03-16 06:08:26] [INFO ] Transformed 834 places.
[2023-03-16 06:08:26] [INFO ] Transformed 1242 transitions.
[2023-03-16 06:08:26] [INFO ] Found NUPN structural information;
[2023-03-16 06:08:26] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_1_3_5, IsEndLoop_2_1_5, BeginLoop_5_4_3, BeginLoop_3_4_3, BeginLoop_4_4_3, BeginLoop_4_1_5, BeginLoop_3_1_5, BeginLoop_5_1_5, BeginLoop_1_4_5, TestAlone_0_1_4, TestIdentity_1_3_3, TestIdentity_2_3_3, TestIdentity_0_0_2, TestIdentity_1_4_1, TestIdentity_4_4_1, TestIdentity_3_4_1, TestIdentity_5_3_2, TestIdentity_0_4_2, TestIdentity_1_4_2, TestIdentity_3_3_2, TestIdentity_4_3_2, TestIdentity_5_2_2]
[2023-03-16 06:08:26] [INFO ] Parsed PT model containing 834 places and 1242 transitions and 3828 arcs in 419 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 23 ms.
FORMULA Peterson-PT-5-UpperBounds-00 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-5-UpperBounds-01 5 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1122 out of 1242 initially.
// Phase 1: matrix 1122 rows 834 cols
[2023-03-16 06:08:27] [INFO ] Computed 23 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 305 ms. (steps per millisecond=32 ) properties (out of 14) seen :32
FORMULA Peterson-PT-5-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 10) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 10) seen :16
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :26
[2023-03-16 06:08:27] [INFO ] Flow matrix only has 1122 transitions (discarded 120 similar events)
// Phase 1: matrix 1122 rows 834 cols
[2023-03-16 06:08:27] [INFO ] Computed 23 place invariants in 13 ms
[2023-03-16 06:08:28] [INFO ] [Real]Absence check using 17 positive place invariants in 45 ms returned unsat
[2023-03-16 06:08:29] [INFO ] [Real]Absence check using 17 positive place invariants in 42 ms returned sat
[2023-03-16 06:08:29] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 06:08:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:29] [INFO ] [Real]Absence check using state equation in 667 ms returned sat
[2023-03-16 06:08:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:08:30] [INFO ] [Nat]Absence check using 17 positive place invariants in 30 ms returned sat
[2023-03-16 06:08:30] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-16 06:08:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:30] [INFO ] [Nat]Absence check using state equation in 577 ms returned sat
[2023-03-16 06:08:30] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:08:31] [INFO ] [Nat]Added 205 Read/Feed constraints in 252 ms returned sat
[2023-03-16 06:08:32] [INFO ] Deduced a trap composed of 49 places in 882 ms of which 7 ms to minimize.
[2023-03-16 06:08:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1165 ms
[2023-03-16 06:08:32] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 189 ms.
[2023-03-16 06:08:34] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 06:08:35] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned unsat
[2023-03-16 06:08:35] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned unsat
[2023-03-16 06:08:35] [INFO ] [Real]Absence check using 17 positive place invariants in 41 ms returned unsat
[2023-03-16 06:08:36] [INFO ] [Real]Absence check using 17 positive place invariants in 38 ms returned unsat
[2023-03-16 06:08:36] [INFO ] [Real]Absence check using 17 positive place invariants in 36 ms returned sat
[2023-03-16 06:08:36] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 06:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:37] [INFO ] [Real]Absence check using state equation in 673 ms returned sat
[2023-03-16 06:08:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:08:37] [INFO ] [Nat]Absence check using 17 positive place invariants in 41 ms returned sat
[2023-03-16 06:08:37] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 06:08:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:38] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2023-03-16 06:08:38] [INFO ] [Nat]Added 205 Read/Feed constraints in 44 ms returned sat
[2023-03-16 06:08:38] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 87 ms.
[2023-03-16 06:08:42] [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 6
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 06:08:42] [INFO ] [Real]Absence check using 17 positive place invariants in 39 ms returned sat
[2023-03-16 06:08:42] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 06:08:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:43] [INFO ] [Real]Absence check using state equation in 602 ms returned sat
[2023-03-16 06:08:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:08:43] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:08:43] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 06:08:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:43] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2023-03-16 06:08:44] [INFO ] [Nat]Added 205 Read/Feed constraints in 111 ms returned sat
[2023-03-16 06:08:44] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 125 ms.
[2023-03-16 06:08:48] [INFO ] Deduced a trap composed of 41 places in 765 ms of which 2 ms to minimize.
[2023-03-16 06:08:48] [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 7
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 06:08:49] [INFO ] [Real]Absence check using 17 positive place invariants in 38 ms returned sat
[2023-03-16 06:08:49] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 06:08:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:49] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2023-03-16 06:08:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:08:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 41 ms returned sat
[2023-03-16 06:08:50] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 06:08:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:50] [INFO ] [Nat]Absence check using state equation in 655 ms returned sat
[2023-03-16 06:08:51] [INFO ] [Nat]Added 205 Read/Feed constraints in 83 ms returned sat
[2023-03-16 06:08:51] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 129 ms.
[2023-03-16 06:08:56] [INFO ] Deduced a trap composed of 2 places in 1016 ms of which 2 ms to minimize.
[2023-03-16 06:08:56] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: 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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-16 06:08:56] [INFO ] [Real]Absence check using 17 positive place invariants in 38 ms returned sat
[2023-03-16 06:08:56] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 06:08:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:57] [INFO ] [Real]Absence check using state equation in 676 ms returned sat
[2023-03-16 06:08:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:08:57] [INFO ] [Nat]Absence check using 17 positive place invariants in 44 ms returned sat
[2023-03-16 06:08:57] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-16 06:08:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:08:58] [INFO ] [Nat]Absence check using state equation in 650 ms returned sat
[2023-03-16 06:08:58] [INFO ] [Nat]Added 205 Read/Feed constraints in 71 ms returned sat
[2023-03-16 06:08:58] [INFO ] Computed and/alt/rep : 1056/1992/1056 causal constraints (skipped 60 transitions) in 73 ms.
[2023-03-16 06:09:03] [INFO ] Deduced a trap composed of 2 places in 906 ms of which 3 ms to minimize.
[2023-03-16 06:09:03] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 9
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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [6, 180, 6, 6, 6, 6, 1, 1, 1, 1] Max seen :[6, 3, 6, 6, 6, 6, 0, 0, 0, 0]
FORMULA Peterson-PT-5-UpperBounds-07 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-06 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-05 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-04 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Peterson-PT-5-UpperBounds-02 6 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 183 out of 834 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 834/834 places, 1242/1242 transitions.
Drop transitions removed 147 transitions
Trivial Post-agglo rules discarded 147 transitions
Performed 147 trivial Post agglomeration. Transition count delta: 147
Iterating post reduction 0 with 147 rules applied. Total rules applied 147 place count 834 transition count 1095
Reduce places removed 147 places and 0 transitions.
Performed 149 Post agglomeration using F-continuation condition.Transition count delta: 149
Iterating post reduction 1 with 296 rules applied. Total rules applied 443 place count 687 transition count 946
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 2 with 149 rules applied. Total rules applied 592 place count 538 transition count 946
Performed 60 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 60 Pre rules applied. Total rules applied 592 place count 538 transition count 886
Deduced a syphon composed of 60 places in 3 ms
Reduce places removed 60 places and 0 transitions.
Iterating global reduction 3 with 120 rules applied. Total rules applied 712 place count 478 transition count 886
Applied a total of 712 rules in 224 ms. Remains 478 /834 variables (removed 356) and now considering 886/1242 (removed 356) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 478/834 places, 886/1242 transitions.
Normalized transition count is 766 out of 886 initially.
// Phase 1: matrix 766 rows 478 cols
[2023-03-16 06:09:03] [INFO ] Computed 23 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4369 ms. (steps per millisecond=228 ) properties (out of 5) seen :6
FORMULA Peterson-PT-5-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2971 ms. (steps per millisecond=336 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 4) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 881 ms. (steps per millisecond=1135 ) properties (out of 4) seen :5
FORMULA Peterson-PT-5-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2023-03-16 06:09:12] [INFO ] Flow matrix only has 766 transitions (discarded 120 similar events)
// Phase 1: matrix 766 rows 478 cols
[2023-03-16 06:09:12] [INFO ] Computed 23 place invariants in 4 ms
[2023-03-16 06:09:12] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-16 06:09:12] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-16 06:09:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:09:12] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2023-03-16 06:09:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:09:13] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-16 06:09:13] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-16 06:09:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:09:13] [INFO ] [Nat]Absence check using state equation in 250 ms returned sat
[2023-03-16 06:09:13] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:09:13] [INFO ] [Nat]Added 205 Read/Feed constraints in 83 ms returned sat
[2023-03-16 06:09:13] [INFO ] Deduced a trap composed of 33 places in 357 ms of which 1 ms to minimize.
[2023-03-16 06:09:14] [INFO ] Deduced a trap composed of 9 places in 388 ms of which 1 ms to minimize.
[2023-03-16 06:09:14] [INFO ] Deduced a trap composed of 41 places in 431 ms of which 1 ms to minimize.
[2023-03-16 06:09:15] [INFO ] Deduced a trap composed of 25 places in 476 ms of which 2 ms to minimize.
[2023-03-16 06:09:15] [INFO ] Deduced a trap composed of 9 places in 512 ms of which 1 ms to minimize.
[2023-03-16 06:09:16] [INFO ] Deduced a trap composed of 9 places in 499 ms of which 1 ms to minimize.
[2023-03-16 06:09:16] [INFO ] Deduced a trap composed of 51 places in 483 ms of which 1 ms to minimize.
[2023-03-16 06:09:17] [INFO ] Deduced a trap composed of 49 places in 483 ms of which 1 ms to minimize.
[2023-03-16 06:09:18] [INFO ] Deduced a trap composed of 11 places in 508 ms of which 1 ms to minimize.
[2023-03-16 06:09:18] [INFO ] Deduced a trap composed of 39 places in 483 ms of which 1 ms to minimize.
[2023-03-16 06:09:19] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 2 ms to minimize.
[2023-03-16 06:09:19] [INFO ] Deduced a trap composed of 25 places in 403 ms of which 1 ms to minimize.
[2023-03-16 06:09:19] [INFO ] Deduced a trap composed of 53 places in 407 ms of which 1 ms to minimize.
[2023-03-16 06:09:20] [INFO ] Deduced a trap composed of 49 places in 351 ms of which 1 ms to minimize.
[2023-03-16 06:09:20] [INFO ] Deduced a trap composed of 49 places in 369 ms of which 1 ms to minimize.
[2023-03-16 06:09:21] [INFO ] Deduced a trap composed of 63 places in 223 ms of which 0 ms to minimize.
[2023-03-16 06:09:21] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 7634 ms
[2023-03-16 06:09:21] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 85 ms.
[2023-03-16 06:09:25] [INFO ] Added : 206 causal constraints over 42 iterations in 3913 ms. Result :sat
Minimization took 419 ms.
[2023-03-16 06:09:25] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:09:25] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 06:09:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:09:26] [INFO ] [Real]Absence check using state equation in 388 ms returned sat
[2023-03-16 06:09:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:09:26] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:09:26] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 06:09:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:09:26] [INFO ] [Nat]Absence check using state equation in 365 ms returned sat
[2023-03-16 06:09:26] [INFO ] [Nat]Added 205 Read/Feed constraints in 54 ms returned sat
[2023-03-16 06:09:26] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 84 ms.
[2023-03-16 06:09:29] [INFO ] Deduced a trap composed of 13 places in 407 ms of which 1 ms to minimize.
[2023-03-16 06:09:30] [INFO ] Deduced a trap composed of 31 places in 275 ms of which 1 ms to minimize.
[2023-03-16 06:09:30] [INFO ] Deduced a trap composed of 82 places in 305 ms of which 1 ms to minimize.
[2023-03-16 06:09:30] [INFO ] Deduced a trap composed of 45 places in 278 ms of which 0 ms to minimize.
[2023-03-16 06:09:31] [INFO ] Deduced a trap composed of 61 places in 251 ms of which 1 ms to minimize.
[2023-03-16 06:09:31] [INFO ] Deduced a trap composed of 70 places in 308 ms of which 1 ms to minimize.
[2023-03-16 06:09:32] [INFO ] Deduced a trap composed of 17 places in 324 ms of which 1 ms to minimize.
[2023-03-16 06:09:32] [INFO ] Deduced a trap composed of 37 places in 327 ms of which 1 ms to minimize.
[2023-03-16 06:09:32] [INFO ] Deduced a trap composed of 19 places in 312 ms of which 1 ms to minimize.
[2023-03-16 06:09:33] [INFO ] Deduced a trap composed of 44 places in 222 ms of which 0 ms to minimize.
[2023-03-16 06:09:33] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 1 ms to minimize.
[2023-03-16 06:09:33] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 4342 ms
[2023-03-16 06:09:34] [INFO ] Added : 177 causal constraints over 37 iterations in 7379 ms. Result :sat
Minimization took 324 ms.
[2023-03-16 06:09:34] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-16 06:09:34] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-16 06:09:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:09:35] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-16 06:09:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:09:35] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:09:35] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-16 06:09:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:09:35] [INFO ] [Nat]Absence check using state equation in 347 ms returned sat
[2023-03-16 06:09:35] [INFO ] [Nat]Added 205 Read/Feed constraints in 41 ms returned sat
[2023-03-16 06:09:35] [INFO ] Computed and/alt/rep : 700/1756/700 causal constraints (skipped 60 transitions) in 86 ms.
[2023-03-16 06:09:37] [INFO ] Deduced a trap composed of 27 places in 286 ms of which 1 ms to minimize.
[2023-03-16 06:09:37] [INFO ] Deduced a trap composed of 11 places in 304 ms of which 1 ms to minimize.
[2023-03-16 06:09:38] [INFO ] Deduced a trap composed of 53 places in 383 ms of which 2 ms to minimize.
[2023-03-16 06:09:38] [INFO ] Deduced a trap composed of 41 places in 327 ms of which 4 ms to minimize.
[2023-03-16 06:09:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1732 ms
[2023-03-16 06:09:39] [INFO ] Added : 108 causal constraints over 23 iterations in 3413 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 478 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 478/478 places, 886/886 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 478 transition count 885
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 477 transition count 884
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 476 transition count 884
Applied a total of 4 rules in 50 ms. Remains 476 /478 variables (removed 2) and now considering 884/886 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 476/478 places, 884/886 transitions.
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 476 cols
[2023-03-16 06:09:40] [INFO ] Computed 23 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4128 ms. (steps per millisecond=242 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2986 ms. (steps per millisecond=334 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 946 ms. (steps per millisecond=1057 ) properties (out of 3) seen :5
[2023-03-16 06:09:49] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 476 cols
[2023-03-16 06:09:49] [INFO ] Computed 23 place invariants in 9 ms
[2023-03-16 06:09:49] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-16 06:09:49] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-16 06:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:09:49] [INFO ] [Real]Absence check using state equation in 380 ms returned sat
[2023-03-16 06:09:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:09:50] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:09:50] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 06:09:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:09:50] [INFO ] [Nat]Absence check using state equation in 395 ms returned sat
[2023-03-16 06:09:50] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:09:50] [INFO ] [Nat]Added 205 Read/Feed constraints in 145 ms returned sat
[2023-03-16 06:09:51] [INFO ] Deduced a trap composed of 9 places in 430 ms of which 1 ms to minimize.
[2023-03-16 06:09:51] [INFO ] Deduced a trap composed of 13 places in 481 ms of which 1 ms to minimize.
[2023-03-16 06:09:52] [INFO ] Deduced a trap composed of 13 places in 493 ms of which 1 ms to minimize.
[2023-03-16 06:09:52] [INFO ] Deduced a trap composed of 11 places in 487 ms of which 1 ms to minimize.
[2023-03-16 06:09:53] [INFO ] Deduced a trap composed of 29 places in 523 ms of which 1 ms to minimize.
[2023-03-16 06:09:53] [INFO ] Deduced a trap composed of 19 places in 472 ms of which 1 ms to minimize.
[2023-03-16 06:09:54] [INFO ] Deduced a trap composed of 11 places in 481 ms of which 1 ms to minimize.
[2023-03-16 06:09:55] [INFO ] Deduced a trap composed of 46 places in 481 ms of which 1 ms to minimize.
[2023-03-16 06:09:55] [INFO ] Deduced a trap composed of 17 places in 500 ms of which 1 ms to minimize.
[2023-03-16 06:09:56] [INFO ] Deduced a trap composed of 50 places in 489 ms of which 1 ms to minimize.
[2023-03-16 06:09:56] [INFO ] Deduced a trap composed of 57 places in 444 ms of which 1 ms to minimize.
[2023-03-16 06:09:57] [INFO ] Deduced a trap composed of 27 places in 451 ms of which 2 ms to minimize.
[2023-03-16 06:09:57] [INFO ] Deduced a trap composed of 11 places in 458 ms of which 1 ms to minimize.
[2023-03-16 06:09:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6966 ms
[2023-03-16 06:09:57] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 89 ms.
[2023-03-16 06:10:00] [INFO ] Deduced a trap composed of 25 places in 389 ms of which 1 ms to minimize.
[2023-03-16 06:10:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 523 ms
[2023-03-16 06:10:01] [INFO ] Added : 173 causal constraints over 36 iterations in 3426 ms. Result :sat
Minimization took 409 ms.
[2023-03-16 06:10:01] [INFO ] [Real]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:10:01] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 06:10:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:02] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2023-03-16 06:10:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:10:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:10:02] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 06:10:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:02] [INFO ] [Nat]Absence check using state equation in 385 ms returned sat
[2023-03-16 06:10:02] [INFO ] [Nat]Added 205 Read/Feed constraints in 54 ms returned sat
[2023-03-16 06:10:03] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 88 ms.
[2023-03-16 06:10:05] [INFO ] Deduced a trap composed of 42 places in 272 ms of which 1 ms to minimize.
[2023-03-16 06:10:05] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 2 ms to minimize.
[2023-03-16 06:10:05] [INFO ] Deduced a trap composed of 17 places in 310 ms of which 1 ms to minimize.
[2023-03-16 06:10:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1194 ms
[2023-03-16 06:10:06] [INFO ] Added : 132 causal constraints over 28 iterations in 3326 ms. Result :sat
Minimization took 222 ms.
[2023-03-16 06:10:06] [INFO ] [Real]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-16 06:10:06] [INFO ] [Real]Absence check using 17 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-16 06:10:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:07] [INFO ] [Real]Absence check using state equation in 368 ms returned sat
[2023-03-16 06:10:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:10:07] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-16 06:10:07] [INFO ] [Nat]Absence check using 17 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-16 06:10:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:07] [INFO ] [Nat]Absence check using state equation in 400 ms returned sat
[2023-03-16 06:10:07] [INFO ] [Nat]Added 205 Read/Feed constraints in 48 ms returned sat
[2023-03-16 06:10:07] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 82 ms.
[2023-03-16 06:10:10] [INFO ] Deduced a trap composed of 43 places in 406 ms of which 1 ms to minimize.
[2023-03-16 06:10:10] [INFO ] Deduced a trap composed of 11 places in 378 ms of which 2 ms to minimize.
[2023-03-16 06:10:11] [INFO ] Deduced a trap composed of 69 places in 366 ms of which 1 ms to minimize.
[2023-03-16 06:10:11] [INFO ] Deduced a trap composed of 19 places in 337 ms of which 1 ms to minimize.
[2023-03-16 06:10:12] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2023-03-16 06:10:12] [INFO ] Deduced a trap composed of 25 places in 355 ms of which 1 ms to minimize.
[2023-03-16 06:10:13] [INFO ] Deduced a trap composed of 33 places in 365 ms of which 0 ms to minimize.
[2023-03-16 06:10:13] [INFO ] Deduced a trap composed of 13 places in 354 ms of which 1 ms to minimize.
[2023-03-16 06:10:13] [INFO ] Deduced a trap composed of 19 places in 333 ms of which 1 ms to minimize.
[2023-03-16 06:10:14] [INFO ] Deduced a trap composed of 13 places in 317 ms of which 1 ms to minimize.
[2023-03-16 06:10:14] [INFO ] Deduced a trap composed of 34 places in 347 ms of which 1 ms to minimize.
[2023-03-16 06:10:15] [INFO ] Deduced a trap composed of 84 places in 308 ms of which 1 ms to minimize.
[2023-03-16 06:10:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5504 ms
[2023-03-16 06:10:15] [INFO ] Added : 127 causal constraints over 26 iterations in 7864 ms. Result :sat
Minimization took 330 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 884/884 transitions.
Applied a total of 0 rules in 27 ms. Remains 476 /476 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 476/476 places, 884/884 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 884/884 transitions.
Applied a total of 0 rules in 24 ms. Remains 476 /476 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2023-03-16 06:10:17] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
[2023-03-16 06:10:17] [INFO ] Invariant cache hit.
[2023-03-16 06:10:17] [INFO ] Implicit Places using invariants in 544 ms returned [440, 452, 453, 454, 455, 456]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 549 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 470/476 places, 884/884 transitions.
Applied a total of 0 rules in 34 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 609 ms. Remains : 470/476 places, 884/884 transitions.
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-16 06:10:17] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 4832 ms. (steps per millisecond=206 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3015 ms. (steps per millisecond=331 ) properties (out of 3) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 891 ms. (steps per millisecond=1122 ) properties (out of 3) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 3) seen :5
[2023-03-16 06:10:27] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-16 06:10:27] [INFO ] Computed 17 place invariants in 7 ms
[2023-03-16 06:10:27] [INFO ] [Real]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-16 06:10:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:27] [INFO ] [Real]Absence check using state equation in 296 ms returned sat
[2023-03-16 06:10:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:10:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 23 ms returned sat
[2023-03-16 06:10:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:28] [INFO ] [Nat]Absence check using state equation in 398 ms returned sat
[2023-03-16 06:10:28] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:10:28] [INFO ] [Nat]Added 205 Read/Feed constraints in 144 ms returned sat
[2023-03-16 06:10:29] [INFO ] Deduced a trap composed of 39 places in 468 ms of which 2 ms to minimize.
[2023-03-16 06:10:29] [INFO ] Deduced a trap composed of 57 places in 482 ms of which 1 ms to minimize.
[2023-03-16 06:10:30] [INFO ] Deduced a trap composed of 27 places in 451 ms of which 1 ms to minimize.
[2023-03-16 06:10:30] [INFO ] Deduced a trap composed of 46 places in 483 ms of which 5 ms to minimize.
[2023-03-16 06:10:31] [INFO ] Deduced a trap composed of 37 places in 423 ms of which 1 ms to minimize.
[2023-03-16 06:10:31] [INFO ] Deduced a trap composed of 27 places in 466 ms of which 2 ms to minimize.
[2023-03-16 06:10:32] [INFO ] Deduced a trap composed of 17 places in 473 ms of which 1 ms to minimize.
[2023-03-16 06:10:32] [INFO ] Deduced a trap composed of 49 places in 466 ms of which 1 ms to minimize.
[2023-03-16 06:10:33] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2023-03-16 06:10:33] [INFO ] Deduced a trap composed of 9 places in 440 ms of which 1 ms to minimize.
[2023-03-16 06:10:34] [INFO ] Deduced a trap composed of 49 places in 446 ms of which 1 ms to minimize.
[2023-03-16 06:10:34] [INFO ] Deduced a trap composed of 13 places in 480 ms of which 2 ms to minimize.
[2023-03-16 06:10:35] [INFO ] Deduced a trap composed of 25 places in 471 ms of which 1 ms to minimize.
[2023-03-16 06:10:35] [INFO ] Deduced a trap composed of 53 places in 485 ms of which 1 ms to minimize.
[2023-03-16 06:10:36] [INFO ] Deduced a trap composed of 45 places in 473 ms of which 1 ms to minimize.
[2023-03-16 06:10:36] [INFO ] Deduced a trap composed of 33 places in 410 ms of which 1 ms to minimize.
[2023-03-16 06:10:37] [INFO ] Deduced a trap composed of 55 places in 244 ms of which 1 ms to minimize.
[2023-03-16 06:10:37] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8595 ms
[2023-03-16 06:10:37] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 85 ms.
[2023-03-16 06:10:41] [INFO ] Deduced a trap composed of 11 places in 465 ms of which 1 ms to minimize.
[2023-03-16 06:10:42] [INFO ] Deduced a trap composed of 25 places in 468 ms of which 1 ms to minimize.
[2023-03-16 06:10:42] [INFO ] Deduced a trap composed of 90 places in 465 ms of which 1 ms to minimize.
[2023-03-16 06:10:43] [INFO ] Deduced a trap composed of 51 places in 476 ms of which 1 ms to minimize.
[2023-03-16 06:10:43] [INFO ] Deduced a trap composed of 47 places in 473 ms of which 1 ms to minimize.
[2023-03-16 06:10:44] [INFO ] Deduced a trap composed of 53 places in 478 ms of which 1 ms to minimize.
[2023-03-16 06:10:45] [INFO ] Deduced a trap composed of 61 places in 488 ms of which 1 ms to minimize.
[2023-03-16 06:10:45] [INFO ] Deduced a trap composed of 19 places in 472 ms of which 1 ms to minimize.
[2023-03-16 06:10:46] [INFO ] Deduced a trap composed of 11 places in 475 ms of which 1 ms to minimize.
[2023-03-16 06:10:46] [INFO ] Deduced a trap composed of 31 places in 499 ms of which 2 ms to minimize.
[2023-03-16 06:10:46] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5687 ms
[2023-03-16 06:10:47] [INFO ] Added : 216 causal constraints over 45 iterations in 9903 ms. Result :sat
Minimization took 523 ms.
[2023-03-16 06:10:47] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-16 06:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:48] [INFO ] [Real]Absence check using state equation in 366 ms returned sat
[2023-03-16 06:10:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:10:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-16 06:10:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:48] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2023-03-16 06:10:48] [INFO ] [Nat]Added 205 Read/Feed constraints in 53 ms returned sat
[2023-03-16 06:10:48] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 77 ms.
[2023-03-16 06:10:51] [INFO ] Deduced a trap composed of 11 places in 405 ms of which 1 ms to minimize.
[2023-03-16 06:10:52] [INFO ] Deduced a trap composed of 20 places in 412 ms of which 1 ms to minimize.
[2023-03-16 06:10:52] [INFO ] Deduced a trap composed of 25 places in 382 ms of which 1 ms to minimize.
[2023-03-16 06:10:53] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 1 ms to minimize.
[2023-03-16 06:10:53] [INFO ] Deduced a trap composed of 11 places in 367 ms of which 1 ms to minimize.
[2023-03-16 06:10:54] [INFO ] Deduced a trap composed of 13 places in 382 ms of which 0 ms to minimize.
[2023-03-16 06:10:54] [INFO ] Deduced a trap composed of 11 places in 373 ms of which 1 ms to minimize.
[2023-03-16 06:10:55] [INFO ] Deduced a trap composed of 11 places in 376 ms of which 1 ms to minimize.
[2023-03-16 06:10:55] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 1 ms to minimize.
[2023-03-16 06:10:55] [INFO ] Deduced a trap composed of 37 places in 341 ms of which 1 ms to minimize.
[2023-03-16 06:10:56] [INFO ] Deduced a trap composed of 39 places in 346 ms of which 1 ms to minimize.
[2023-03-16 06:10:56] [INFO ] Deduced a trap composed of 55 places in 293 ms of which 1 ms to minimize.
[2023-03-16 06:10:57] [INFO ] Deduced a trap composed of 70 places in 285 ms of which 1 ms to minimize.
[2023-03-16 06:10:57] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 6000 ms
[2023-03-16 06:10:57] [INFO ] Added : 161 causal constraints over 34 iterations in 8957 ms. Result :sat
Minimization took 262 ms.
[2023-03-16 06:10:58] [INFO ] [Real]Absence check using 17 positive place invariants in 22 ms returned sat
[2023-03-16 06:10:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:58] [INFO ] [Real]Absence check using state equation in 367 ms returned sat
[2023-03-16 06:10:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:10:58] [INFO ] [Nat]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-16 06:10:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:10:59] [INFO ] [Nat]Absence check using state equation in 240 ms returned sat
[2023-03-16 06:10:59] [INFO ] [Nat]Added 205 Read/Feed constraints in 36 ms returned sat
[2023-03-16 06:10:59] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 74 ms.
[2023-03-16 06:11:01] [INFO ] Deduced a trap composed of 33 places in 413 ms of which 1 ms to minimize.
[2023-03-16 06:11:02] [INFO ] Deduced a trap composed of 45 places in 360 ms of which 1 ms to minimize.
[2023-03-16 06:11:02] [INFO ] Deduced a trap composed of 11 places in 364 ms of which 1 ms to minimize.
[2023-03-16 06:11:03] [INFO ] Deduced a trap composed of 39 places in 372 ms of which 1 ms to minimize.
[2023-03-16 06:11:03] [INFO ] Deduced a trap composed of 13 places in 359 ms of which 0 ms to minimize.
[2023-03-16 06:11:04] [INFO ] Deduced a trap composed of 13 places in 352 ms of which 1 ms to minimize.
[2023-03-16 06:11:04] [INFO ] Deduced a trap composed of 13 places in 356 ms of which 1 ms to minimize.
[2023-03-16 06:11:05] [INFO ] Deduced a trap composed of 27 places in 326 ms of which 1 ms to minimize.
[2023-03-16 06:11:05] [INFO ] Deduced a trap composed of 27 places in 364 ms of which 1 ms to minimize.
[2023-03-16 06:11:05] [INFO ] Deduced a trap composed of 31 places in 333 ms of which 1 ms to minimize.
[2023-03-16 06:11:06] [INFO ] Deduced a trap composed of 45 places in 285 ms of which 1 ms to minimize.
[2023-03-16 06:11:06] [INFO ] Deduced a trap composed of 25 places in 352 ms of which 1 ms to minimize.
[2023-03-16 06:11:07] [INFO ] Deduced a trap composed of 41 places in 274 ms of which 1 ms to minimize.
[2023-03-16 06:11:07] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 5802 ms
[2023-03-16 06:11:07] [INFO ] Added : 160 causal constraints over 32 iterations in 8615 ms. Result :sat
Minimization took 427 ms.
Current structural bounds on expressions (after SMT) : [180, 1, 1] Max seen :[5, 0, 0]
Support contains 182 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 884/884 transitions.
Applied a total of 0 rules in 21 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 470/470 places, 884/884 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 884/884 transitions.
Applied a total of 0 rules in 21 ms. Remains 470 /470 variables (removed 0) and now considering 884/884 (removed 0) transitions.
[2023-03-16 06:11:09] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
[2023-03-16 06:11:09] [INFO ] Invariant cache hit.
[2023-03-16 06:11:10] [INFO ] Implicit Places using invariants in 478 ms returned []
[2023-03-16 06:11:10] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
[2023-03-16 06:11:10] [INFO ] Invariant cache hit.
[2023-03-16 06:11:10] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:11:12] [INFO ] Implicit Places using invariants and state equation in 2625 ms returned []
Implicit Place search using SMT with State Equation took 3108 ms to find 0 implicit places.
[2023-03-16 06:11:12] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-16 06:11:12] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
[2023-03-16 06:11:12] [INFO ] Invariant cache hit.
[2023-03-16 06:11:13] [INFO ] Dead Transitions using invariants and state equation in 1022 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4244 ms. Remains : 470/470 places, 884/884 transitions.
Starting property specific reduction for Peterson-PT-5-UpperBounds-03
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-16 06:11:13] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :1
[2023-03-16 06:11:13] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-16 06:11:13] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-16 06:11:14] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-16 06:11:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:11:14] [INFO ] [Real]Absence check using state equation in 345 ms returned sat
[2023-03-16 06:11:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:11:14] [INFO ] [Nat]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-16 06:11:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:11:15] [INFO ] [Nat]Absence check using state equation in 396 ms returned sat
[2023-03-16 06:11:15] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:11:15] [INFO ] [Nat]Added 205 Read/Feed constraints in 134 ms returned sat
[2023-03-16 06:11:15] [INFO ] Deduced a trap composed of 39 places in 446 ms of which 1 ms to minimize.
[2023-03-16 06:11:16] [INFO ] Deduced a trap composed of 57 places in 457 ms of which 1 ms to minimize.
[2023-03-16 06:11:16] [INFO ] Deduced a trap composed of 27 places in 481 ms of which 1 ms to minimize.
[2023-03-16 06:11:17] [INFO ] Deduced a trap composed of 46 places in 460 ms of which 1 ms to minimize.
[2023-03-16 06:11:17] [INFO ] Deduced a trap composed of 37 places in 455 ms of which 1 ms to minimize.
[2023-03-16 06:11:18] [INFO ] Deduced a trap composed of 27 places in 470 ms of which 2 ms to minimize.
[2023-03-16 06:11:18] [INFO ] Deduced a trap composed of 17 places in 464 ms of which 1 ms to minimize.
[2023-03-16 06:11:19] [INFO ] Deduced a trap composed of 49 places in 476 ms of which 1 ms to minimize.
[2023-03-16 06:11:19] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2023-03-16 06:11:19] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 884/884 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 470 transition count 882
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 468 transition count 882
Applied a total of 4 rules in 44 ms. Remains 468 /470 variables (removed 2) and now considering 882/884 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 468/470 places, 882/884 transitions.
Normalized transition count is 762 out of 882 initially.
// Phase 1: matrix 762 rows 468 cols
[2023-03-16 06:11:19] [INFO ] Computed 17 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 5088 ms. (steps per millisecond=196 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 3015 ms. (steps per millisecond=331 ) properties (out of 1) seen :5
[2023-03-16 06:11:27] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
// Phase 1: matrix 762 rows 468 cols
[2023-03-16 06:11:27] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-16 06:11:28] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-16 06:11:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:11:28] [INFO ] [Real]Absence check using state equation in 382 ms returned sat
[2023-03-16 06:11:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:11:28] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:11:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:11:29] [INFO ] [Nat]Absence check using state equation in 381 ms returned sat
[2023-03-16 06:11:29] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:11:29] [INFO ] [Nat]Added 205 Read/Feed constraints in 87 ms returned sat
[2023-03-16 06:11:29] [INFO ] Deduced a trap composed of 23 places in 290 ms of which 0 ms to minimize.
[2023-03-16 06:11:30] [INFO ] Deduced a trap composed of 25 places in 452 ms of which 1 ms to minimize.
[2023-03-16 06:11:30] [INFO ] Deduced a trap composed of 17 places in 487 ms of which 1 ms to minimize.
[2023-03-16 06:11:31] [INFO ] Deduced a trap composed of 45 places in 482 ms of which 1 ms to minimize.
[2023-03-16 06:11:31] [INFO ] Deduced a trap composed of 11 places in 460 ms of which 1 ms to minimize.
[2023-03-16 06:11:32] [INFO ] Deduced a trap composed of 11 places in 477 ms of which 1 ms to minimize.
[2023-03-16 06:11:32] [INFO ] Deduced a trap composed of 11 places in 485 ms of which 2 ms to minimize.
[2023-03-16 06:11:33] [INFO ] Deduced a trap composed of 11 places in 468 ms of which 1 ms to minimize.
[2023-03-16 06:11:33] [INFO ] Deduced a trap composed of 11 places in 472 ms of which 1 ms to minimize.
[2023-03-16 06:11:34] [INFO ] Deduced a trap composed of 58 places in 464 ms of which 1 ms to minimize.
[2023-03-16 06:11:34] [INFO ] Deduced a trap composed of 11 places in 464 ms of which 1 ms to minimize.
[2023-03-16 06:11:35] [INFO ] Deduced a trap composed of 33 places in 439 ms of which 1 ms to minimize.
[2023-03-16 06:11:35] [INFO ] Deduced a trap composed of 78 places in 441 ms of which 1 ms to minimize.
[2023-03-16 06:11:36] [INFO ] Deduced a trap composed of 49 places in 393 ms of which 1 ms to minimize.
[2023-03-16 06:11:36] [INFO ] Deduced a trap composed of 91 places in 316 ms of which 1 ms to minimize.
[2023-03-16 06:11:36] [INFO ] Deduced a trap composed of 77 places in 309 ms of which 0 ms to minimize.
[2023-03-16 06:11:37] [INFO ] Deduced a trap composed of 71 places in 318 ms of which 1 ms to minimize.
[2023-03-16 06:11:37] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 8092 ms
[2023-03-16 06:11:37] [INFO ] Computed and/alt/rep : 696/1752/696 causal constraints (skipped 60 transitions) in 83 ms.
[2023-03-16 06:11:40] [INFO ] Deduced a trap composed of 78 places in 376 ms of which 2 ms to minimize.
[2023-03-16 06:11:41] [INFO ] Deduced a trap composed of 27 places in 389 ms of which 1 ms to minimize.
[2023-03-16 06:11:41] [INFO ] Deduced a trap composed of 82 places in 366 ms of which 1 ms to minimize.
[2023-03-16 06:11:42] [INFO ] Deduced a trap composed of 34 places in 338 ms of which 1 ms to minimize.
[2023-03-16 06:11:42] [INFO ] Deduced a trap composed of 95 places in 253 ms of which 1 ms to minimize.
[2023-03-16 06:11:42] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2626 ms
[2023-03-16 06:11:43] [INFO ] Added : 165 causal constraints over 34 iterations in 5691 ms. Result :sat
Minimization took 361 ms.
Current structural bounds on expressions (after SMT) : [180] Max seen :[5]
Support contains 180 out of 468 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 27 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 468/468 places, 882/882 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 468/468 places, 882/882 transitions.
Applied a total of 0 rules in 25 ms. Remains 468 /468 variables (removed 0) and now considering 882/882 (removed 0) transitions.
[2023-03-16 06:11:43] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-16 06:11:43] [INFO ] Invariant cache hit.
[2023-03-16 06:11:44] [INFO ] Implicit Places using invariants in 597 ms returned []
[2023-03-16 06:11:44] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-16 06:11:44] [INFO ] Invariant cache hit.
[2023-03-16 06:11:44] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:11:46] [INFO ] Implicit Places using invariants and state equation in 2719 ms returned []
Implicit Place search using SMT with State Equation took 3324 ms to find 0 implicit places.
[2023-03-16 06:11:46] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-16 06:11:46] [INFO ] Flow matrix only has 762 transitions (discarded 120 similar events)
[2023-03-16 06:11:46] [INFO ] Invariant cache hit.
[2023-03-16 06:11:47] [INFO ] Dead Transitions using invariants and state equation in 1040 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4420 ms. Remains : 468/468 places, 882/882 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-03 in 34186 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-08
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-16 06:11:48] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-16 06:11:48] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-16 06:11:48] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-16 06:11:48] [INFO ] [Real]Absence check using 17 positive place invariants in 25 ms returned sat
[2023-03-16 06:11:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:11:48] [INFO ] [Real]Absence check using state equation in 387 ms returned sat
[2023-03-16 06:11:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:11:48] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:11:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:11:49] [INFO ] [Nat]Absence check using state equation in 349 ms returned sat
[2023-03-16 06:11:49] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:11:49] [INFO ] [Nat]Added 205 Read/Feed constraints in 37 ms returned sat
[2023-03-16 06:11:49] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 55 ms.
[2023-03-16 06:11:51] [INFO ] Deduced a trap composed of 11 places in 388 ms of which 2 ms to minimize.
[2023-03-16 06:11:52] [INFO ] Deduced a trap composed of 20 places in 364 ms of which 1 ms to minimize.
[2023-03-16 06:11:52] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 1 ms to minimize.
[2023-03-16 06:11:53] [INFO ] Deduced a trap composed of 27 places in 349 ms of which 1 ms to minimize.
[2023-03-16 06:11:53] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 1 ms to minimize.
[2023-03-16 06:11:53] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 2248 ms
[2023-03-16 06:11:54] [INFO ] Deduced a trap composed of 2 places in 521 ms of which 1 ms to minimize.
[2023-03-16 06:11:54] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 470 places. Attempting structural reductions.
Drop transitions removed 2 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 882/882 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 57 rules applied. Total rules applied 57 place count 469 transition count 825
Reduce places removed 57 places and 2 transitions.
Iterating post reduction 1 with 57 rules applied. Total rules applied 114 place count 412 transition count 823
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 115 place count 411 transition count 822
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 116 place count 410 transition count 820
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 117 place count 409 transition count 819
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 123 Pre rules applied. Total rules applied 117 place count 409 transition count 696
Deduced a syphon composed of 123 places in 1 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 5 with 246 rules applied. Total rules applied 363 place count 286 transition count 696
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 5 with 58 rules applied. Total rules applied 421 place count 257 transition count 667
Applied a total of 421 rules in 80 ms. Remains 257 /470 variables (removed 213) and now considering 667/882 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 257/470 places, 667/882 transitions.
Normalized transition count is 547 out of 667 initially.
// Phase 1: matrix 547 rows 257 cols
[2023-03-16 06:11:54] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1769 ms. (steps per millisecond=565 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 528 ms. (steps per millisecond=1893 ) properties (out of 1) seen :0
[2023-03-16 06:11:56] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-16 06:11:56] [INFO ] Computed 17 place invariants in 2 ms
[2023-03-16 06:11:56] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 06:11:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:11:56] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-16 06:11:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:11:56] [INFO ] [Nat]Absence check using 17 positive place invariants in 17 ms returned sat
[2023-03-16 06:11:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:11:57] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2023-03-16 06:11:57] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-16 06:11:57] [INFO ] [Nat]Added 202 Read/Feed constraints in 40 ms returned sat
[2023-03-16 06:11:57] [INFO ] Computed and/alt/rep : 481/1533/481 causal constraints (skipped 60 transitions) in 57 ms.
[2023-03-16 06:11:58] [INFO ] Deduced a trap composed of 25 places in 242 ms of which 1 ms to minimize.
[2023-03-16 06:11:58] [INFO ] Deduced a trap composed of 16 places in 222 ms of which 1 ms to minimize.
[2023-03-16 06:11:58] [INFO ] Deduced a trap composed of 10 places in 219 ms of which 1 ms to minimize.
[2023-03-16 06:11:58] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 855 ms
[2023-03-16 06:11:58] [INFO ] Added : 61 causal constraints over 13 iterations in 1665 ms. Result :sat
Minimization took 132 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 20 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 18 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2023-03-16 06:11:59] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-16 06:11:59] [INFO ] Invariant cache hit.
[2023-03-16 06:11:59] [INFO ] Implicit Places using invariants in 514 ms returned []
[2023-03-16 06:11:59] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-16 06:11:59] [INFO ] Invariant cache hit.
[2023-03-16 06:12:00] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-16 06:12:01] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 2034 ms to find 0 implicit places.
[2023-03-16 06:12:01] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 06:12:01] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-16 06:12:01] [INFO ] Invariant cache hit.
[2023-03-16 06:12:02] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2898 ms. Remains : 257/257 places, 667/667 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-08 in 14114 ms.
Starting property specific reduction for Peterson-PT-5-UpperBounds-12
Normalized transition count is 764 out of 884 initially.
// Phase 1: matrix 764 rows 470 cols
[2023-03-16 06:12:02] [INFO ] Computed 17 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-16 06:12:02] [INFO ] Flow matrix only has 764 transitions (discarded 120 similar events)
// Phase 1: matrix 764 rows 470 cols
[2023-03-16 06:12:02] [INFO ] Computed 17 place invariants in 3 ms
[2023-03-16 06:12:02] [INFO ] [Real]Absence check using 17 positive place invariants in 15 ms returned sat
[2023-03-16 06:12:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:12:02] [INFO ] [Real]Absence check using state equation in 271 ms returned sat
[2023-03-16 06:12:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:12:02] [INFO ] [Nat]Absence check using 17 positive place invariants in 24 ms returned sat
[2023-03-16 06:12:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:12:03] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2023-03-16 06:12:03] [INFO ] State equation strengthened by 205 read => feed constraints.
[2023-03-16 06:12:03] [INFO ] [Nat]Added 205 Read/Feed constraints in 59 ms returned sat
[2023-03-16 06:12:03] [INFO ] Computed and/alt/rep : 698/1754/698 causal constraints (skipped 60 transitions) in 74 ms.
[2023-03-16 06:12:06] [INFO ] Deduced a trap composed of 33 places in 407 ms of which 1 ms to minimize.
[2023-03-16 06:12:06] [INFO ] Deduced a trap composed of 45 places in 376 ms of which 1 ms to minimize.
[2023-03-16 06:12:06] [INFO ] Deduced a trap composed of 11 places in 372 ms of which 1 ms to minimize.
[2023-03-16 06:12:07] [INFO ] Deduced a trap composed of 39 places in 384 ms of which 1 ms to minimize.
[2023-03-16 06:12:07] [INFO ] Deduced a trap composed of 13 places in 372 ms of which 1 ms to minimize.
[2023-03-16 06:12:07] [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:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
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:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 470 places. Attempting structural reductions.
Drop transitions removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 883/883 transitions.
Reduce places removed 1 places and 2 transitions.
Drop transitions removed 55 transitions
Trivial Post-agglo rules discarded 55 transitions
Performed 55 trivial Post agglomeration. Transition count delta: 55
Iterating post reduction 0 with 56 rules applied. Total rules applied 56 place count 469 transition count 826
Reduce places removed 56 places and 1 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 112 place count 413 transition count 825
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 113 place count 412 transition count 823
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 114 place count 411 transition count 822
Reduce places removed 1 places and 2 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 115 place count 410 transition count 820
Reduce places removed 1 places and 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 116 place count 409 transition count 819
Performed 123 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 123 Pre rules applied. Total rules applied 116 place count 409 transition count 696
Deduced a syphon composed of 123 places in 0 ms
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 6 with 246 rules applied. Total rules applied 362 place count 286 transition count 696
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 6 with 58 rules applied. Total rules applied 420 place count 257 transition count 667
Applied a total of 420 rules in 76 ms. Remains 257 /470 variables (removed 213) and now considering 667/883 (removed 216) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 257/470 places, 667/883 transitions.
Normalized transition count is 547 out of 667 initially.
// Phase 1: matrix 547 rows 257 cols
[2023-03-16 06:12:08] [INFO ] Computed 17 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 1870 ms. (steps per millisecond=534 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 1) seen :0
[2023-03-16 06:12:10] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
// Phase 1: matrix 547 rows 257 cols
[2023-03-16 06:12:10] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-16 06:12:10] [INFO ] [Real]Absence check using 17 positive place invariants in 10 ms returned sat
[2023-03-16 06:12:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-16 06:12:10] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-16 06:12:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-16 06:12:10] [INFO ] [Nat]Absence check using 17 positive place invariants in 16 ms returned sat
[2023-03-16 06:12:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-16 06:12:11] [INFO ] [Nat]Absence check using state equation in 234 ms returned sat
[2023-03-16 06:12:11] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-16 06:12:11] [INFO ] [Nat]Added 202 Read/Feed constraints in 36 ms returned sat
[2023-03-16 06:12:11] [INFO ] Computed and/alt/rep : 481/1528/481 causal constraints (skipped 60 transitions) in 61 ms.
[2023-03-16 06:12:12] [INFO ] Deduced a trap composed of 16 places in 218 ms of which 1 ms to minimize.
[2023-03-16 06:12:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2023-03-16 06:12:12] [INFO ] Added : 66 causal constraints over 14 iterations in 1185 ms. Result :sat
Minimization took 144 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 16 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 257/257 places, 667/667 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 667/667 transitions.
Applied a total of 0 rules in 15 ms. Remains 257 /257 variables (removed 0) and now considering 667/667 (removed 0) transitions.
[2023-03-16 06:12:12] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-16 06:12:12] [INFO ] Invariant cache hit.
[2023-03-16 06:12:13] [INFO ] Implicit Places using invariants in 510 ms returned []
[2023-03-16 06:12:13] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-16 06:12:13] [INFO ] Invariant cache hit.
[2023-03-16 06:12:13] [INFO ] State equation strengthened by 202 read => feed constraints.
[2023-03-16 06:12:14] [INFO ] Implicit Places using invariants and state equation in 1424 ms returned []
Implicit Place search using SMT with State Equation took 1937 ms to find 0 implicit places.
[2023-03-16 06:12:14] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-16 06:12:14] [INFO ] Flow matrix only has 547 transitions (discarded 120 similar events)
[2023-03-16 06:12:14] [INFO ] Invariant cache hit.
[2023-03-16 06:12:15] [INFO ] Dead Transitions using invariants and state equation in 763 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2735 ms. Remains : 257/257 places, 667/667 transitions.
Ending property specific reduction for Peterson-PT-5-UpperBounds-12 in 13258 ms.
[2023-03-16 06:12:15] [INFO ] Flatten gal took : 212 ms
[2023-03-16 06:12:15] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 5 ms.
[2023-03-16 06:12:15] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 470 places, 884 transitions and 3100 arcs took 18 ms.
Total runtime 229471 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Peterson (PT), instance 5
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 470 places, 884 transitions, 3100 arcs.
Final Score: 31770.954
Took : 41 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4767444 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16098964 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Caught signal 15, terminating.

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="Peterson-PT-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Peterson-PT-5, 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 r267-smll-167863542100629"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-5.tgz
mv Peterson-PT-5 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 ;