Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300092.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is BusinessProcesses-PT-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 146K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748582395008

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-30 05:19:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 05:19:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 05:19:57] [INFO ] Load time of PNML (sax parser for PT used): 249 ms
[2025-05-30 05:19:58] [INFO ] Transformed 586 places.
[2025-05-30 05:19:58] [INFO ] Transformed 525 transitions.
[2025-05-30 05:19:58] [INFO ] Found NUPN structural information;
[2025-05-30 05:19:58] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 496 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 19 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 75 places :
Symmetric choice reduction at 1 with 75 rule applications. Total rules 78 place count 504 transition count 446
Iterating global reduction 1 with 75 rules applied. Total rules applied 153 place count 504 transition count 446
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 187 place count 470 transition count 412
Iterating global reduction 1 with 34 rules applied. Total rules applied 221 place count 470 transition count 412
Applied a total of 221 rules in 259 ms. Remains 470 /582 variables (removed 112) and now considering 412/521 (removed 109) transitions.
// Phase 1: matrix 412 rows 470 cols
[2025-05-30 05:19:58] [INFO ] Computed 95 invariants in 47 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:19:59] [INFO ] Implicit Places using invariants in 1020 ms returned []
[2025-05-30 05:19:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:20:02] [INFO ] Implicit Places using invariants and state equation in 2826 ms returned []
Implicit Place search using SMT with State Equation took 3918 ms to find 0 implicit places.
Running 411 sub problems to find dead transitions.
[2025-05-30 05:20:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 411 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 411 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:27] [INFO ] Deduced a trap composed of 54 places in 429 ms of which 94 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:28] [INFO ] Deduced a trap composed of 54 places in 409 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:28] [INFO ] Deduced a trap composed of 54 places in 413 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:29] [INFO ] Deduced a trap composed of 55 places in 384 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:29] [INFO ] Deduced a trap composed of 55 places in 381 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:29] [INFO ] Deduced a trap composed of 55 places in 316 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:30] [INFO ] Deduced a trap composed of 55 places in 380 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:30] [INFO ] Deduced a trap composed of 56 places in 384 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:30] [INFO ] Deduced a trap composed of 56 places in 329 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:31] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:31] [INFO ] Deduced a trap composed of 56 places in 337 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:31] [INFO ] Deduced a trap composed of 55 places in 228 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:32] [INFO ] Deduced a trap composed of 55 places in 240 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:32] [INFO ] Deduced a trap composed of 55 places in 271 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:32] [INFO ] Deduced a trap composed of 55 places in 275 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:33] [INFO ] Deduced a trap composed of 55 places in 289 ms of which 52 ms to minimize.
SMT process timed out in 30387ms, After SMT, problems are : Problem set: 0 solved, 411 unsolved
Search for dead transitions found 0 dead transitions in 30414ms
Starting structural reductions in LTL mode, iteration 1 : 470/582 places, 412/521 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34627 ms. Remains : 470/582 places, 412/521 transitions.
Support contains 43 out of 470 places after structural reductions.
[2025-05-30 05:20:33] [INFO ] Flatten gal took : 92 ms
[2025-05-30 05:20:33] [INFO ] Flatten gal took : 40 ms
[2025-05-30 05:20:33] [INFO ] Input system was already deterministic with 412 transitions.
RANDOM walk for 40000 steps (292 resets) in 1793 ms. (22 steps per ms) remains 19/34 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 19/19 properties
[2025-05-30 05:20:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem AtomicPropp19 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 275/302 variables, 41/41 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/302 variables, 0/41 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 41/343 variables, 11/52 constraints. Problems are: Problem set: 1 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/343 variables, 0/52 constraints. Problems are: Problem set: 1 solved, 18 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 5 (OVERLAPS) 120/463 variables, 42/94 constraints. Problems are: Problem set: 2 solved, 17 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:35] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:35] [INFO ] Deduced a trap composed of 10 places in 275 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:36] [INFO ] Deduced a trap composed of 15 places in 378 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:36] [INFO ] Deduced a trap composed of 17 places in 368 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:36] [INFO ] Deduced a trap composed of 18 places in 354 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:37] [INFO ] Deduced a trap composed of 23 places in 296 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:37] [INFO ] Deduced a trap composed of 30 places in 399 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:38] [INFO ] Deduced a trap composed of 73 places in 430 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:38] [INFO ] Deduced a trap composed of 73 places in 383 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:38] [INFO ] Deduced a trap composed of 73 places in 427 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:39] [INFO ] Deduced a trap composed of 73 places in 437 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:39] [INFO ] Deduced a trap composed of 73 places in 361 ms of which 85 ms to minimize.
SMT process timed out in 5273ms, After SMT, problems are : Problem set: 2 solved, 17 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 25 out of 470 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (complete) has 1052 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 469 transition count 366
Reduce places removed 45 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 48 rules applied. Total rules applied 94 place count 424 transition count 363
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 97 place count 421 transition count 363
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 91 Pre rules applied. Total rules applied 97 place count 421 transition count 272
Deduced a syphon composed of 91 places in 2 ms
Ensure Unique test removed 17 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 199 rules applied. Total rules applied 296 place count 313 transition count 272
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 304 place count 305 transition count 264
Iterating global reduction 3 with 8 rules applied. Total rules applied 312 place count 305 transition count 264
Performed 112 Post agglomeration using F-continuation condition.Transition count delta: 112
Deduced a syphon composed of 112 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 228 rules applied. Total rules applied 540 place count 189 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 541 place count 189 transition count 151
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 543 place count 188 transition count 155
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 552 place count 188 transition count 155
Applied a total of 552 rules in 210 ms. Remains 188 /470 variables (removed 282) and now considering 155/412 (removed 257) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 210 ms. Remains : 188/470 places, 155/412 transitions.
RANDOM walk for 40000 steps (3916 resets) in 1679 ms. (23 steps per ms) remains 15/17 properties
BEST_FIRST walk for 4004 steps (111 resets) in 35 ms. (111 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (101 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (110 resets) in 33 ms. (117 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (107 resets) in 34 ms. (114 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (111 resets) in 41 ms. (95 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (93 resets) in 24 ms. (160 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (101 resets) in 37 ms. (105 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (108 resets) in 32 ms. (121 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (110 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (107 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (118 resets) in 44 ms. (88 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (106 resets) in 28 ms. (138 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (106 resets) in 18 ms. (210 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (102 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (111 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
// Phase 1: matrix 155 rows 188 cols
[2025-05-30 05:20:40] [INFO ] Computed 74 invariants in 5 ms
[2025-05-30 05:20:40] [INFO ] State equation strengthened by 5 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 56/77 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:40] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:40] [INFO ] Deduced a trap composed of 46 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:40] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:41] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:41] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/77 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/77 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 71/148 variables, 44/58 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:41] [INFO ] Deduced a trap composed of 44 places in 91 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:41] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:41] [INFO ] Deduced a trap composed of 44 places in 96 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:41] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:41] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 40 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 40 places in 108 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 9 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:42] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:43] [INFO ] Deduced a trap composed of 41 places in 112 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:43] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:43] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:43] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:43] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:43] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:43] [INFO ] Deduced a trap composed of 41 places in 107 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:43] [INFO ] Deduced a trap composed of 41 places in 124 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:44] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:44] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:44] [INFO ] Deduced a trap composed of 41 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:44] [INFO ] Deduced a trap composed of 41 places in 96 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/148 variables, 14/84 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/148 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 38/186 variables, 21/105 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:44] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:44] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:45] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:45] [INFO ] Deduced a trap composed of 41 places in 173 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:45] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:45] [INFO ] Deduced a trap composed of 40 places in 164 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:45] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:45] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:46] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:46] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:46] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:46] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:46] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:46] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:47] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:47] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:47] [INFO ] Deduced a trap composed of 40 places in 162 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:47] [INFO ] Deduced a trap composed of 15 places in 161 ms of which 22 ms to minimize.
Problem AtomicPropp16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:47] [INFO ] Deduced a trap composed of 39 places in 172 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:48] [INFO ] Deduced a trap composed of 39 places in 160 ms of which 23 ms to minimize.
Problem AtomicPropp16 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 20/125 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:48] [INFO ] Deduced a trap composed of 40 places in 125 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:48] [INFO ] Deduced a trap composed of 41 places in 164 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:48] [INFO ] Deduced a trap composed of 41 places in 172 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:48] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:48] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:49] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:49] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:49] [INFO ] Deduced a trap composed of 41 places in 160 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:49] [INFO ] Deduced a trap composed of 41 places in 170 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:49] [INFO ] Deduced a trap composed of 39 places in 173 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:49] [INFO ] Deduced a trap composed of 41 places in 137 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:50] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:50] [INFO ] Deduced a trap composed of 42 places in 171 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:50] [INFO ] Deduced a trap composed of 42 places in 150 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:50] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:50] [INFO ] Deduced a trap composed of 15 places in 153 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:50] [INFO ] Deduced a trap composed of 16 places in 160 ms of which 20 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 17/142 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:51] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:51] [INFO ] Deduced a trap composed of 40 places in 166 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:51] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:51] [INFO ] Deduced a trap composed of 21 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:51] [INFO ] Deduced a trap composed of 40 places in 161 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:52] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:52] [INFO ] Deduced a trap composed of 39 places in 152 ms of which 23 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 7/149 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:52] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:52] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:52] [INFO ] Deduced a trap composed of 41 places in 155 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:52] [INFO ] Deduced a trap composed of 41 places in 159 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:53] [INFO ] Deduced a trap composed of 41 places in 145 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:53] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:53] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:53] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:53] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:53] [INFO ] Deduced a trap composed of 41 places in 147 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:53] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:54] [INFO ] Deduced a trap composed of 40 places in 142 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:54] [INFO ] Deduced a trap composed of 40 places in 135 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:54] [INFO ] Deduced a trap composed of 41 places in 175 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:54] [INFO ] Deduced a trap composed of 41 places in 163 ms of which 24 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/186 variables, 15/164 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:54] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:55] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:55] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:55] [INFO ] Deduced a trap composed of 42 places in 174 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:55] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:55] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:56] [INFO ] Deduced a trap composed of 42 places in 178 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:56] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:56] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:56] [INFO ] Deduced a trap composed of 43 places in 157 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:56] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:56] [INFO ] Deduced a trap composed of 41 places in 180 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:57] [INFO ] Deduced a trap composed of 41 places in 149 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:57] [INFO ] Deduced a trap composed of 41 places in 168 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:57] [INFO ] Deduced a trap composed of 41 places in 161 ms of which 28 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/186 variables, 15/179 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:57] [INFO ] Deduced a trap composed of 42 places in 148 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:57] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:58] [INFO ] Deduced a trap composed of 42 places in 164 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:58] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 26 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/186 variables, 4/183 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:58] [INFO ] Deduced a trap composed of 45 places in 164 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:58] [INFO ] Deduced a trap composed of 45 places in 115 ms of which 15 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/186 variables, 2/185 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/186 variables, 0/185 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 155/341 variables, 186/371 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/341 variables, 5/376 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:59] [INFO ] Deduced a trap composed of 41 places in 150 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:59] [INFO ] Deduced a trap composed of 41 places in 151 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:59] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:59] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:20:59] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:00] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:00] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:00] [INFO ] Deduced a trap composed of 42 places in 191 ms of which 28 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/341 variables, 8/384 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/341 variables, 0/384 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 2/343 variables, 2/386 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/343 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 23 (OVERLAPS) 0/343 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 343/343 variables, and 386 constraints, problems are : Problem set: 1 solved, 14 unsolved in 21678 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 188/188 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 119/119 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/18 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 55/73 variables, 8/8 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 3/11 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/73 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 4 (OVERLAPS) 74/147 variables, 45/56 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 28/84 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/84 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 39/186 variables, 21/105 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/186 variables, 88/193 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:03] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:03] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:03] [INFO ] Deduced a trap composed of 40 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:03] [INFO ] Deduced a trap composed of 42 places in 170 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:03] [INFO ] Deduced a trap composed of 42 places in 173 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:03] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/186 variables, 6/199 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:04] [INFO ] Deduced a trap composed of 40 places in 143 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:04] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:04] [INFO ] Deduced a trap composed of 40 places in 168 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:04] [INFO ] Deduced a trap composed of 40 places in 163 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:05] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:05] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:05] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:05] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:05] [INFO ] Deduced a trap composed of 42 places in 166 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:05] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:06] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:06] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:06] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:06] [INFO ] Deduced a trap composed of 42 places in 152 ms of which 16 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 14/213 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/186 variables, 0/213 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 155/341 variables, 186/399 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 5/404 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 14/418 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:08] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:08] [INFO ] Deduced a trap composed of 28 places in 148 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:08] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:08] [INFO ] Deduced a trap composed of 29 places in 160 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:09] [INFO ] Deduced a trap composed of 18 places in 139 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:09] [INFO ] Deduced a trap composed of 42 places in 140 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:09] [INFO ] Deduced a trap composed of 42 places in 136 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:10] [INFO ] Deduced a trap composed of 42 places in 138 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:10] [INFO ] Deduced a trap composed of 42 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:10] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:10] [INFO ] Deduced a trap composed of 43 places in 172 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:10] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:11] [INFO ] Deduced a trap composed of 43 places in 176 ms of which 28 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 13/431 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:11] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:12] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:12] [INFO ] Deduced a trap composed of 43 places in 168 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:12] [INFO ] Deduced a trap composed of 43 places in 169 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:12] [INFO ] Deduced a trap composed of 43 places in 145 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:12] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:13] [INFO ] Deduced a trap composed of 43 places in 151 ms of which 23 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/341 variables, 7/438 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:14] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:14] [INFO ] Deduced a trap composed of 42 places in 137 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:15] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:15] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:15] [INFO ] Deduced a trap composed of 44 places in 159 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:15] [INFO ] Deduced a trap composed of 44 places in 141 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:15] [INFO ] Deduced a trap composed of 44 places in 155 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:16] [INFO ] Deduced a trap composed of 46 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:16] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:16] [INFO ] Deduced a trap composed of 46 places in 146 ms of which 15 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/341 variables, 10/448 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:17] [INFO ] Deduced a trap along path composed of 2 places in 31 ms of which 5 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/341 variables, 1/449 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/341 variables, 0/449 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 2/343 variables, 2/451 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/343 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 14 unsolved
At refinement iteration 22 (OVERLAPS) 0/343 variables, 0/451 constraints. Problems are: Problem set: 1 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 343/343 variables, and 451 constraints, problems are : Problem set: 1 solved, 14 unsolved in 24358 ms.
Refiners :[Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 188/188 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 14/15 constraints, Known Traps: 169/169 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 46061ms problems are : Problem set: 1 solved, 14 unsolved
Parikh walk visited 5 properties in 2765 ms.
Support contains 11 out of 188 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 188/188 places, 155/155 transitions.
Graph (trivial) has 12 edges and 188 vertex of which 2 / 188 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 187 transition count 151
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 185 transition count 151
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 5 place count 185 transition count 147
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 9 rules applied. Total rules applied 14 place count 180 transition count 147
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 24 place count 175 transition count 142
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 175 transition count 140
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 173 transition count 140
Applied a total of 28 rules in 41 ms. Remains 173 /188 variables (removed 15) and now considering 140/155 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 173/188 places, 140/155 transitions.
RANDOM walk for 40000 steps (1363 resets) in 230 ms. (173 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (718 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
// Phase 1: matrix 140 rows 173 cols
[2025-05-30 05:21:29] [INFO ] Computed 73 invariants in 4 ms
[2025-05-30 05:21:29] [INFO ] State equation strengthened by 13 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/125 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:29] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 5 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/167 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/171 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/171 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 140/311 variables, 171/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/311 variables, 13/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:30] [INFO ] Deduced a trap composed of 34 places in 130 ms of which 15 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:30] [INFO ] Deduced a trap along path composed of 5 places in 36 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:30] [INFO ] Deduced a trap along path composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 2/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:30] [INFO ] Deduced a trap composed of 34 places in 168 ms of which 14 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/313 variables, 2/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/313 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/313 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 264 constraints, problems are : Problem set: 0 solved, 1 unsolved in 966 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 173/173 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 3/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 121/125 variables, 50/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 42/167 variables, 18/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/167 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/167 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/171 variables, 4/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/171 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 140/311 variables, 171/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/311 variables, 13/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/311 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/311 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/311 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/313 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/313 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/313 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 313/313 variables, and 265 constraints, problems are : Problem set: 0 solved, 1 unsolved in 239 ms.
Refiners :[Positive P Invariants (semi-flows): 51/51 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 173/173 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1217ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2067 steps, including 56 resets, run visited all 1 properties in 8 ms. (steps per millisecond=258 )
Parikh walk visited 1 properties in 13 ms.
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-12-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 455 stabilizing places and 397 stable transitions
Graph (complete) has 1052 edges and 470 vertex of which 469 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.27 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0||G(p1))) U X(G(p2)))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 460 transition count 402
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 460 transition count 402
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 457 transition count 399
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 457 transition count 399
Applied a total of 26 rules in 57 ms. Remains 457 /470 variables (removed 13) and now considering 399/412 (removed 13) transitions.
// Phase 1: matrix 399 rows 457 cols
[2025-05-30 05:21:31] [INFO ] Computed 95 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:21:32] [INFO ] Implicit Places using invariants in 680 ms returned []
[2025-05-30 05:21:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:21:34] [INFO ] Implicit Places using invariants and state equation in 2681 ms returned []
Implicit Place search using SMT with State Equation took 3363 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2025-05-30 05:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/456 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/456 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/457 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:59] [INFO ] Deduced a trap composed of 52 places in 371 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:59] [INFO ] Deduced a trap composed of 53 places in 346 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:21:59] [INFO ] Deduced a trap composed of 53 places in 332 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:00] [INFO ] Deduced a trap composed of 53 places in 327 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:00] [INFO ] Deduced a trap composed of 53 places in 301 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:00] [INFO ] Deduced a trap composed of 52 places in 329 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:01] [INFO ] Deduced a trap composed of 53 places in 346 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:01] [INFO ] Deduced a trap composed of 53 places in 344 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:01] [INFO ] Deduced a trap composed of 53 places in 302 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:02] [INFO ] Deduced a trap composed of 55 places in 345 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:02] [INFO ] Deduced a trap composed of 55 places in 328 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:02] [INFO ] Deduced a trap composed of 55 places in 337 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:03] [INFO ] Deduced a trap composed of 55 places in 347 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:03] [INFO ] Deduced a trap composed of 55 places in 339 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:04] [INFO ] Deduced a trap composed of 56 places in 367 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:04] [INFO ] Deduced a trap composed of 56 places in 335 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:04] [INFO ] Deduced a trap composed of 56 places in 324 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:05] [INFO ] Deduced a trap composed of 56 places in 326 ms of which 60 ms to minimize.
SMT process timed out in 30125ms, After SMT, problems are : Problem set: 0 solved, 398 unsolved
Search for dead transitions found 0 dead transitions in 30128ms
Starting structural reductions in LTL mode, iteration 1 : 457/470 places, 399/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33550 ms. Remains : 457/470 places, 399/412 transitions.
Stuttering acceptance computed with spot in 525 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-00
Product exploration explored 100000 steps with 1103 reset in 542 ms.
Stack based approach found an accepted trace after 927 steps with 10 reset with depth 10 and stack size 10 in 3 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-00 finished in 34743 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (trivial) has 220 edges and 470 vertex of which 6 / 470 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1046 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 463 transition count 353
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 412 transition count 353
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 412 transition count 255
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 317 place count 297 transition count 255
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 329 place count 285 transition count 243
Iterating global reduction 2 with 12 rules applied. Total rules applied 341 place count 285 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 341 place count 285 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 343 place count 284 transition count 242
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 579 place count 164 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 581 place count 163 transition count 130
Applied a total of 581 rules in 70 ms. Remains 163 /470 variables (removed 307) and now considering 130/412 (removed 282) transitions.
// Phase 1: matrix 130 rows 163 cols
[2025-05-30 05:22:06] [INFO ] Computed 74 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:22:06] [INFO ] Implicit Places using invariants in 222 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 226 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/470 places, 130/412 transitions.
Applied a total of 0 rules in 9 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 307 ms. Remains : 143/470 places, 130/412 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-01 finished in 394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p0)||F((F(G(p2))&&p1))))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 401
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 401
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 458 transition count 400
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 458 transition count 400
Applied a total of 24 rules in 30 ms. Remains 458 /470 variables (removed 12) and now considering 400/412 (removed 12) transitions.
// Phase 1: matrix 400 rows 458 cols
[2025-05-30 05:22:06] [INFO ] Computed 95 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:22:07] [INFO ] Implicit Places using invariants in 424 ms returned []
[2025-05-30 05:22:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:22:09] [INFO ] Implicit Places using invariants and state equation in 2811 ms returned []
Implicit Place search using SMT with State Equation took 3237 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2025-05-30 05:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/457 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/457 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/458 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/458 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:31] [INFO ] Deduced a trap composed of 52 places in 359 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:31] [INFO ] Deduced a trap composed of 54 places in 364 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:31] [INFO ] Deduced a trap composed of 54 places in 330 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:32] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:32] [INFO ] Deduced a trap composed of 54 places in 305 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:32] [INFO ] Deduced a trap composed of 54 places in 301 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:33] [INFO ] Deduced a trap composed of 54 places in 342 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:33] [INFO ] Deduced a trap composed of 54 places in 331 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:33] [INFO ] Deduced a trap composed of 54 places in 344 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:34] [INFO ] Deduced a trap composed of 54 places in 323 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:34] [INFO ] Deduced a trap composed of 54 places in 301 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:34] [INFO ] Deduced a trap composed of 54 places in 304 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:35] [INFO ] Deduced a trap composed of 54 places in 352 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:35] [INFO ] Deduced a trap composed of 54 places in 344 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:35] [INFO ] Deduced a trap composed of 54 places in 328 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:36] [INFO ] Deduced a trap composed of 74 places in 335 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:36] [INFO ] Deduced a trap composed of 76 places in 234 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:36] [INFO ] Deduced a trap composed of 75 places in 364 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:37] [INFO ] Deduced a trap composed of 76 places in 405 ms of which 108 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:37] [INFO ] Deduced a trap composed of 71 places in 337 ms of which 75 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/458 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:38] [INFO ] Deduced a trap composed of 55 places in 356 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:38] [INFO ] Deduced a trap composed of 55 places in 349 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:39] [INFO ] Deduced a trap composed of 55 places in 361 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:39] [INFO ] Deduced a trap composed of 57 places in 305 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:22:39] [INFO ] Deduced a trap composed of 57 places in 310 ms of which 58 ms to minimize.
SMT process timed out in 30093ms, After SMT, problems are : Problem set: 0 solved, 399 unsolved
Search for dead transitions found 0 dead transitions in 30095ms
Starting structural reductions in LTL mode, iteration 1 : 458/470 places, 400/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33366 ms. Remains : 458/470 places, 400/412 transitions.
Stuttering acceptance computed with spot in 306 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0)), (NOT p2), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-02
Stuttering criterion allowed to conclude after 169 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-02 finished in 33700 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(!p0)))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (trivial) has 220 edges and 470 vertex of which 6 / 470 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1046 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 463 transition count 353
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 412 transition count 353
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 104 place count 412 transition count 255
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 318 place count 296 transition count 255
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 330 place count 284 transition count 243
Iterating global reduction 2 with 12 rules applied. Total rules applied 342 place count 284 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 342 place count 284 transition count 242
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 344 place count 283 transition count 242
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 580 place count 163 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 582 place count 162 transition count 130
Applied a total of 582 rules in 59 ms. Remains 162 /470 variables (removed 308) and now considering 130/412 (removed 282) transitions.
// Phase 1: matrix 130 rows 162 cols
[2025-05-30 05:22:40] [INFO ] Computed 73 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:22:40] [INFO ] Implicit Places using invariants in 302 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 304 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/470 places, 130/412 transitions.
Applied a total of 0 rules in 11 ms. Remains 143 /143 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 374 ms. Remains : 143/470 places, 130/412 transitions.
Stuttering acceptance computed with spot in 91 ms :[p0, true, p0]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-03
Product exploration explored 100000 steps with 21717 reset in 625 ms.
Product exploration explored 100000 steps with 21600 reset in 478 ms.
Computed a total of 134 stabilizing places and 122 stable transitions
Computed a total of 134 stabilizing places and 122 stable transitions
Detected a total of 134/143 stabilizing places and 122/130 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[true, p0]
RANDOM walk for 40000 steps (9859 resets) in 1001 ms. (39 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (3060 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 394 steps, run visited all 1 properties in 14 ms. (steps per millisecond=28 )
Probabilistic random walk after 394 steps, saw 188 distinct states, run finished after 20 ms. (steps per millisecond=19 ) properties seen :1
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Property proved to be false thanks to negative knowledge :(F p0)
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLFireability-03 finished in 2253 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 399
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 399
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 454 transition count 396
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 454 transition count 396
Applied a total of 32 rules in 46 ms. Remains 454 /470 variables (removed 16) and now considering 396/412 (removed 16) transitions.
// Phase 1: matrix 396 rows 454 cols
[2025-05-30 05:22:42] [INFO ] Computed 95 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:22:42] [INFO ] Implicit Places using invariants in 408 ms returned []
[2025-05-30 05:22:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:22:45] [INFO ] Implicit Places using invariants and state equation in 2613 ms returned []
Implicit Place search using SMT with State Equation took 3031 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2025-05-30 05:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:09] [INFO ] Deduced a trap composed of 52 places in 369 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:09] [INFO ] Deduced a trap composed of 55 places in 340 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:10] [INFO ] Deduced a trap composed of 55 places in 352 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:10] [INFO ] Deduced a trap composed of 55 places in 330 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:11] [INFO ] Deduced a trap composed of 55 places in 325 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:11] [INFO ] Deduced a trap composed of 55 places in 315 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:11] [INFO ] Deduced a trap composed of 55 places in 320 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:12] [INFO ] Deduced a trap composed of 55 places in 297 ms of which 49 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:12] [INFO ] Deduced a trap composed of 55 places in 298 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:12] [INFO ] Deduced a trap composed of 55 places in 318 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:13] [INFO ] Deduced a trap composed of 55 places in 324 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:13] [INFO ] Deduced a trap composed of 55 places in 346 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:13] [INFO ] Deduced a trap composed of 55 places in 344 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:14] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:14] [INFO ] Deduced a trap composed of 55 places in 295 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:14] [INFO ] Deduced a trap composed of 55 places in 328 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:15] [INFO ] Deduced a trap composed of 76 places in 368 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:15] [INFO ] Deduced a trap composed of 76 places in 362 ms of which 90 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:15] [INFO ] Deduced a trap composed of 76 places in 354 ms of which 72 ms to minimize.
SMT process timed out in 30342ms, After SMT, problems are : Problem set: 0 solved, 395 unsolved
Search for dead transitions found 0 dead transitions in 30345ms
Starting structural reductions in LTL mode, iteration 1 : 454/470 places, 396/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33425 ms. Remains : 454/470 places, 396/412 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-04
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-04 finished in 33615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(F(p1))))'
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 399
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 399
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 454 transition count 396
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 454 transition count 396
Applied a total of 32 rules in 44 ms. Remains 454 /470 variables (removed 16) and now considering 396/412 (removed 16) transitions.
[2025-05-30 05:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:23:16] [INFO ] Implicit Places using invariants in 570 ms returned []
[2025-05-30 05:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:23:19] [INFO ] Implicit Places using invariants and state equation in 2988 ms returned []
Implicit Place search using SMT with State Equation took 3562 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2025-05-30 05:23:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:43] [INFO ] Deduced a trap composed of 52 places in 373 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:43] [INFO ] Deduced a trap composed of 55 places in 350 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:44] [INFO ] Deduced a trap composed of 55 places in 324 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:44] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:44] [INFO ] Deduced a trap composed of 55 places in 355 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:45] [INFO ] Deduced a trap composed of 55 places in 356 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:45] [INFO ] Deduced a trap composed of 55 places in 326 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:45] [INFO ] Deduced a trap composed of 55 places in 337 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:46] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:46] [INFO ] Deduced a trap composed of 55 places in 338 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:47] [INFO ] Deduced a trap composed of 55 places in 360 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:47] [INFO ] Deduced a trap composed of 55 places in 348 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:47] [INFO ] Deduced a trap composed of 55 places in 326 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:48] [INFO ] Deduced a trap composed of 55 places in 317 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:48] [INFO ] Deduced a trap composed of 55 places in 288 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:48] [INFO ] Deduced a trap composed of 55 places in 306 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:49] [INFO ] Deduced a trap composed of 76 places in 331 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:49] [INFO ] Deduced a trap composed of 76 places in 304 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:49] [INFO ] Deduced a trap composed of 76 places in 313 ms of which 67 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/850 variables, and 114 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 19/19 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 19/114 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:57] [INFO ] Deduced a trap composed of 73 places in 330 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:57] [INFO ] Deduced a trap composed of 76 places in 325 ms of which 83 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:58] [INFO ] Deduced a trap composed of 76 places in 323 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:58] [INFO ] Deduced a trap composed of 76 places in 311 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:58] [INFO ] Deduced a trap composed of 76 places in 341 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:59] [INFO ] Deduced a trap composed of 76 places in 325 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:59] [INFO ] Deduced a trap composed of 76 places in 288 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:59] [INFO ] Deduced a trap composed of 76 places in 283 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:23:59] [INFO ] Deduced a trap composed of 26 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:00] [INFO ] Deduced a trap composed of 52 places in 347 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:00] [INFO ] Deduced a trap composed of 55 places in 361 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:01] [INFO ] Deduced a trap composed of 55 places in 349 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:01] [INFO ] Deduced a trap composed of 55 places in 242 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:01] [INFO ] Deduced a trap composed of 55 places in 361 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:02] [INFO ] Deduced a trap composed of 71 places in 384 ms of which 84 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:02] [INFO ] Deduced a trap composed of 74 places in 348 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:02] [INFO ] Deduced a trap composed of 69 places in 379 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:03] [INFO ] Deduced a trap composed of 69 places in 376 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:03] [INFO ] Deduced a trap composed of 69 places in 348 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:03] [INFO ] Deduced a trap composed of 69 places in 360 ms of which 66 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/134 constraints. Problems are: Problem set: 15 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:05] [INFO ] Deduced a trap composed of 54 places in 344 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:05] [INFO ] Deduced a trap composed of 55 places in 332 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:05] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:06] [INFO ] Deduced a trap composed of 54 places in 371 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:06] [INFO ] Deduced a trap composed of 58 places in 380 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:07] [INFO ] Deduced a trap composed of 53 places in 346 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:07] [INFO ] Deduced a trap composed of 17 places in 267 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:07] [INFO ] Deduced a trap composed of 22 places in 277 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:08] [INFO ] Deduced a trap composed of 21 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:08] [INFO ] Deduced a trap composed of 54 places in 363 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:09] [INFO ] Deduced a trap composed of 54 places in 242 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:09] [INFO ] Deduced a trap composed of 67 places in 264 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:10] [INFO ] Deduced a trap composed of 43 places in 352 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:10] [INFO ] Deduced a trap composed of 47 places in 350 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:11] [INFO ] Deduced a trap composed of 47 places in 333 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:11] [INFO ] Deduced a trap composed of 15 places in 301 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:12] [INFO ] Deduced a trap composed of 24 places in 337 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:12] [INFO ] Deduced a trap composed of 27 places in 329 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:12] [INFO ] Deduced a trap composed of 29 places in 322 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:13] [INFO ] Deduced a trap composed of 16 places in 324 ms of which 20 ms to minimize.
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD365 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/154 constraints. Problems are: Problem set: 20 solved, 375 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:14] [INFO ] Deduced a trap composed of 47 places in 381 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:15] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:16] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:16] [INFO ] Deduced a trap composed of 22 places in 330 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:17] [INFO ] Deduced a trap composed of 25 places in 324 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:17] [INFO ] Deduced a trap composed of 27 places in 313 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:17] [INFO ] Deduced a trap composed of 17 places in 219 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:18] [INFO ] Deduced a trap composed of 19 places in 286 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:18] [INFO ] Deduced a trap composed of 17 places in 289 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:18] [INFO ] Deduced a trap composed of 16 places in 273 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:19] [INFO ] Deduced a trap composed of 23 places in 181 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:19] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:19] [INFO ] Deduced a trap composed of 26 places in 258 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:19] [INFO ] Deduced a trap composed of 31 places in 242 ms of which 22 ms to minimize.
SMT process timed out in 60134ms, After SMT, problems are : Problem set: 20 solved, 375 unsolved
Search for dead transitions found 20 dead transitions in 60136ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 454/470 places, 376/412 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 453 transition count 376
Applied a total of 1 rules in 15 ms. Remains 453 /454 variables (removed 1) and now considering 376/376 (removed 0) transitions.
// Phase 1: matrix 376 rows 453 cols
[2025-05-30 05:24:19] [INFO ] Computed 96 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:20] [INFO ] Implicit Places using invariants in 580 ms returned []
[2025-05-30 05:24:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:22] [INFO ] Implicit Places using invariants and state equation in 2195 ms returned [65, 66]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 2780 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 451/470 places, 376/412 transitions.
Applied a total of 0 rules in 14 ms. Remains 451 /451 variables (removed 0) and now considering 376/376 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 66553 ms. Remains : 451/470 places, 376/412 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-06
Stuttering criterion allowed to conclude after 125 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-06 finished in 66744 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 457 transition count 399
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 457 transition count 399
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 454 transition count 396
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 454 transition count 396
Applied a total of 32 rules in 46 ms. Remains 454 /470 variables (removed 16) and now considering 396/412 (removed 16) transitions.
// Phase 1: matrix 396 rows 454 cols
[2025-05-30 05:24:22] [INFO ] Computed 95 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:23] [INFO ] Implicit Places using invariants in 601 ms returned []
[2025-05-30 05:24:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:24:26] [INFO ] Implicit Places using invariants and state equation in 3068 ms returned []
Implicit Place search using SMT with State Equation took 3671 ms to find 0 implicit places.
Running 395 sub problems to find dead transitions.
[2025-05-30 05:24:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:49] [INFO ] Deduced a trap composed of 52 places in 243 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:49] [INFO ] Deduced a trap composed of 55 places in 229 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:50] [INFO ] Deduced a trap composed of 55 places in 344 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:50] [INFO ] Deduced a trap composed of 55 places in 226 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:50] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:51] [INFO ] Deduced a trap composed of 55 places in 232 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:51] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:51] [INFO ] Deduced a trap composed of 55 places in 230 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:51] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:52] [INFO ] Deduced a trap composed of 55 places in 247 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:52] [INFO ] Deduced a trap composed of 55 places in 368 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:52] [INFO ] Deduced a trap composed of 55 places in 346 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:53] [INFO ] Deduced a trap composed of 55 places in 341 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:53] [INFO ] Deduced a trap composed of 55 places in 344 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:53] [INFO ] Deduced a trap composed of 55 places in 224 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:54] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:54] [INFO ] Deduced a trap composed of 76 places in 251 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:54] [INFO ] Deduced a trap composed of 76 places in 244 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:55] [INFO ] Deduced a trap composed of 76 places in 235 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:55] [INFO ] Deduced a trap composed of 55 places in 376 ms of which 70 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:24:56] [INFO ] Deduced a trap composed of 73 places in 373 ms of which 81 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 454/850 variables, and 116 constraints, problems are : Problem set: 0 solved, 395 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 395/395 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/453 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/453 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 2 (OVERLAPS) 1/454 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/454 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 395 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/454 variables, 21/116 constraints. Problems are: Problem set: 0 solved, 395 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:04] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:04] [INFO ] Deduced a trap composed of 76 places in 199 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:04] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:04] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:04] [INFO ] Deduced a trap composed of 55 places in 218 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:05] [INFO ] Deduced a trap composed of 55 places in 287 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:05] [INFO ] Deduced a trap composed of 55 places in 335 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:05] [INFO ] Deduced a trap composed of 55 places in 349 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:06] [INFO ] Deduced a trap composed of 55 places in 310 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:06] [INFO ] Deduced a trap composed of 74 places in 584 ms of which 322 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:07] [INFO ] Deduced a trap composed of 74 places in 341 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:07] [INFO ] Deduced a trap composed of 74 places in 397 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:08] [INFO ] Deduced a trap composed of 74 places in 380 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:08] [INFO ] Deduced a trap composed of 69 places in 343 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:08] [INFO ] Deduced a trap composed of 74 places in 256 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:09] [INFO ] Deduced a trap composed of 74 places in 375 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:09] [INFO ] Deduced a trap composed of 74 places in 386 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:09] [INFO ] Deduced a trap composed of 74 places in 410 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:10] [INFO ] Deduced a trap composed of 74 places in 356 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:10] [INFO ] Deduced a trap composed of 74 places in 387 ms of which 115 ms to minimize.
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD379 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/454 variables, 20/136 constraints. Problems are: Problem set: 11 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:11] [INFO ] Deduced a trap composed of 73 places in 354 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:11] [INFO ] Deduced a trap composed of 76 places in 355 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:12] [INFO ] Deduced a trap composed of 76 places in 328 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:12] [INFO ] Deduced a trap composed of 73 places in 332 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:12] [INFO ] Deduced a trap composed of 76 places in 236 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:13] [INFO ] Deduced a trap composed of 76 places in 235 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:13] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:13] [INFO ] Deduced a trap composed of 52 places in 394 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:14] [INFO ] Deduced a trap composed of 55 places in 237 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:14] [INFO ] Deduced a trap composed of 55 places in 359 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:14] [INFO ] Deduced a trap composed of 55 places in 249 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:15] [INFO ] Deduced a trap composed of 54 places in 330 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:15] [INFO ] Deduced a trap composed of 65 places in 375 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:15] [INFO ] Deduced a trap composed of 65 places in 246 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:15] [INFO ] Deduced a trap composed of 65 places in 253 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:16] [INFO ] Deduced a trap composed of 66 places in 252 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:16] [INFO ] Deduced a trap composed of 65 places in 384 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:16] [INFO ] Deduced a trap composed of 66 places in 258 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:17] [INFO ] Deduced a trap composed of 66 places in 390 ms of which 95 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:17] [INFO ] Deduced a trap composed of 66 places in 387 ms of which 98 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/454 variables, 20/156 constraints. Problems are: Problem set: 11 solved, 384 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:18] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:18] [INFO ] Deduced a trap composed of 73 places in 354 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:18] [INFO ] Deduced a trap composed of 73 places in 224 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:19] [INFO ] Deduced a trap composed of 73 places in 374 ms of which 87 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:20] [INFO ] Deduced a trap composed of 54 places in 325 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:20] [INFO ] Deduced a trap composed of 55 places in 218 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:20] [INFO ] Deduced a trap composed of 73 places in 335 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:20] [INFO ] Deduced a trap composed of 74 places in 372 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:21] [INFO ] Deduced a trap composed of 69 places in 326 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:21] [INFO ] Deduced a trap composed of 74 places in 298 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:22] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:22] [INFO ] Deduced a trap composed of 54 places in 333 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:23] [INFO ] Deduced a trap composed of 58 places in 331 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:23] [INFO ] Deduced a trap composed of 53 places in 377 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:23] [INFO ] Deduced a trap composed of 22 places in 341 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:24] [INFO ] Deduced a trap composed of 23 places in 291 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:25] [INFO ] Deduced a trap composed of 34 places in 233 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:25] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:25] [INFO ] Deduced a trap composed of 39 places in 205 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:26] [INFO ] Deduced a trap composed of 40 places in 233 ms of which 15 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/454 variables, 20/176 constraints. Problems are: Problem set: 11 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 454/850 variables, and 176 constraints, problems are : Problem set: 11 solved, 384 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/454 constraints, PredecessorRefiner: 0/395 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60081ms problems are : Problem set: 11 solved, 384 unsolved
Search for dead transitions found 11 dead transitions in 60082ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 454/470 places, 385/412 transitions.
Applied a total of 0 rules in 13 ms. Remains 454 /454 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63815 ms. Remains : 454/470 places, 385/412 transitions.
Stuttering acceptance computed with spot in 204 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 729 reset in 272 ms.
Product exploration explored 100000 steps with 733 reset in 463 ms.
Computed a total of 439 stabilizing places and 370 stable transitions
Graph (complete) has 1010 edges and 454 vertex of which 453 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 439 stabilizing places and 370 stable transitions
Detected a total of 439/454 stabilizing places and 370/385 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 15 factoid took 404 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (290 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (51 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2214 steps, run visited all 1 properties in 23 ms. (steps per millisecond=96 )
Probabilistic random walk after 2214 steps, saw 1910 distinct states, run finished after 23 ms. (steps per millisecond=96 ) properties seen :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 15 factoid took 465 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLFireability-08 finished in 65859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(p0))'
Support contains 1 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (trivial) has 221 edges and 470 vertex of which 6 / 470 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1046 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 463 transition count 353
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 412 transition count 353
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 104 place count 412 transition count 254
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 2 with 216 rules applied. Total rules applied 320 place count 295 transition count 254
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 332 place count 283 transition count 242
Iterating global reduction 2 with 12 rules applied. Total rules applied 344 place count 283 transition count 242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 344 place count 283 transition count 241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 346 place count 282 transition count 241
Performed 114 Post agglomeration using F-continuation condition.Transition count delta: 114
Deduced a syphon composed of 114 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 578 place count 164 transition count 127
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 580 place count 163 transition count 131
Applied a total of 580 rules in 68 ms. Remains 163 /470 variables (removed 307) and now considering 131/412 (removed 281) transitions.
// Phase 1: matrix 131 rows 163 cols
[2025-05-30 05:25:28] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:25:29] [INFO ] Implicit Places using invariants in 218 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 221 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/470 places, 131/412 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 297 ms. Remains : 144/470 places, 131/412 transitions.
Initial state reduction rules removed 1 formulas.
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-09
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-09 finished in 362 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(p1 U (G(p1)||(p1&&(p2||X(p2)))))))))'
Support contains 2 out of 470 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Graph (trivial) has 219 edges and 470 vertex of which 6 / 470 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1046 edges and 465 vertex of which 464 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 53 place count 463 transition count 353
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 104 place count 412 transition count 353
Performed 97 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 97 Pre rules applied. Total rules applied 104 place count 412 transition count 256
Deduced a syphon composed of 97 places in 0 ms
Ensure Unique test removed 18 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 212 rules applied. Total rules applied 316 place count 297 transition count 256
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 327 place count 286 transition count 245
Iterating global reduction 2 with 11 rules applied. Total rules applied 338 place count 286 transition count 245
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 338 place count 286 transition count 244
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 340 place count 285 transition count 244
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 576 place count 165 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 578 place count 164 transition count 132
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 579 place count 163 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 580 place count 162 transition count 131
Applied a total of 580 rules in 54 ms. Remains 162 /470 variables (removed 308) and now considering 131/412 (removed 281) transitions.
// Phase 1: matrix 131 rows 162 cols
[2025-05-30 05:25:29] [INFO ] Computed 72 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:25:29] [INFO ] Implicit Places using invariants in 189 ms returned [6, 7, 31, 32, 33, 34, 41, 42, 43, 48, 49, 50, 51, 52, 53, 54]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 192 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/470 places, 131/412 transitions.
Applied a total of 0 rules in 10 ms. Remains 146 /146 variables (removed 0) and now considering 131/131 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 262 ms. Remains : 146/470 places, 131/412 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-10
Stuttering criterion allowed to conclude after 17 steps with 3 reset in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-10 finished in 411 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X(X(G(p1))))))))'
Support contains 3 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 459 transition count 401
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 459 transition count 401
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 456 transition count 398
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 456 transition count 398
Applied a total of 28 rules in 37 ms. Remains 456 /470 variables (removed 14) and now considering 398/412 (removed 14) transitions.
// Phase 1: matrix 398 rows 456 cols
[2025-05-30 05:25:29] [INFO ] Computed 95 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:25:29] [INFO ] Implicit Places using invariants in 369 ms returned []
[2025-05-30 05:25:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:25:32] [INFO ] Implicit Places using invariants and state equation in 3002 ms returned []
Implicit Place search using SMT with State Equation took 3374 ms to find 0 implicit places.
Running 397 sub problems to find dead transitions.
[2025-05-30 05:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/455 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 1/456 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/456 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:54] [INFO ] Deduced a trap composed of 52 places in 379 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:54] [INFO ] Deduced a trap composed of 52 places in 337 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:55] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:55] [INFO ] Deduced a trap composed of 73 places in 348 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:55] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:56] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:56] [INFO ] Deduced a trap composed of 73 places in 324 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:56] [INFO ] Deduced a trap composed of 73 places in 310 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:57] [INFO ] Deduced a trap composed of 73 places in 320 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:57] [INFO ] Deduced a trap composed of 73 places in 327 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:57] [INFO ] Deduced a trap composed of 73 places in 333 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:58] [INFO ] Deduced a trap composed of 73 places in 307 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:58] [INFO ] Deduced a trap composed of 73 places in 295 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:58] [INFO ] Deduced a trap composed of 73 places in 266 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:59] [INFO ] Deduced a trap composed of 73 places in 304 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:59] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:25:59] [INFO ] Deduced a trap composed of 73 places in 353 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:00] [INFO ] Deduced a trap composed of 73 places in 334 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:00] [INFO ] Deduced a trap composed of 71 places in 330 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:00] [INFO ] Deduced a trap composed of 66 places in 317 ms of which 65 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/456 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 397 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:01] [INFO ] Deduced a trap composed of 73 places in 355 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:01] [INFO ] Deduced a trap composed of 73 places in 253 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:02] [INFO ] Deduced a trap composed of 73 places in 350 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:02] [INFO ] Deduced a trap composed of 73 places in 229 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:02] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:03] [INFO ] Deduced a trap composed of 55 places in 320 ms of which 40 ms to minimize.
SMT process timed out in 30152ms, After SMT, problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 30153ms
Starting structural reductions in LTL mode, iteration 1 : 456/470 places, 398/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33567 ms. Remains : 456/470 places, 398/412 transitions.
Stuttering acceptance computed with spot in 294 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-11
Product exploration explored 100000 steps with 50000 reset in 252 ms.
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Computed a total of 441 stabilizing places and 383 stable transitions
Graph (complete) has 1036 edges and 456 vertex of which 455 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 441 stabilizing places and 383 stable transitions
Detected a total of 441/456 stabilizing places and 383/398 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 15 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA BusinessProcesses-PT-12-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLFireability-11 finished in 34445 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X((G(p1)||p0))) U p2)&&X(p3)))'
Support contains 6 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 458 transition count 400
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 458 transition count 400
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 455 transition count 397
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 455 transition count 397
Applied a total of 30 rules in 42 ms. Remains 455 /470 variables (removed 15) and now considering 397/412 (removed 15) transitions.
// Phase 1: matrix 397 rows 455 cols
[2025-05-30 05:26:04] [INFO ] Computed 95 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:04] [INFO ] Implicit Places using invariants in 400 ms returned []
[2025-05-30 05:26:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:26:06] [INFO ] Implicit Places using invariants and state equation in 2593 ms returned []
Implicit Place search using SMT with State Equation took 2995 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2025-05-30 05:26:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:29] [INFO ] Deduced a trap composed of 52 places in 235 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:29] [INFO ] Deduced a trap composed of 73 places in 354 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:29] [INFO ] Deduced a trap composed of 73 places in 341 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:30] [INFO ] Deduced a trap composed of 73 places in 323 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:30] [INFO ] Deduced a trap composed of 73 places in 235 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:30] [INFO ] Deduced a trap composed of 52 places in 225 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:30] [INFO ] Deduced a trap composed of 73 places in 228 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:31] [INFO ] Deduced a trap composed of 73 places in 351 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:31] [INFO ] Deduced a trap composed of 73 places in 360 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:31] [INFO ] Deduced a trap composed of 73 places in 313 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:32] [INFO ] Deduced a trap composed of 73 places in 330 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:32] [INFO ] Deduced a trap composed of 73 places in 226 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:32] [INFO ] Deduced a trap composed of 73 places in 313 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:33] [INFO ] Deduced a trap composed of 73 places in 340 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:33] [INFO ] Deduced a trap composed of 73 places in 338 ms of which 106 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:33] [INFO ] Deduced a trap composed of 52 places in 351 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:34] [INFO ] Deduced a trap composed of 73 places in 350 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:34] [INFO ] Deduced a trap composed of 52 places in 296 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:34] [INFO ] Deduced a trap composed of 73 places in 322 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:35] [INFO ] Deduced a trap composed of 73 places in 306 ms of which 75 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:36] [INFO ] Deduced a trap composed of 55 places in 234 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:36] [INFO ] Deduced a trap composed of 55 places in 231 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:36] [INFO ] Deduced a trap composed of 55 places in 336 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:37] [INFO ] Deduced a trap composed of 55 places in 324 ms of which 59 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/852 variables, and 119 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 24/24 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 24/119 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:43] [INFO ] Deduced a trap composed of 76 places in 345 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:43] [INFO ] Deduced a trap composed of 76 places in 354 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:44] [INFO ] Deduced a trap composed of 76 places in 356 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:44] [INFO ] Deduced a trap composed of 71 places in 266 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:45] [INFO ] Deduced a trap composed of 71 places in 361 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:45] [INFO ] Deduced a trap composed of 75 places in 363 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:45] [INFO ] Deduced a trap composed of 75 places in 353 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:46] [INFO ] Deduced a trap composed of 43 places in 335 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:46] [INFO ] Deduced a trap composed of 75 places in 309 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:46] [INFO ] Deduced a trap composed of 75 places in 306 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:47] [INFO ] Deduced a trap composed of 75 places in 301 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:47] [INFO ] Deduced a trap composed of 75 places in 298 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:47] [INFO ] Deduced a trap composed of 75 places in 298 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:48] [INFO ] Deduced a trap composed of 75 places in 292 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:48] [INFO ] Deduced a trap composed of 75 places in 314 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:48] [INFO ] Deduced a trap composed of 75 places in 304 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:48] [INFO ] Deduced a trap composed of 75 places in 292 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:49] [INFO ] Deduced a trap composed of 75 places in 289 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:49] [INFO ] Deduced a trap composed of 75 places in 255 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:49] [INFO ] Deduced a trap composed of 73 places in 295 ms of which 63 ms to minimize.
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/139 constraints. Problems are: Problem set: 9 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:50] [INFO ] Deduced a trap composed of 73 places in 239 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:51] [INFO ] Deduced a trap composed of 73 places in 244 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:51] [INFO ] Deduced a trap composed of 73 places in 247 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:51] [INFO ] Deduced a trap composed of 76 places in 246 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:51] [INFO ] Deduced a trap composed of 76 places in 375 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:52] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:52] [INFO ] Deduced a trap composed of 55 places in 354 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:52] [INFO ] Deduced a trap composed of 76 places in 353 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:53] [INFO ] Deduced a trap composed of 76 places in 352 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:53] [INFO ] Deduced a trap composed of 55 places in 334 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:54] [INFO ] Deduced a trap composed of 76 places in 329 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:54] [INFO ] Deduced a trap composed of 75 places in 329 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:54] [INFO ] Deduced a trap composed of 75 places in 239 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:55] [INFO ] Deduced a trap composed of 65 places in 359 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:55] [INFO ] Deduced a trap composed of 65 places in 348 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:55] [INFO ] Deduced a trap composed of 65 places in 329 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:56] [INFO ] Deduced a trap composed of 66 places in 320 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:56] [INFO ] Deduced a trap composed of 65 places in 342 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:56] [INFO ] Deduced a trap composed of 66 places in 331 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:57] [INFO ] Deduced a trap composed of 66 places in 298 ms of which 57 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/159 constraints. Problems are: Problem set: 9 solved, 387 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:57] [INFO ] Deduced a trap composed of 74 places in 366 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:58] [INFO ] Deduced a trap composed of 76 places in 256 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:58] [INFO ] Deduced a trap composed of 76 places in 247 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:59] [INFO ] Deduced a trap composed of 76 places in 624 ms of which 341 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:59] [INFO ] Deduced a trap composed of 76 places in 230 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:59] [INFO ] Deduced a trap composed of 76 places in 224 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:26:59] [INFO ] Deduced a trap composed of 76 places in 251 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:00] [INFO ] Deduced a trap composed of 76 places in 244 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:00] [INFO ] Deduced a trap composed of 76 places in 244 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:00] [INFO ] Deduced a trap composed of 71 places in 246 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:00] [INFO ] Deduced a trap composed of 71 places in 257 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:01] [INFO ] Deduced a trap composed of 71 places in 345 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:01] [INFO ] Deduced a trap composed of 71 places in 339 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:01] [INFO ] Deduced a trap composed of 71 places in 245 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:02] [INFO ] Deduced a trap composed of 71 places in 233 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:02] [INFO ] Deduced a trap composed of 71 places in 226 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:02] [INFO ] Deduced a trap composed of 71 places in 322 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:02] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:03] [INFO ] Deduced a trap composed of 68 places in 232 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:03] [INFO ] Deduced a trap composed of 68 places in 226 ms of which 33 ms to minimize.
Problem TDEAD343 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/179 constraints. Problems are: Problem set: 16 solved, 380 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:04] [INFO ] Deduced a trap composed of 54 places in 294 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:04] [INFO ] Deduced a trap composed of 73 places in 341 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:05] [INFO ] Deduced a trap composed of 73 places in 279 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:05] [INFO ] Deduced a trap composed of 73 places in 235 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:05] [INFO ] Deduced a trap composed of 73 places in 349 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:06] [INFO ] Deduced a trap composed of 73 places in 251 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:06] [INFO ] Deduced a trap composed of 73 places in 371 ms of which 102 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:06] [INFO ] Deduced a trap composed of 73 places in 331 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:07] [INFO ] Deduced a trap composed of 18 places in 278 ms of which 33 ms to minimize.
SMT process timed out in 60321ms, After SMT, problems are : Problem set: 16 solved, 380 unsolved
Search for dead transitions found 16 dead transitions in 60322ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 455/470 places, 381/412 transitions.
Applied a total of 0 rules in 9 ms. Remains 455 /455 variables (removed 0) and now considering 381/381 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63370 ms. Remains : 455/470 places, 381/412 transitions.
Stuttering acceptance computed with spot in 315 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-12
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-12 finished in 63705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||G(p1))))'
Support contains 5 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 458 transition count 400
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 458 transition count 400
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 455 transition count 397
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 455 transition count 397
Applied a total of 30 rules in 28 ms. Remains 455 /470 variables (removed 15) and now considering 397/412 (removed 15) transitions.
// Phase 1: matrix 397 rows 455 cols
[2025-05-30 05:27:07] [INFO ] Computed 95 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:08] [INFO ] Implicit Places using invariants in 537 ms returned []
[2025-05-30 05:27:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:27:10] [INFO ] Implicit Places using invariants and state equation in 2733 ms returned []
Implicit Place search using SMT with State Equation took 3273 ms to find 0 implicit places.
Running 396 sub problems to find dead transitions.
[2025-05-30 05:27:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 54/93 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:34] [INFO ] Deduced a trap composed of 52 places in 349 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:34] [INFO ] Deduced a trap composed of 52 places in 355 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:35] [INFO ] Deduced a trap composed of 52 places in 348 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:35] [INFO ] Deduced a trap composed of 52 places in 342 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:35] [INFO ] Deduced a trap composed of 52 places in 323 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:36] [INFO ] Deduced a trap composed of 52 places in 340 ms of which 61 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:36] [INFO ] Deduced a trap composed of 52 places in 331 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:36] [INFO ] Deduced a trap composed of 52 places in 306 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:37] [INFO ] Deduced a trap composed of 52 places in 307 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:37] [INFO ] Deduced a trap composed of 52 places in 307 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:37] [INFO ] Deduced a trap composed of 56 places in 289 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:38] [INFO ] Deduced a trap composed of 56 places in 302 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:38] [INFO ] Deduced a trap composed of 54 places in 340 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:38] [INFO ] Deduced a trap composed of 56 places in 330 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:39] [INFO ] Deduced a trap composed of 56 places in 333 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:39] [INFO ] Deduced a trap composed of 56 places in 368 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:40] [INFO ] Deduced a trap composed of 56 places in 315 ms of which 52 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:40] [INFO ] Deduced a trap composed of 20 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:40] [INFO ] Deduced a trap composed of 52 places in 342 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:41] [INFO ] Deduced a trap composed of 52 places in 354 ms of which 65 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 455/852 variables, and 115 constraints, problems are : Problem set: 0 solved, 396 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 54/54 constraints, Generalized P Invariants (flows): 41/41 constraints, State Equation: 0/455 constraints, PredecessorRefiner: 396/396 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/454 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/454 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 2 (OVERLAPS) 1/455 variables, 54/93 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/455 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 396 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/455 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:48] [INFO ] Deduced a trap composed of 73 places in 278 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:48] [INFO ] Deduced a trap composed of 73 places in 288 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:49] [INFO ] Deduced a trap composed of 68 places in 316 ms of which 71 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:49] [INFO ] Deduced a trap composed of 66 places in 265 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:49] [INFO ] Deduced a trap composed of 66 places in 268 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:50] [INFO ] Deduced a trap composed of 71 places in 348 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:50] [INFO ] Deduced a trap composed of 71 places in 322 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:50] [INFO ] Deduced a trap composed of 71 places in 321 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:50] [INFO ] Deduced a trap composed of 71 places in 297 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:51] [INFO ] Deduced a trap composed of 71 places in 313 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:51] [INFO ] Deduced a trap composed of 71 places in 316 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:51] [INFO ] Deduced a trap composed of 71 places in 309 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:52] [INFO ] Deduced a trap composed of 71 places in 289 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:52] [INFO ] Deduced a trap composed of 71 places in 281 ms of which 60 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:52] [INFO ] Deduced a trap composed of 71 places in 325 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:53] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:53] [INFO ] Deduced a trap composed of 71 places in 329 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:53] [INFO ] Deduced a trap composed of 71 places in 323 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:54] [INFO ] Deduced a trap composed of 71 places in 320 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:54] [INFO ] Deduced a trap composed of 71 places in 317 ms of which 64 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/455 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:55] [INFO ] Deduced a trap composed of 54 places in 309 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:55] [INFO ] Deduced a trap composed of 54 places in 295 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:56] [INFO ] Deduced a trap composed of 56 places in 331 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:56] [INFO ] Deduced a trap composed of 56 places in 345 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:56] [INFO ] Deduced a trap composed of 56 places in 324 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:57] [INFO ] Deduced a trap composed of 73 places in 340 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:57] [INFO ] Deduced a trap composed of 73 places in 366 ms of which 78 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:57] [INFO ] Deduced a trap composed of 73 places in 353 ms of which 75 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:58] [INFO ] Deduced a trap composed of 56 places in 368 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:58] [INFO ] Deduced a trap composed of 56 places in 361 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:59] [INFO ] Deduced a trap composed of 54 places in 356 ms of which 66 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:27:59] [INFO ] Deduced a trap composed of 54 places in 350 ms of which 64 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:00] [INFO ] Deduced a trap composed of 54 places in 326 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:00] [INFO ] Deduced a trap composed of 73 places in 374 ms of which 98 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:00] [INFO ] Deduced a trap composed of 73 places in 432 ms of which 158 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:01] [INFO ] Deduced a trap composed of 68 places in 354 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:01] [INFO ] Deduced a trap composed of 73 places in 456 ms of which 173 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:02] [INFO ] Deduced a trap composed of 68 places in 315 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:02] [INFO ] Deduced a trap composed of 73 places in 374 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:02] [INFO ] Deduced a trap composed of 73 places in 371 ms of which 89 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 20/155 constraints. Problems are: Problem set: 0 solved, 396 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:03] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:03] [INFO ] Deduced a trap composed of 75 places in 201 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:03] [INFO ] Deduced a trap composed of 75 places in 247 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:04] [INFO ] Deduced a trap composed of 75 places in 388 ms of which 105 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:04] [INFO ] Deduced a trap composed of 54 places in 350 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:04] [INFO ] Deduced a trap composed of 54 places in 330 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:05] [INFO ] Deduced a trap composed of 54 places in 344 ms of which 62 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:05] [INFO ] Deduced a trap composed of 56 places in 332 ms of which 59 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:06] [INFO ] Deduced a trap composed of 56 places in 342 ms of which 58 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:06] [INFO ] Deduced a trap composed of 56 places in 320 ms of which 57 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:06] [INFO ] Deduced a trap composed of 56 places in 306 ms of which 55 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:07] [INFO ] Deduced a trap composed of 75 places in 321 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:07] [INFO ] Deduced a trap composed of 75 places in 351 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:07] [INFO ] Deduced a trap composed of 75 places in 357 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:08] [INFO ] Deduced a trap composed of 75 places in 337 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:08] [INFO ] Deduced a trap composed of 75 places in 350 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:08] [INFO ] Deduced a trap composed of 70 places in 312 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:09] [INFO ] Deduced a trap composed of 75 places in 340 ms of which 72 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:09] [INFO ] Deduced a trap composed of 46 places in 357 ms of which 68 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:10] [INFO ] Deduced a trap composed of 75 places in 353 ms of which 74 ms to minimize.
Problem TDEAD342 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 20/175 constraints. Problems are: Problem set: 4 solved, 392 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:11] [INFO ] Deduced a trap composed of 77 places in 350 ms of which 68 ms to minimize.
SMT process timed out in 60339ms, After SMT, problems are : Problem set: 4 solved, 392 unsolved
Search for dead transitions found 4 dead transitions in 60342ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 455/470 places, 393/412 transitions.
Applied a total of 0 rules in 14 ms. Remains 455 /455 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63658 ms. Remains : 455/470 places, 393/412 transitions.
Stuttering acceptance computed with spot in 220 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-13 finished in 63903 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!p0)||(X(G(p1)) U (p2&&F(p3)))))'
Support contains 4 out of 470 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 470/470 places, 412/412 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 461 transition count 403
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 461 transition count 403
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 459 transition count 401
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 459 transition count 401
Applied a total of 22 rules in 41 ms. Remains 459 /470 variables (removed 11) and now considering 401/412 (removed 11) transitions.
// Phase 1: matrix 401 rows 459 cols
[2025-05-30 05:28:11] [INFO ] Computed 95 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:12] [INFO ] Implicit Places using invariants in 638 ms returned []
[2025-05-30 05:28:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-30 05:28:14] [INFO ] Implicit Places using invariants and state equation in 2624 ms returned []
Implicit Place search using SMT with State Equation took 3263 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2025-05-30 05:28:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 52/91 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:39] [INFO ] Deduced a trap composed of 53 places in 359 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:39] [INFO ] Deduced a trap composed of 75 places in 377 ms of which 79 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:39] [INFO ] Deduced a trap composed of 75 places in 374 ms of which 86 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:40] [INFO ] Deduced a trap composed of 75 places in 352 ms of which 77 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:40] [INFO ] Deduced a trap composed of 75 places in 351 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:41] [INFO ] Deduced a trap composed of 75 places in 369 ms of which 81 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:41] [INFO ] Deduced a trap composed of 75 places in 342 ms of which 76 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:41] [INFO ] Deduced a trap composed of 53 places in 320 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:42] [INFO ] Deduced a trap composed of 75 places in 359 ms of which 101 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:42] [INFO ] Deduced a trap composed of 75 places in 362 ms of which 80 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:42] [INFO ] Deduced a trap composed of 75 places in 370 ms of which 82 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:43] [INFO ] Deduced a trap composed of 75 places in 308 ms of which 48 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:43] [INFO ] Deduced a trap composed of 75 places in 370 ms of which 89 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:44] [INFO ] Deduced a trap composed of 75 places in 363 ms of which 85 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:44] [INFO ] Deduced a trap composed of 74 places in 330 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:44] [INFO ] Deduced a trap composed of 74 places in 346 ms of which 88 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:28:45] [INFO ] Deduced a trap composed of 74 places in 321 ms of which 60 ms to minimize.
SMT process timed out in 30287ms, After SMT, problems are : Problem set: 0 solved, 400 unsolved
Search for dead transitions found 0 dead transitions in 30289ms
Starting structural reductions in LTL mode, iteration 1 : 459/470 places, 401/412 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33595 ms. Remains : 459/470 places, 401/412 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (AND p0 (NOT p2)) (AND p0 (NOT p3))), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)) (AND p0 (NOT p3))), (AND (NOT p3) p0), true, (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15
Entered a terminal (fully accepting) state of product in 96051 steps with 700 reset in 272 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 34256 ms.
All properties solved by simple procedures.
Total runtime 528320 ms.

BK_STOP 1748582925882

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="BusinessProcesses-PT-12"
export BK_EXAMINATION="LTLFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813300092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;