fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r042-smll-165252095800501
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DES-PT-40a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
606.688 168408.00 195876.00 529.30 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r042-smll-165252095800501.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DES-PT-40a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095800501
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 324K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 15:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 29 15:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K May 9 07:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 07:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 9 07:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 07:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 83K May 10 09:33 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DES-PT-40a-UpperBounds-00
FORMULA_NAME DES-PT-40a-UpperBounds-01
FORMULA_NAME DES-PT-40a-UpperBounds-02
FORMULA_NAME DES-PT-40a-UpperBounds-03
FORMULA_NAME DES-PT-40a-UpperBounds-04
FORMULA_NAME DES-PT-40a-UpperBounds-05
FORMULA_NAME DES-PT-40a-UpperBounds-06
FORMULA_NAME DES-PT-40a-UpperBounds-07
FORMULA_NAME DES-PT-40a-UpperBounds-08
FORMULA_NAME DES-PT-40a-UpperBounds-09
FORMULA_NAME DES-PT-40a-UpperBounds-10
FORMULA_NAME DES-PT-40a-UpperBounds-11
FORMULA_NAME DES-PT-40a-UpperBounds-12
FORMULA_NAME DES-PT-40a-UpperBounds-13
FORMULA_NAME DES-PT-40a-UpperBounds-14
FORMULA_NAME DES-PT-40a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652763379009

Running Version 202205111006
[2022-05-17 04:56:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-17 04:56:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-17 04:56:21] [INFO ] Load time of PNML (sax parser for PT used): 152 ms
[2022-05-17 04:56:21] [INFO ] Transformed 274 places.
[2022-05-17 04:56:21] [INFO ] Transformed 231 transitions.
[2022-05-17 04:56:21] [INFO ] Found NUPN structural information;
[2022-05-17 04:56:21] [INFO ] Parsed PT model containing 274 places and 231 transitions in 334 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
// Phase 1: matrix 217 rows 274 cols
[2022-05-17 04:56:21] [INFO ] Computed 59 place invariants in 29 ms
Incomplete random walk after 10000 steps, including 224 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 16) seen :7
FORMULA DES-PT-40a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA DES-PT-40a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 43 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 45 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 42 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 41 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 9) seen :0
// Phase 1: matrix 217 rows 274 cols
[2022-05-17 04:56:21] [INFO ] Computed 59 place invariants in 7 ms
[2022-05-17 04:56:21] [INFO ] [Real]Absence check using 34 positive place invariants in 30 ms returned sat
[2022-05-17 04:56:21] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-17 04:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:22] [INFO ] [Real]Absence check using state equation in 221 ms returned sat
[2022-05-17 04:56:22] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-17 04:56:22] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 95 ms returned sat
[2022-05-17 04:56:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:22] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2022-05-17 04:56:22] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-17 04:56:23] [INFO ] [Nat]Added 1 Read/Feed constraints in 133 ms returned sat
[2022-05-17 04:56:23] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 35 ms.
[2022-05-17 04:56:24] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 5 ms to minimize.
[2022-05-17 04:56:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2022-05-17 04:56:24] [INFO ] Added : 93 causal constraints over 20 iterations in 1071 ms. Result :sat
Minimization took 148 ms.
[2022-05-17 04:56:24] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-17 04:56:24] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-17 04:56:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:24] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-05-17 04:56:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:24] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-17 04:56:24] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 68 ms returned sat
[2022-05-17 04:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:25] [INFO ] [Nat]Absence check using state equation in 717 ms returned sat
[2022-05-17 04:56:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 04:56:25] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 23 ms.
[2022-05-17 04:56:26] [INFO ] Added : 106 causal constraints over 22 iterations in 824 ms. Result :sat
Minimization took 411 ms.
[2022-05-17 04:56:27] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2022-05-17 04:56:27] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2022-05-17 04:56:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:27] [INFO ] [Real]Absence check using state equation in 243 ms returned sat
[2022-05-17 04:56:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:27] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2022-05-17 04:56:27] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 143 ms returned sat
[2022-05-17 04:56:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:27] [INFO ] [Nat]Absence check using state equation in 319 ms returned sat
[2022-05-17 04:56:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 309 ms returned sat
[2022-05-17 04:56:28] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 26 ms.
[2022-05-17 04:56:28] [INFO ] Added : 83 causal constraints over 17 iterations in 486 ms. Result :sat
Minimization took 174 ms.
[2022-05-17 04:56:29] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2022-05-17 04:56:29] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2022-05-17 04:56:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:29] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2022-05-17 04:56:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:29] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-17 04:56:29] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 117 ms returned sat
[2022-05-17 04:56:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:30] [INFO ] [Nat]Absence check using state equation in 731 ms returned sat
[2022-05-17 04:56:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2022-05-17 04:56:30] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 24 ms.
[2022-05-17 04:56:30] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
[2022-05-17 04:56:31] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2022-05-17 04:56:31] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2022-05-17 04:56:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 344 ms
[2022-05-17 04:56:31] [INFO ] Added : 104 causal constraints over 21 iterations in 976 ms. Result :sat
Minimization took 308 ms.
[2022-05-17 04:56:31] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-17 04:56:31] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:56:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:31] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-17 04:56:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:31] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2022-05-17 04:56:32] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 106 ms returned sat
[2022-05-17 04:56:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:32] [INFO ] [Nat]Absence check using state equation in 912 ms returned sat
[2022-05-17 04:56:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 115 ms returned sat
[2022-05-17 04:56:33] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 2 ms to minimize.
[2022-05-17 04:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2022-05-17 04:56:33] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 21 ms.
[2022-05-17 04:56:33] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2022-05-17 04:56:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
[2022-05-17 04:56:34] [INFO ] Added : 114 causal constraints over 24 iterations in 835 ms. Result :sat
Minimization took 231 ms.
[2022-05-17 04:56:34] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-17 04:56:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:56:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:34] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2022-05-17 04:56:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 12 ms returned sat
[2022-05-17 04:56:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 123 ms returned sat
[2022-05-17 04:56:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:36] [INFO ] [Nat]Absence check using state equation in 1606 ms returned sat
[2022-05-17 04:56:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 154 ms returned sat
[2022-05-17 04:56:36] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 22 ms.
[2022-05-17 04:56:37] [INFO ] Added : 87 causal constraints over 18 iterations in 578 ms. Result :sat
Minimization took 99 ms.
[2022-05-17 04:56:37] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-17 04:56:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2022-05-17 04:56:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:37] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-17 04:56:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-17 04:56:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 179 ms returned sat
[2022-05-17 04:56:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:38] [INFO ] [Nat]Absence check using state equation in 663 ms returned sat
[2022-05-17 04:56:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 438 ms returned sat
[2022-05-17 04:56:38] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 19 ms.
[2022-05-17 04:56:39] [INFO ] Added : 111 causal constraints over 23 iterations in 697 ms. Result :sat
Minimization took 171 ms.
[2022-05-17 04:56:39] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-17 04:56:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:56:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:40] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2022-05-17 04:56:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2022-05-17 04:56:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 147 ms returned sat
[2022-05-17 04:56:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:40] [INFO ] [Nat]Absence check using state equation in 480 ms returned sat
[2022-05-17 04:56:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 17 ms returned sat
[2022-05-17 04:56:40] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 18 ms.
[2022-05-17 04:56:41] [INFO ] Added : 144 causal constraints over 29 iterations in 831 ms. Result :sat
Minimization took 239 ms.
[2022-05-17 04:56:42] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2022-05-17 04:56:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-17 04:56:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:42] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2022-05-17 04:56:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 16 ms returned sat
[2022-05-17 04:56:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 72 ms returned sat
[2022-05-17 04:56:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:42] [INFO ] [Nat]Absence check using state equation in 522 ms returned sat
[2022-05-17 04:56:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 126 ms returned sat
[2022-05-17 04:56:43] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 17 ms.
[2022-05-17 04:56:44] [INFO ] Added : 196 causal constraints over 40 iterations in 1140 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 274 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 274/274 places, 217/217 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 274 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 273 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 273 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 271 transition count 213
Applied a total of 12 rules in 125 ms. Remains 271 /274 variables (removed 3) and now considering 213/217 (removed 4) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/274 places, 213/217 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:56:46] [INFO ] Computed 60 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 13628 resets, run finished after 2382 ms. (steps per millisecond=419 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2283 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2262 resets, run finished after 1044 ms. (steps per millisecond=957 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2305 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2286 resets, run finished after 1036 ms. (steps per millisecond=965 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2324 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000000 steps, including 2274 resets, run finished after 1031 ms. (steps per millisecond=969 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2224 resets, run finished after 1032 ms. (steps per millisecond=968 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2241 resets, run finished after 1030 ms. (steps per millisecond=970 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2275 resets, run finished after 1017 ms. (steps per millisecond=983 ) properties (out of 9) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:56:58] [INFO ] Computed 60 place invariants in 8 ms
[2022-05-17 04:56:58] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 04:56:58] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2022-05-17 04:56:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:58] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2022-05-17 04:56:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:56:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 04:56:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 143 ms returned sat
[2022-05-17 04:56:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:56:59] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2022-05-17 04:56:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:56:59] [INFO ] [Nat]Added 2 Read/Feed constraints in 3 ms returned sat
[2022-05-17 04:56:59] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 22 ms.
[2022-05-17 04:56:59] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
[2022-05-17 04:57:00] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2022-05-17 04:57:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 247 ms
[2022-05-17 04:57:00] [INFO ] Added : 94 causal constraints over 19 iterations in 897 ms. Result :sat
Minimization took 153 ms.
[2022-05-17 04:57:00] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 04:57:00] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-17 04:57:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:00] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2022-05-17 04:57:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:00] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:57:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-17 04:57:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:00] [INFO ] [Nat]Absence check using state equation in 117 ms returned sat
[2022-05-17 04:57:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2022-05-17 04:57:00] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 16 ms.
[2022-05-17 04:57:01] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
[2022-05-17 04:57:01] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
[2022-05-17 04:57:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 195 ms
[2022-05-17 04:57:01] [INFO ] Added : 83 causal constraints over 17 iterations in 568 ms. Result :sat
Minimization took 70 ms.
[2022-05-17 04:57:01] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:57:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-17 04:57:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:01] [INFO ] [Real]Absence check using state equation in 180 ms returned sat
[2022-05-17 04:57:01] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 04:57:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 121 ms returned sat
[2022-05-17 04:57:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:01] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2022-05-17 04:57:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2022-05-17 04:57:02] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2022-05-17 04:57:02] [INFO ] Added : 89 causal constraints over 18 iterations in 505 ms. Result :sat
Minimization took 204 ms.
[2022-05-17 04:57:02] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:02] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 30 ms returned sat
[2022-05-17 04:57:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:03] [INFO ] [Real]Absence check using state equation in 188 ms returned sat
[2022-05-17 04:57:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 171 ms returned sat
[2022-05-17 04:57:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:03] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-05-17 04:57:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-17 04:57:03] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 19 ms.
[2022-05-17 04:57:04] [INFO ] Added : 115 causal constraints over 24 iterations in 482 ms. Result :sat
Minimization took 152 ms.
[2022-05-17 04:57:04] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2022-05-17 04:57:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 30 ms returned sat
[2022-05-17 04:57:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:04] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2022-05-17 04:57:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 200 ms returned sat
[2022-05-17 04:57:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:05] [INFO ] [Nat]Absence check using state equation in 468 ms returned sat
[2022-05-17 04:57:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2022-05-17 04:57:05] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 1 ms to minimize.
[2022-05-17 04:57:05] [INFO ] Deduced a trap composed of 18 places in 162 ms of which 1 ms to minimize.
[2022-05-17 04:57:06] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2022-05-17 04:57:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 524 ms
[2022-05-17 04:57:06] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 25 ms.
[2022-05-17 04:57:06] [INFO ] Added : 109 causal constraints over 23 iterations in 720 ms. Result :sat
Minimization took 82 ms.
[2022-05-17 04:57:07] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 04:57:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-17 04:57:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:07] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-17 04:57:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2022-05-17 04:57:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 39 ms returned sat
[2022-05-17 04:57:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:07] [INFO ] [Nat]Absence check using state equation in 408 ms returned sat
[2022-05-17 04:57:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2022-05-17 04:57:07] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 25 ms.
[2022-05-17 04:57:08] [INFO ] Deduced a trap composed of 16 places in 112 ms of which 1 ms to minimize.
[2022-05-17 04:57:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 210 ms
[2022-05-17 04:57:08] [INFO ] Added : 122 causal constraints over 25 iterations in 1058 ms. Result :sat
Minimization took 158 ms.
[2022-05-17 04:57:09] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2022-05-17 04:57:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:09] [INFO ] [Real]Absence check using state equation in 301 ms returned sat
[2022-05-17 04:57:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2022-05-17 04:57:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 195 ms returned sat
[2022-05-17 04:57:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:10] [INFO ] [Nat]Absence check using state equation in 420 ms returned sat
[2022-05-17 04:57:10] [INFO ] [Nat]Added 2 Read/Feed constraints in 9 ms returned sat
[2022-05-17 04:57:10] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 15 ms.
[2022-05-17 04:57:10] [INFO ] Added : 134 causal constraints over 28 iterations in 687 ms. Result :sat
Minimization took 178 ms.
[2022-05-17 04:57:11] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:11] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 31 ms returned sat
[2022-05-17 04:57:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:11] [INFO ] [Real]Absence check using state equation in 192 ms returned sat
[2022-05-17 04:57:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:11] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2022-05-17 04:57:11] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 215 ms returned sat
[2022-05-17 04:57:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:12] [INFO ] [Nat]Absence check using state equation in 321 ms returned sat
[2022-05-17 04:57:12] [INFO ] [Nat]Added 2 Read/Feed constraints in 24 ms returned sat
[2022-05-17 04:57:12] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 1 ms to minimize.
[2022-05-17 04:57:12] [INFO ] Deduced a trap composed of 15 places in 95 ms of which 1 ms to minimize.
[2022-05-17 04:57:12] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2022-05-17 04:57:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2022-05-17 04:57:12] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 21 ms.
[2022-05-17 04:57:13] [INFO ] Added : 159 causal constraints over 32 iterations in 1089 ms. Result :sat
Minimization took 142 ms.
[2022-05-17 04:57:13] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2022-05-17 04:57:13] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2022-05-17 04:57:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:14] [INFO ] [Real]Absence check using state equation in 298 ms returned sat
[2022-05-17 04:57:14] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:14] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2022-05-17 04:57:14] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 78 ms returned sat
[2022-05-17 04:57:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:14] [INFO ] [Nat]Absence check using state equation in 277 ms returned sat
[2022-05-17 04:57:14] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2022-05-17 04:57:14] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 1 ms to minimize.
[2022-05-17 04:57:14] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2022-05-17 04:57:14] [INFO ] Deduced a trap composed of 22 places in 98 ms of which 1 ms to minimize.
[2022-05-17 04:57:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 352 ms
[2022-05-17 04:57:15] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2022-05-17 04:57:15] [INFO ] Deduced a trap composed of 40 places in 35 ms of which 0 ms to minimize.
[2022-05-17 04:57:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-17 04:57:15] [INFO ] Added : 195 causal constraints over 40 iterations in 938 ms. Result :sat
Minimization took 163 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 9 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 15 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 14 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:18] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-17 04:57:18] [INFO ] Implicit Places using invariants in 255 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:18] [INFO ] Computed 60 place invariants in 10 ms
[2022-05-17 04:57:19] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:19] [INFO ] Implicit Places using invariants and state equation in 583 ms returned []
Implicit Place search using SMT with State Equation took 842 ms to find 0 implicit places.
[2022-05-17 04:57:19] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:19] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:57:19] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting property specific reduction for DES-PT-40a-UpperBounds-00
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:19] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 133 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:19] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:57:19] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2022-05-17 04:57:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-17 04:57:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:20] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-05-17 04:57:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:20] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 04:57:20] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 147 ms returned sat
[2022-05-17 04:57:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:20] [INFO ] [Nat]Absence check using state equation in 216 ms returned sat
[2022-05-17 04:57:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:20] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2022-05-17 04:57:20] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 16 ms.
[2022-05-17 04:57:21] [INFO ] Deduced a trap composed of 21 places in 90 ms of which 1 ms to minimize.
[2022-05-17 04:57:21] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2022-05-17 04:57:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 249 ms
[2022-05-17 04:57:21] [INFO ] Added : 94 causal constraints over 19 iterations in 717 ms. Result :sat
Minimization took 159 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:21] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 13599 resets, run finished after 2161 ms. (steps per millisecond=462 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2249 resets, run finished after 1057 ms. (steps per millisecond=946 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:24] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:57:24] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:57:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:57:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:25] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-05-17 04:57:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:25] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:57:25] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 146 ms returned sat
[2022-05-17 04:57:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:25] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2022-05-17 04:57:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:25] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-17 04:57:25] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 16 ms.
[2022-05-17 04:57:26] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2022-05-17 04:57:26] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 0 ms to minimize.
[2022-05-17 04:57:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 243 ms
[2022-05-17 04:57:26] [INFO ] Added : 94 causal constraints over 19 iterations in 715 ms. Result :sat
Minimization took 161 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:26] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:57:26] [INFO ] Implicit Places using invariants in 336 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:26] [INFO ] Computed 60 place invariants in 10 ms
[2022-05-17 04:57:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:27] [INFO ] Implicit Places using invariants and state equation in 711 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
[2022-05-17 04:57:27] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:27] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:57:27] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-00 in 8208 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-03
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:27] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 139 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:27] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:57:28] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:57:28] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-17 04:57:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:28] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-05-17 04:57:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2022-05-17 04:57:28] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:57:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:28] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2022-05-17 04:57:28] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:28] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2022-05-17 04:57:28] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 16 ms.
[2022-05-17 04:57:28] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2022-05-17 04:57:29] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2022-05-17 04:57:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 307 ms
[2022-05-17 04:57:29] [INFO ] Added : 83 causal constraints over 17 iterations in 755 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 20 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:29] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 13619 resets, run finished after 2114 ms. (steps per millisecond=473 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2291 resets, run finished after 1201 ms. (steps per millisecond=832 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:33] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:57:33] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 04:57:33] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-17 04:57:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:33] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-05-17 04:57:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2022-05-17 04:57:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 30 ms returned sat
[2022-05-17 04:57:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:33] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2022-05-17 04:57:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2022-05-17 04:57:33] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 23 ms.
[2022-05-17 04:57:34] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2022-05-17 04:57:34] [INFO ] Deduced a trap composed of 13 places in 129 ms of which 2 ms to minimize.
[2022-05-17 04:57:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 339 ms
[2022-05-17 04:57:34] [INFO ] Added : 83 causal constraints over 17 iterations in 943 ms. Result :sat
Minimization took 116 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 22 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 19 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:35] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:35] [INFO ] Implicit Places using invariants in 493 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:35] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:35] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:36] [INFO ] Implicit Places using invariants and state equation in 929 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2022-05-17 04:57:36] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:36] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:57:36] [INFO ] Dead Transitions using invariants and state equation in 361 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-03 in 8965 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-07
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:36] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 10000 steps, including 137 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:36] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:37] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:37] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2022-05-17 04:57:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:37] [INFO ] [Real]Absence check using state equation in 297 ms returned sat
[2022-05-17 04:57:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:37] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2022-05-17 04:57:37] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 211 ms returned sat
[2022-05-17 04:57:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:38] [INFO ] [Nat]Absence check using state equation in 351 ms returned sat
[2022-05-17 04:57:38] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:38] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-05-17 04:57:38] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 24 ms.
[2022-05-17 04:57:38] [INFO ] Added : 89 causal constraints over 18 iterations in 633 ms. Result :sat
Minimization took 200 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 18 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:39] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13517 resets, run finished after 2669 ms. (steps per millisecond=374 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2271 resets, run finished after 999 ms. (steps per millisecond=1001 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:42] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:57:42] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 04:57:42] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-17 04:57:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:43] [INFO ] [Real]Absence check using state equation in 182 ms returned sat
[2022-05-17 04:57:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:43] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:43] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 212 ms returned sat
[2022-05-17 04:57:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:43] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2022-05-17 04:57:43] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:43] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2022-05-17 04:57:43] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 24 ms.
[2022-05-17 04:57:44] [INFO ] Added : 89 causal constraints over 18 iterations in 630 ms. Result :sat
Minimization took 201 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:44] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:45] [INFO ] Implicit Places using invariants in 495 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:45] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:46] [INFO ] Implicit Places using invariants and state equation in 1030 ms returned []
Implicit Place search using SMT with State Equation took 1528 ms to find 0 implicit places.
[2022-05-17 04:57:46] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:46] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:46] [INFO ] Dead Transitions using invariants and state equation in 381 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-07 in 10017 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-08
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:46] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 141 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:46] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:47] [INFO ] [Real]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:47] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 32 ms returned sat
[2022-05-17 04:57:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:47] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-05-17 04:57:47] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 19 ms returned sat
[2022-05-17 04:57:47] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 173 ms returned sat
[2022-05-17 04:57:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:47] [INFO ] [Nat]Absence check using state equation in 425 ms returned sat
[2022-05-17 04:57:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2022-05-17 04:57:48] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 31 ms.
[2022-05-17 04:57:48] [INFO ] Added : 115 causal constraints over 24 iterations in 795 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:49] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13654 resets, run finished after 2451 ms. (steps per millisecond=407 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2277 resets, run finished after 1256 ms. (steps per millisecond=796 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:53] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:57:53] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 04:57:53] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:57:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:53] [INFO ] [Real]Absence check using state equation in 121 ms returned sat
[2022-05-17 04:57:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 04:57:53] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 101 ms returned sat
[2022-05-17 04:57:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:54] [INFO ] [Nat]Absence check using state equation in 410 ms returned sat
[2022-05-17 04:57:54] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2022-05-17 04:57:54] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 23 ms.
[2022-05-17 04:57:54] [INFO ] Added : 115 causal constraints over 24 iterations in 787 ms. Result :sat
Minimization took 152 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 15 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:55] [INFO ] Computed 60 place invariants in 6 ms
[2022-05-17 04:57:56] [INFO ] Implicit Places using invariants in 443 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:56] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:57] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1390 ms to find 0 implicit places.
[2022-05-17 04:57:57] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:57] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:57:57] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-08 in 10532 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-09
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:57] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 10000 steps, including 136 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:57:57] [INFO ] Computed 60 place invariants in 5 ms
[2022-05-17 04:57:57] [INFO ] [Real]Absence check using 35 positive place invariants in 20 ms returned sat
[2022-05-17 04:57:57] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 31 ms returned sat
[2022-05-17 04:57:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:57] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2022-05-17 04:57:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:57:58] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:57:58] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 204 ms returned sat
[2022-05-17 04:57:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:57:58] [INFO ] [Nat]Absence check using state equation in 472 ms returned sat
[2022-05-17 04:57:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:57:58] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2022-05-17 04:57:58] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 1 ms to minimize.
[2022-05-17 04:57:59] [INFO ] Deduced a trap composed of 18 places in 152 ms of which 1 ms to minimize.
[2022-05-17 04:57:59] [INFO ] Deduced a trap composed of 18 places in 140 ms of which 1 ms to minimize.
[2022-05-17 04:57:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 492 ms
[2022-05-17 04:57:59] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 23 ms.
[2022-05-17 04:58:00] [INFO ] Added : 109 causal constraints over 23 iterations in 825 ms. Result :sat
Minimization took 134 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:00] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13698 resets, run finished after 2383 ms. (steps per millisecond=419 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2268 resets, run finished after 1001 ms. (steps per millisecond=999 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:04] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:04] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2022-05-17 04:58:04] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-17 04:58:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:04] [INFO ] [Real]Absence check using state equation in 274 ms returned sat
[2022-05-17 04:58:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:04] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2022-05-17 04:58:04] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 183 ms returned sat
[2022-05-17 04:58:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:05] [INFO ] [Nat]Absence check using state equation in 397 ms returned sat
[2022-05-17 04:58:05] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:05] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2022-05-17 04:58:05] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 0 ms to minimize.
[2022-05-17 04:58:05] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2022-05-17 04:58:05] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 3 ms to minimize.
[2022-05-17 04:58:05] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 332 ms
[2022-05-17 04:58:05] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2022-05-17 04:58:06] [INFO ] Added : 109 causal constraints over 23 iterations in 520 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:06] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:06] [INFO ] Implicit Places using invariants in 298 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:06] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:07] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:07] [INFO ] Implicit Places using invariants and state equation in 810 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
[2022-05-17 04:58:07] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:07] [INFO ] Computed 60 place invariants in 7 ms
[2022-05-17 04:58:07] [INFO ] Dead Transitions using invariants and state equation in 242 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-09 in 10483 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-10
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:07] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 140 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:07] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:08] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:58:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:58:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:08] [INFO ] [Real]Absence check using state equation in 200 ms returned sat
[2022-05-17 04:58:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:58:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2022-05-17 04:58:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:08] [INFO ] [Nat]Absence check using state equation in 274 ms returned sat
[2022-05-17 04:58:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2022-05-17 04:58:08] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 15 ms.
[2022-05-17 04:58:09] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 0 ms to minimize.
[2022-05-17 04:58:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 127 ms
[2022-05-17 04:58:09] [INFO ] Added : 122 causal constraints over 25 iterations in 691 ms. Result :sat
Minimization took 103 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:09] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 13710 resets, run finished after 2144 ms. (steps per millisecond=466 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2263 resets, run finished after 1044 ms. (steps per millisecond=957 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:12] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:58:12] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:58:12] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-17 04:58:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:13] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2022-05-17 04:58:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:13] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:58:13] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2022-05-17 04:58:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:13] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2022-05-17 04:58:13] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:13] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2022-05-17 04:58:13] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 17 ms.
[2022-05-17 04:58:14] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
[2022-05-17 04:58:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2022-05-17 04:58:14] [INFO ] Added : 122 causal constraints over 25 iterations in 711 ms. Result :sat
Minimization took 99 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:14] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:58:14] [INFO ] Implicit Places using invariants in 266 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:14] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:15] [INFO ] Implicit Places using invariants and state equation in 708 ms returned []
Implicit Place search using SMT with State Equation took 976 ms to find 0 implicit places.
[2022-05-17 04:58:15] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:15] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:15] [INFO ] Dead Transitions using invariants and state equation in 247 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-10 in 7913 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-12
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:15] [INFO ] Computed 60 place invariants in 2 ms
Incomplete random walk after 10000 steps, including 139 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:15] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:58:15] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:58:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-17 04:58:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:16] [INFO ] [Real]Absence check using state equation in 206 ms returned sat
[2022-05-17 04:58:16] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:58:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 121 ms returned sat
[2022-05-17 04:58:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:16] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-17 04:58:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 11 ms returned sat
[2022-05-17 04:58:16] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 19 ms.
[2022-05-17 04:58:17] [INFO ] Added : 134 causal constraints over 28 iterations in 642 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:17] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 1000000 steps, including 13621 resets, run finished after 2114 ms. (steps per millisecond=473 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2310 resets, run finished after 1004 ms. (steps per millisecond=996 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:20] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:58:20] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:58:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:58:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:21] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2022-05-17 04:58:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:58:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 196 ms returned sat
[2022-05-17 04:58:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:21] [INFO ] [Nat]Absence check using state equation in 405 ms returned sat
[2022-05-17 04:58:21] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 10 ms returned sat
[2022-05-17 04:58:21] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2022-05-17 04:58:22] [INFO ] Added : 134 causal constraints over 28 iterations in 646 ms. Result :sat
Minimization took 111 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 9 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:22] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:23] [INFO ] Implicit Places using invariants in 324 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:23] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:23] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:23] [INFO ] Implicit Places using invariants and state equation in 681 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2022-05-17 04:58:23] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:23] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:24] [INFO ] Dead Transitions using invariants and state equation in 202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-12 in 8215 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-13
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:24] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 134 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:24] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:58:24] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:58:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:58:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:24] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2022-05-17 04:58:24] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:58:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 133 ms returned sat
[2022-05-17 04:58:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:24] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-05-17 04:58:24] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 15 ms returned sat
[2022-05-17 04:58:24] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2022-05-17 04:58:24] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 1 ms to minimize.
[2022-05-17 04:58:25] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2022-05-17 04:58:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 271 ms
[2022-05-17 04:58:25] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2022-05-17 04:58:25] [INFO ] Added : 159 causal constraints over 32 iterations in 690 ms. Result :sat
Minimization took 88 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:26] [INFO ] Computed 60 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 13732 resets, run finished after 2143 ms. (steps per millisecond=466 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2261 resets, run finished after 1038 ms. (steps per millisecond=963 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:29] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:58:29] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-17 04:58:29] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2022-05-17 04:58:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:29] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2022-05-17 04:58:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:58:29] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 134 ms returned sat
[2022-05-17 04:58:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:30] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2022-05-17 04:58:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:30] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
[2022-05-17 04:58:30] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 0 ms to minimize.
[2022-05-17 04:58:30] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2022-05-17 04:58:30] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 1 ms to minimize.
[2022-05-17 04:58:30] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 262 ms
[2022-05-17 04:58:30] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 14 ms.
[2022-05-17 04:58:31] [INFO ] Added : 159 causal constraints over 32 iterations in 696 ms. Result :sat
Minimization took 87 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 8 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:31] [INFO ] Computed 60 place invariants in 4 ms
[2022-05-17 04:58:31] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:31] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:32] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:32] [INFO ] Implicit Places using invariants and state equation in 672 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2022-05-17 04:58:32] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:32] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:58:32] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-13 in 8677 ms.
Starting property specific reduction for DES-PT-40a-UpperBounds-14
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:32] [INFO ] Computed 60 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 126 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:32] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:32] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:58:32] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2022-05-17 04:58:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:33] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2022-05-17 04:58:33] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:58:33] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 84 ms returned sat
[2022-05-17 04:58:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:33] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2022-05-17 04:58:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:33] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2022-05-17 04:58:33] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2022-05-17 04:58:33] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 0 ms to minimize.
[2022-05-17 04:58:33] [INFO ] Deduced a trap composed of 22 places in 105 ms of which 1 ms to minimize.
[2022-05-17 04:58:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 373 ms
[2022-05-17 04:58:33] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 15 ms.
[2022-05-17 04:58:34] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2022-05-17 04:58:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2022-05-17 04:58:34] [INFO ] Added : 195 causal constraints over 40 iterations in 995 ms. Result :sat
Minimization took 171 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 14 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:35] [INFO ] Computed 60 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 13648 resets, run finished after 2093 ms. (steps per millisecond=477 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2253 resets, run finished after 1013 ms. (steps per millisecond=987 ) properties (out of 1) seen :0
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:38] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:38] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2022-05-17 04:58:38] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-17 04:58:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:39] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2022-05-17 04:58:39] [INFO ] Solution in real domain found non-integer solution.
[2022-05-17 04:58:39] [INFO ] [Nat]Absence check using 35 positive place invariants in 13 ms returned sat
[2022-05-17 04:58:39] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 81 ms returned sat
[2022-05-17 04:58:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-17 04:58:39] [INFO ] [Nat]Absence check using state equation in 280 ms returned sat
[2022-05-17 04:58:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:39] [INFO ] [Nat]Added 2 Read/Feed constraints in 12 ms returned sat
[2022-05-17 04:58:39] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 1 ms to minimize.
[2022-05-17 04:58:39] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 0 ms to minimize.
[2022-05-17 04:58:39] [INFO ] Deduced a trap composed of 22 places in 99 ms of which 0 ms to minimize.
[2022-05-17 04:58:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 351 ms
[2022-05-17 04:58:39] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 15 ms.
[2022-05-17 04:58:40] [INFO ] Deduced a trap composed of 40 places in 36 ms of which 1 ms to minimize.
[2022-05-17 04:58:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2022-05-17 04:58:40] [INFO ] Added : 195 causal constraints over 40 iterations in 986 ms. Result :sat
Minimization took 170 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 6 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 7 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:41] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:41] [INFO ] Implicit Places using invariants in 273 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:41] [INFO ] Computed 60 place invariants in 3 ms
[2022-05-17 04:58:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-05-17 04:58:42] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 911 ms to find 0 implicit places.
[2022-05-17 04:58:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 213 rows 271 cols
[2022-05-17 04:58:42] [INFO ] Computed 60 place invariants in 2 ms
[2022-05-17 04:58:42] [INFO ] Dead Transitions using invariants and state equation in 215 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 271/271 places, 213/213 transitions.
Ending property specific reduction for DES-PT-40a-UpperBounds-14 in 9829 ms.
[2022-05-17 04:58:42] [INFO ] Flatten gal took : 93 ms
[2022-05-17 04:58:42] [INFO ] Applying decomposition
[2022-05-17 04:58:42] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph17246492725256622606.txt' '-o' '/tmp/graph17246492725256622606.bin' '-w' '/tmp/graph17246492725256622606.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph17246492725256622606.bin' '-l' '-1' '-v' '-w' '/tmp/graph17246492725256622606.weights' '-q' '0' '-e' '0.001'
[2022-05-17 04:58:43] [INFO ] Decomposing Gal with order
[2022-05-17 04:58:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-17 04:58:43] [INFO ] Removed a total of 55 redundant transitions.
[2022-05-17 04:58:43] [INFO ] Flatten gal took : 102 ms
[2022-05-17 04:58:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 8 ms.
[2022-05-17 04:58:43] [INFO ] Time to serialize gal into /tmp/UpperBounds7903696918131966166.gal : 11 ms
[2022-05-17 04:58:43] [INFO ] Time to serialize properties into /tmp/UpperBounds15155401365345988266.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds7903696918131966166.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15155401365345988266.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds15155401365345988266.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.77337e+13,9.29096,210468,14582,4598,561477,12450,300,326332,383,82817,0
Total reachable state count : 17733739550780

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

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-00,0,12.5737,211048,1,0,561477,54247,482,326332,447,275444,2704
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-03 :0 <= u13.p90 <= 1
FORMULA DES-PT-40a-UpperBounds-03 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-03,0,13.4247,211048,1,0,561477,54543,508,326332,516,282461,2923
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-07 :0 <= u2.p147 <= 1
FORMULA DES-PT-40a-UpperBounds-07 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-07,0,13.4258,211048,1,0,561477,54558,524,326332,547,282490,2951
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-08 :0 <= i4.u15.p23 <= 1
FORMULA DES-PT-40a-UpperBounds-08 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-08,0,13.429,211048,1,0,561477,54726,545,326332,584,283450,3239
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-09 :0 <= u48.p63 <= 1
FORMULA DES-PT-40a-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-09,0,16.935,211576,1,0,561477,67770,582,326332,627,372099,4266
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-10 :0 <= u2.p146 <= 1
FORMULA DES-PT-40a-UpperBounds-10 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-10,0,16.9357,211576,1,0,561477,67786,598,326332,660,372130,4294
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-12 :0 <= u48.p58 <= 1
FORMULA DES-PT-40a-UpperBounds-12 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-12,0,20.8563,211576,1,0,561477,84640,626,333188,719,492803,4496
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-13 :0 <= i4.u15.p12 <= 1
FORMULA DES-PT-40a-UpperBounds-13 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-13,0,20.8592,211576,1,0,561477,84744,647,333218,764,493520,4784
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property DES-PT-40a-UpperBounds-14 :0 <= u48.p43 <= 1
FORMULA DES-PT-40a-UpperBounds-14 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
DES-PT-40a-UpperBounds-14,0,23.9018,215272,1,0,561477,92128,675,369198,856,534739,4986
Total runtime 166495 ms.

BK_STOP 1652763547417

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is DES-PT-40a, 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 r042-smll-165252095800501"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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