Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r044-tall-174854027700052.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 CloudDeployment-PT-5a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r044-tall-174854027700052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K 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.7K 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 230K 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 CloudDeployment-PT-5a-LTLFireability-00
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-01
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-02
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-03
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-04
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-05
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-06
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-07
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-08
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-09
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-10
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-11
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-12
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-13
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-14
FORMULA_NAME CloudDeployment-PT-5a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748557033808

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CloudDeployment-PT-5a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-29 22:17:14] [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-29 22:17:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 22:17:15] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2025-05-29 22:17:15] [INFO ] Transformed 180 places.
[2025-05-29 22:17:15] [INFO ] Transformed 675 transitions.
[2025-05-29 22:17:15] [INFO ] Found NUPN structural information;
[2025-05-29 22:17:15] [INFO ] Parsed PT model containing 180 places and 675 transitions and 3959 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 80 transitions
Reduce redundant transitions removed 80 transitions.
FORMULA CloudDeployment-PT-5a-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-5a-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 180 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 595/595 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 170 transition count 595
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 13 place count 167 transition count 592
Iterating global reduction 1 with 3 rules applied. Total rules applied 16 place count 167 transition count 592
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 18 place count 165 transition count 590
Iterating global reduction 1 with 2 rules applied. Total rules applied 20 place count 165 transition count 590
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 164 transition count 589
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 164 transition count 589
Drop transitions (Redundant composition of simpler transitions.) removed 55 transitions
Redundant transition composition rules discarded 55 transitions
Iterating global reduction 1 with 55 rules applied. Total rules applied 77 place count 164 transition count 534
Applied a total of 77 rules in 60 ms. Remains 164 /180 variables (removed 16) and now considering 534/595 (removed 61) transitions.
[2025-05-29 22:17:15] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2025-05-29 22:17:15] [INFO ] Computed 20 invariants in 25 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:17:15] [INFO ] Implicit Places using invariants in 223 ms returned []
[2025-05-29 22:17:15] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:17:15] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:17:16] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 628 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:17:16] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:17:16] [INFO ] Invariant cache hit.
[2025-05-29 22:17:16] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30745 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61319ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 61335ms
Starting structural reductions in LTL mode, iteration 1 : 164/180 places, 534/595 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62047 ms. Remains : 164/180 places, 534/595 transitions.
Support contains 37 out of 164 places after structural reductions.
[2025-05-29 22:18:17] [INFO ] Flatten gal took : 67 ms
[2025-05-29 22:18:17] [INFO ] Flatten gal took : 42 ms
[2025-05-29 22:18:17] [INFO ] Input system was already deterministic with 534 transitions.
Support contains 36 out of 164 places (down from 37) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 29 to 28
RANDOM walk for 40000 steps (519 resets) in 2035 ms. (19 steps per ms) remains 5/28 properties
BEST_FIRST walk for 36511 steps (40 resets) in 179 ms. (202 steps per ms) remains 0/5 properties
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 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(p1)&&p0) U X((p2||G(p3)))) U X(p4)))'
Support contains 9 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:18:18] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:18:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:18:19] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-29 22:18:19] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:18:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:18:19] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:18:19] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:18:19] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:18:19] [INFO ] Invariant cache hit.
[2025-05-29 22:18:19] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60393ms
Finished structural reductions in LTL mode , in 1 iterations and 60742 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 676 ms :[(NOT p4), (AND (NOT p3) (NOT p2) (NOT p4)), (NOT p4), (AND (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (AND (NOT p2) (NOT p3) (NOT p4)), true, (NOT p3), (NOT p1), (AND (NOT p1) (NOT p3)), (AND (NOT p3) (NOT p2)), (AND (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 1562 ms.
Product exploration explored 100000 steps with 50000 reset in 1448 ms.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Detected a total of 79/164 stabilizing places and 364/534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/5 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2) (NOT p4) (NOT p3)), (X p2), (X (NOT p3)), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p4) (NOT p3)))), (X p4), (X (NOT (AND (NOT p0) (NOT p2) (NOT p4)))), (X (NOT (AND p0 (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p0) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p3))), (X (NOT (AND p0 (NOT p2) (NOT p4)))), (X (NOT (AND p0 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p4) p3))), (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p4) (NOT p3))))), (X (X p4)), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND (NOT p0) (NOT p4))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p0 (NOT p1) (NOT p4))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4) p3)))), (X (X (NOT p3))), (X (X (NOT (AND p0 (NOT p2) (NOT p4))))), (X (X (NOT (AND p0 (NOT p2) p3)))), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4) p3)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p3))))), (X (X (AND (NOT p1) (NOT p3)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p4) (G (NOT p4))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 45 factoid took 25 ms. Reduced automaton from 12 states, 29 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-5a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-5a-LTLFireability-00 finished in 64566 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(X(X(F(p0))))))'
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:19:23] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:19:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:19:23] [INFO ] Implicit Places using invariants in 79 ms returned []
[2025-05-29 22:19:23] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:19:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:19:23] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:19:23] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 320 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:19:23] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:19:23] [INFO ] Invariant cache hit.
[2025-05-29 22:19:23] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60405ms
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-02
Product exploration explored 100000 steps with 20000 reset in 822 ms.
Product exploration explored 100000 steps with 20000 reset in 771 ms.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 78 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1258 steps (17 resets) in 8 ms. (139 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:20:26] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:20:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:20:26] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-29 22:20:26] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:20:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:20:26] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:20:27] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:20:27] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:20:27] [INFO ] Invariant cache hit.
[2025-05-29 22:20:27] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60355ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60357ms
Finished structural reductions in LTL mode , in 1 iterations and 60697 ms. Remains : 164/164 places, 534/534 transitions.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 59 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 966 steps (12 resets) in 12 ms. (74 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 104 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 20000 reset in 768 ms.
Product exploration explored 100000 steps with 20000 reset in 768 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 195 edges and 164 vertex of which 46 / 164 are part of one of the 14 SCC in 3 ms
Free SCC test removed 32 places
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 84 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 128 transition count 422
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 128 transition count 422
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 15 places in 1 ms
Iterating global reduction 0 with 15 rules applied. Total rules applied 24 place count 128 transition count 502
Deduced a syphon composed of 15 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 120 place count 128 transition count 406
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 121 place count 128 transition count 406
Deduced a syphon composed of 16 places in 1 ms
Applied a total of 121 rules in 72 ms. Remains 128 /164 variables (removed 36) and now considering 406/534 (removed 128) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:21:30] [INFO ] Redundant transitions in 225 ms returned []
Running 405 sub problems to find dead transitions.
[2025-05-29 22:21:30] [INFO ] Flow matrix only has 186 transitions (discarded 220 similar events)
// Phase 1: matrix 186 rows 128 cols
[2025-05-29 22:21:30] [INFO ] Computed 20 invariants in 2 ms
[2025-05-29 22:21:30] [INFO ] State equation strengthened by 101 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/127 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/127 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD87 is UNSAT
At refinement iteration 2 (OVERLAPS) 185/312 variables, 127/147 constraints. Problems are: Problem set: 21 solved, 384 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/312 variables, 100/247 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/312 variables, 0/247 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 5 (OVERLAPS) 1/313 variables, 1/248 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/313 variables, 0/248 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 7 (OVERLAPS) 1/314 variables, 1/249 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/314 variables, 0/249 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 9 (OVERLAPS) 0/314 variables, 0/249 constraints. Problems are: Problem set: 21 solved, 384 unsolved
No progress, stopping.
After SMT solving in domain Real declared 314/314 variables, and 249 constraints, problems are : Problem set: 21 solved, 384 unsolved in 30008 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 128/128 constraints, ReadFeed: 101/101 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 384 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 15/15 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 16/127 variables, 5/20 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/20 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 4 (OVERLAPS) 185/312 variables, 127/147 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/312 variables, 100/247 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/312 variables, 384/631 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/312 variables, 0/631 constraints. Problems are: Problem set: 21 solved, 384 unsolved
At refinement iteration 8 (OVERLAPS) 1/313 variables, 1/632 constraints. Problems are: Problem set: 21 solved, 384 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/314 variables, and 632 constraints, problems are : Problem set: 21 solved, 384 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 128/128 constraints, ReadFeed: 100/101 constraints, PredecessorRefiner: 384/405 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 21 solved, 384 unsolved
Search for dead transitions found 21 dead transitions in 60224ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 128/164 places, 385/534 transitions.
Graph (complete) has 1239 edges and 128 vertex of which 112 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 112 /128 variables (removed 16) and now considering 385/385 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/164 places, 385/534 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60543 ms. Remains : 112/164 places, 385/534 transitions.
Built C files in :
/tmp/ltsmin6267007733429909285
[2025-05-29 22:22:30] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6267007733429909285
Running compilation step : cd /tmp/ltsmin6267007733429909285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 975 ms.
Running link step : cd /tmp/ltsmin6267007733429909285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin6267007733429909285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8679067385892244858.hoa' '--buchi-type=spotba'
LTSmin run took 180 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-02 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-5a-LTLFireability-02 finished in 188615 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((X((!p1 U (p2||G(!p1))))&&p0))))'
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 6 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:22:32] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2025-05-29 22:22:32] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:22:32] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-05-29 22:22:32] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:22:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:22:32] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:22:32] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:22:32] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:22:32] [INFO ] Invariant cache hit.
[2025-05-29 22:22:32] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30028 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60386ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-03
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLFireability-03 finished in 60929 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((F(p0)||X(p1)))&&G(p2)) U G(p1))))'
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 7 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:23:33] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:23:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:23:33] [INFO ] Implicit Places using invariants in 71 ms returned []
[2025-05-29 22:23:33] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:23:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:23:33] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:23:33] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 313 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:23:33] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:23:33] [INFO ] Invariant cache hit.
[2025-05-29 22:23:33] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 1.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 1.0)
(s156 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Finished structural reductions in LTL mode , in 1 iterations and 60701 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p1), (NOT p1), true, (AND (NOT p1) (NOT p0)), (AND p1 (NOT p2)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLFireability-04 finished in 61023 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&&F(p1)) U (p2 U X((p2||G(F(!p0)))))))'
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:24:34] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:24:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:24:34] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-05-29 22:24:34] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:24:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:24:34] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:24:34] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:24:34] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:24:34] [INFO ] Invariant cache hit.
[2025-05-29 22:24:34] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60379ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Finished structural reductions in LTL mode , in 1 iterations and 60691 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 357 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), (AND (NOT p2) p0), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 152 ms.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 140 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 338 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (530 resets) in 216 ms. (184 steps per ms) remains 4/9 properties
BEST_FIRST walk for 33173 steps (17 resets) in 130 ms. (253 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR p2 (NOT p0) p1))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 440 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 330 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 324 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:25:37] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:25:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:25:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-29 22:25:37] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:25:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:25:37] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:25:37] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:25:37] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:25:37] [INFO ] Invariant cache hit.
[2025-05-29 22:25:37] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60342ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60344ms
Finished structural reductions in LTL mode , in 1 iterations and 60662 ms. Remains : 164/164 places, 534/534 transitions.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p1), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 115 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
RANDOM walk for 40000 steps (527 resets) in 259 ms. (153 steps per ms) remains 4/9 properties
BEST_FIRST walk for 34863 steps (22 resets) in 62 ms. (553 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p1), (X (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) p0))), (X (NOT p0)), (X p1), (X (AND (NOT p2) (NOT p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (AND (NOT p2) (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR p2 (NOT p0) p1))), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p2 p0 p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT p1))]
Knowledge based reduction with 15 factoid took 433 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 329 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 355 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 104 ms.
Product exploration explored 100000 steps with 0 reset in 217 ms.
Applying partial POR strategy [false, true, true, false, true, true, true, true]
Stuttering acceptance computed with spot in 286 ms :[(AND p0 (NOT p2)), (AND (NOT p2) p0), (AND (NOT p2) (NOT p1) p0), (AND p0 (NOT p2)), p0, p0, (AND (NOT p1) p0), (AND p0 (NOT p1))]
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 187 edges and 164 vertex of which 42 / 164 are part of one of the 12 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 131 transition count 427
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 131 transition count 427
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -80
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 0 with 15 rules applied. Total rules applied 22 place count 131 transition count 507
Deduced a syphon composed of 15 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 0 with 96 rules applied. Total rules applied 118 place count 131 transition count 411
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 16 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 119 place count 131 transition count 411
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 119 rules in 49 ms. Remains 131 /164 variables (removed 33) and now considering 411/534 (removed 123) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:26:40] [INFO ] Redundant transitions in 249 ms returned []
Running 410 sub problems to find dead transitions.
[2025-05-29 22:26:40] [INFO ] Flow matrix only has 187 transitions (discarded 224 similar events)
// Phase 1: matrix 187 rows 131 cols
[2025-05-29 22:26:40] [INFO ] Computed 20 invariants in 2 ms
[2025-05-29 22:26:40] [INFO ] State equation strengthened by 97 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 410 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD90 is UNSAT
At refinement iteration 2 (OVERLAPS) 186/316 variables, 130/150 constraints. Problems are: Problem set: 21 solved, 389 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/316 variables, 96/246 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/316 variables, 0/246 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 5 (OVERLAPS) 1/317 variables, 1/247 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/317 variables, 0/247 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 7 (OVERLAPS) 1/318 variables, 1/248 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/318 variables, 0/248 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 9 (OVERLAPS) 0/318 variables, 0/248 constraints. Problems are: Problem set: 21 solved, 389 unsolved
No progress, stopping.
After SMT solving in domain Real declared 318/318 variables, and 248 constraints, problems are : Problem set: 21 solved, 389 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 131/131 constraints, ReadFeed: 97/97 constraints, PredecessorRefiner: 410/410 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 21 solved, 389 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 15/15 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/114 variables, 0/15 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 2 (OVERLAPS) 16/130 variables, 5/20 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/130 variables, 0/20 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 4 (OVERLAPS) 186/316 variables, 130/150 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/316 variables, 96/246 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/316 variables, 389/635 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 0/635 constraints. Problems are: Problem set: 21 solved, 389 unsolved
At refinement iteration 8 (OVERLAPS) 1/317 variables, 1/636 constraints. Problems are: Problem set: 21 solved, 389 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 1)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 1)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 timeout
0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 317/318 variables, and 636 constraints, problems are : Problem set: 21 solved, 389 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 131/131 constraints, ReadFeed: 96/97 constraints, PredecessorRefiner: 389/410 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 21 solved, 389 unsolved
Search for dead transitions found 21 dead transitions in 60261ms
Found 21 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 21 transitions
Dead transitions reduction (with SMT) removed 21 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 131/164 places, 390/534 transitions.
Graph (complete) has 1253 edges and 131 vertex of which 115 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.2 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 115 /131 variables (removed 16) and now considering 390/390 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 115/164 places, 390/534 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60577 ms. Remains : 115/164 places, 390/534 transitions.
Built C files in :
/tmp/ltsmin6218454204281278938
[2025-05-29 22:27:41] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6218454204281278938
Running compilation step : cd /tmp/ltsmin6218454204281278938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 887 ms.
Running link step : cd /tmp/ltsmin6218454204281278938;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6218454204281278938;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased45011665118613254.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:27:56] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2025-05-29 22:27:56] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:27:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-29 22:27:56] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:27:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:27:56] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:27:56] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:27:56] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:27:56] [INFO ] Invariant cache hit.
[2025-05-29 22:27:56] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30044 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60416ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60419ms
Finished structural reductions in LTL mode , in 1 iterations and 60744 ms. Remains : 164/164 places, 534/534 transitions.
Built C files in :
/tmp/ltsmin15890403490272510315
[2025-05-29 22:28:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15890403490272510315
Running compilation step : cd /tmp/ltsmin15890403490272510315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 850 ms.
Running link step : cd /tmp/ltsmin15890403490272510315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15890403490272510315;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2453046496417030456.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 22:29:12] [INFO ] Flatten gal took : 37 ms
[2025-05-29 22:29:12] [INFO ] Flatten gal took : 28 ms
[2025-05-29 22:29:12] [INFO ] Time to serialize gal into /tmp/LTL14254923435687940607.gal : 5 ms
[2025-05-29 22:29:12] [INFO ] Time to serialize properties into /tmp/LTL57573700730239930.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14254923435687940607.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17006093192630461696.hoa' '-atoms' '/tmp/LTL57573700730239930.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL57573700730239930.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17006093192630461696.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...405
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2025-05-29 22:29:27] [INFO ] Flatten gal took : 26 ms
[2025-05-29 22:29:27] [INFO ] Flatten gal took : 24 ms
[2025-05-29 22:29:27] [INFO ] Time to serialize gal into /tmp/LTL4119364736062217053.gal : 5 ms
[2025-05-29 22:29:27] [INFO ] Time to serialize properties into /tmp/LTL14900473538080595223.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4119364736062217053.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14900473538080595223.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((((!("((((p58==1)&&(p60==1))&&((p62==1)&&(p167==1)))&&(p178==1))"))&&(F("(p91!=1)")))U(("(p13==1)")U(X(("(p13==1)")||(G(F(!("((((p58...216
Formula 0 simplified : ("((((p58==1)&&(p60==1))&&((p62==1)&&(p167==1)))&&(p178==1))" | G!"(p91!=1)") R (!"(p13==1)" R X(!"(p13==1)" & FG"((((p58==1)&&(p60=...198
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...405
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2025-05-29 22:29:42] [INFO ] Flatten gal took : 22 ms
[2025-05-29 22:29:42] [INFO ] Applying decomposition
[2025-05-29 22:29:42] [INFO ] Flatten gal took : 21 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16312061414394459121.txt' '-o' '/tmp/graph16312061414394459121.bin' '-w' '/tmp/graph16312061414394459121.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16312061414394459121.bin' '-l' '-1' '-v' '-w' '/tmp/graph16312061414394459121.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:29:42] [INFO ] Decomposing Gal with order
[2025-05-29 22:29:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:29:42] [INFO ] Removed a total of 559 redundant transitions.
[2025-05-29 22:29:42] [INFO ] Flatten gal took : 102 ms
[2025-05-29 22:29:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 162 labels/synchronizations in 15 ms.
[2025-05-29 22:29:42] [INFO ] Time to serialize gal into /tmp/LTL18042757439933320374.gal : 6 ms
[2025-05-29 22:29:42] [INFO ] Time to serialize properties into /tmp/LTL10800422709918010587.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18042757439933320374.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10800422709918010587.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((((!("((((i10.i1.u41.p58==1)&&(i10.i1.u41.p60==1))&&((i4.u14.p62==1)&&(i10.i1.u41.p167==1)))&&(i10.i1.u41.p178==1))"))&&(F("(i6.u21....337
Formula 0 simplified : ("((((i10.i1.u41.p58==1)&&(i10.i1.u41.p60==1))&&((i4.u14.p62==1)&&(i10.i1.u41.p167==1)))&&(i10.i1.u41.p178==1))" | G!"(i6.u21.p91!=1...319
Reverse transition relation is NOT exact ! Due to transitions t16, t51, t178, i0.t169, i0.t156, i0.u3.t164, i0.u3.t446, i1.t172, i1.u5.t173, i1.u6.t143, i1...632
Computing Next relation with stutter on 2 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
53 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.58113,41700,1,0,44421,1434,3829,71778,1151,4106,101582
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA CloudDeployment-PT-5a-LTLFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property CloudDeployment-PT-5a-LTLFireability-06 finished in 309402 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(G(p0)))'
Support contains 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 199 edges and 164 vertex of which 50 / 164 are part of one of the 15 SCC in 0 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 124 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 124 transition count 404
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 41 place count 109 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 121 place count 109 transition count 369
Applied a total of 121 rules in 33 ms. Remains 109 /164 variables (removed 55) and now considering 369/534 (removed 165) transitions.
[2025-05-29 22:29:43] [INFO ] Flow matrix only has 155 transitions (discarded 214 similar events)
// Phase 1: matrix 155 rows 109 cols
[2025-05-29 22:29:43] [INFO ] Computed 20 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:29:43] [INFO ] Implicit Places using invariants in 73 ms returned []
[2025-05-29 22:29:43] [INFO ] Flow matrix only has 155 transitions (discarded 214 similar events)
[2025-05-29 22:29:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:29:43] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-05-29 22:29:43] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:29:43] [INFO ] Redundant transitions in 198 ms returned []
Running 368 sub problems to find dead transitions.
[2025-05-29 22:29:43] [INFO ] Flow matrix only has 155 transitions (discarded 214 similar events)
[2025-05-29 22:29:43] [INFO ] Invariant cache hit.
[2025-05-29 22:29:43] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 154/262 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 368 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 95/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 1/263 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 1/264 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 225 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25392 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 109/109 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 154/262 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 95/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 1/264 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/264 variables, and 593 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 109/109 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55557ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 55559ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/164 places, 369/534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 56057 ms. Remains : 109/164 places, 369/534 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-07
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLFireability-07 finished in 56129 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)) U p1)&&(p1 U !p2)))'
Support contains 11 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 1 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:30:39] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2025-05-29 22:30:39] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:30:39] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-29 22:30:39] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:30:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:30:39] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:30:39] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:30:39] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:30:39] [INFO ] Invariant cache hit.
[2025-05-29 22:30:39] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60406ms
Finished structural reductions in LTL mode , in 1 iterations and 60743 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), true, (OR (NOT p1) p2), p2, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLFireability-09 finished in 60953 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 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 190 edges and 164 vertex of which 49 / 164 are part of one of the 15 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 125 transition count 407
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 125 transition count 407
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 41 place count 110 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 121 place count 110 transition count 372
Applied a total of 121 rules in 28 ms. Remains 110 /164 variables (removed 54) and now considering 372/534 (removed 162) transitions.
[2025-05-29 22:31:40] [INFO ] Flow matrix only has 157 transitions (discarded 215 similar events)
// Phase 1: matrix 157 rows 110 cols
[2025-05-29 22:31:40] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:31:40] [INFO ] Implicit Places using invariants in 60 ms returned []
[2025-05-29 22:31:40] [INFO ] Flow matrix only has 157 transitions (discarded 215 similar events)
[2025-05-29 22:31:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:31:40] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-05-29 22:31:40] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:31:41] [INFO ] Redundant transitions in 199 ms returned []
Running 371 sub problems to find dead transitions.
[2025-05-29 22:31:41] [INFO ] Flow matrix only has 157 transitions (discarded 215 similar events)
[2025-05-29 22:31:41] [INFO ] Invariant cache hit.
[2025-05-29 22:31:41] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 156/265 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 371 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 1/266 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 1/267 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 226 constraints, problems are : Problem set: 0 solved, 371 unsolved in 24839 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 110/110 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 156/265 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 371/595 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 1/266 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (OVERLAPS) 1/267 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 597 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 110/110 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55003ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 55004ms
Starting structural reductions in SI_LTL mode, iteration 1 : 110/164 places, 372/534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55536 ms. Remains : 110/164 places, 372/534 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-10
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 81 ms.
Computed a total of 64 stabilizing places and 280 stable transitions
Graph (complete) has 1223 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 64 stabilizing places and 280 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1640 steps (30 resets) in 14 ms. (109 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Support contains 7 out of 110 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 110/110 places, 372/372 transitions.
Applied a total of 0 rules in 18 ms. Remains 110 /110 variables (removed 0) and now considering 372/372 (removed 0) transitions.
[2025-05-29 22:32:36] [INFO ] Flow matrix only has 157 transitions (discarded 215 similar events)
[2025-05-29 22:32:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:32:36] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-05-29 22:32:36] [INFO ] Flow matrix only has 157 transitions (discarded 215 similar events)
[2025-05-29 22:32:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:32:36] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-05-29 22:32:37] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:32:37] [INFO ] Redundant transitions in 210 ms returned []
Running 371 sub problems to find dead transitions.
[2025-05-29 22:32:37] [INFO ] Flow matrix only has 157 transitions (discarded 215 similar events)
[2025-05-29 22:32:37] [INFO ] Invariant cache hit.
[2025-05-29 22:32:37] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 156/265 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 371 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 1/266 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/266 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 1/267 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 9 (OVERLAPS) 0/267 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 267/267 variables, and 226 constraints, problems are : Problem set: 0 solved, 371 unsolved in 25060 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 110/110 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 156/265 variables, 109/129 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 95/224 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 371/595 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 0/595 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 6 (OVERLAPS) 1/266 variables, 1/596 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/266 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 371 unsolved
At refinement iteration 8 (OVERLAPS) 1/267 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 371 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 267/267 variables, and 597 constraints, problems are : Problem set: 0 solved, 371 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 110/110 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 371/371 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55261ms problems are : Problem set: 0 solved, 371 unsolved
Search for dead transitions found 0 dead transitions in 55262ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 55812 ms. Remains : 110/110 places, 372/372 transitions.
Computed a total of 64 stabilizing places and 280 stable transitions
Graph (complete) has 1223 edges and 110 vertex of which 109 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 64 stabilizing places and 280 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1624 steps (27 resets) in 12 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 63 ms.
Product exploration explored 100000 steps with 0 reset in 68 ms.
Built C files in :
/tmp/ltsmin10974266905547652268
[2025-05-29 22:33:33] [INFO ] Computing symmetric may disable matrix : 372 transitions.
[2025-05-29 22:33:33] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:33:33] [INFO ] Computing symmetric may enable matrix : 372 transitions.
[2025-05-29 22:33:33] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:33:33] [INFO ] Computing Do-Not-Accords matrix : 372 transitions.
[2025-05-29 22:33:33] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-05-29 22:33:33] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10974266905547652268
Running compilation step : cd /tmp/ltsmin10974266905547652268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 890 ms.
Running link step : cd /tmp/ltsmin10974266905547652268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin10974266905547652268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9787950914600116570.hoa' '--buchi-type=spotba'
LTSmin run took 804 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-5a-LTLFireability-10 finished in 114542 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((X(X((!(F(p0) U !p1)||X(p2))))||p3))))'
Support contains 9 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:33:35] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2025-05-29 22:33:35] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:33:35] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-29 22:33:35] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:33:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:33:35] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:33:35] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:33:35] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:33:35] [INFO ] Invariant cache hit.
[2025-05-29 22:33:35] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60378ms
Finished structural reductions in LTL mode , in 1 iterations and 60730 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 511 ms :[true, (NOT p2), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND p0 (NOT p1) (NOT p2)), p0, (NOT p1), (AND p0 (NOT p1)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-11
Product exploration explored 100000 steps with 0 reset in 75 ms.
Product exploration explored 100000 steps with 0 reset in 84 ms.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Detected a total of 79/164 stabilizing places and 364/534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (X (NOT p3))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 12 states, 25 edges and 4 AP (stutter sensitive) to 12 states, 25 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 468 ms :[true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 40000 steps (528 resets) in 140 ms. (283 steps per ms) remains 3/12 properties
BEST_FIRST walk for 40003 steps (64 resets) in 126 ms. (314 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (49 resets) in 106 ms. (373 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (65 resets) in 124 ms. (320 steps per ms) remains 2/2 properties
[2025-05-29 22:34:37] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:34:37] [INFO ] Invariant cache hit.
[2025-05-29 22:34:37] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/459 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 2 unsolved in 227 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 155/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 2/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/458 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/458 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 1/459 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/459 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 312 constraints, problems are : Problem set: 0 solved, 2 unsolved in 429 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 192 edges and 164 vertex of which 49 / 164 are part of one of the 15 SCC in 1 ms
Free SCC test removed 34 places
Drop transitions (Empty/Sink Transition effects.) removed 109 transitions
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 134 transitions.
Graph (complete) has 791 edges and 130 vertex of which 129 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 6 place count 125 transition count 376
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 125 transition count 376
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 120 transition count 371
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 46 place count 107 transition count 415
Drop transitions (Redundant composition of simpler transitions.) removed 77 transitions
Redundant transition composition rules discarded 77 transitions
Iterating global reduction 0 with 77 rules applied. Total rules applied 123 place count 107 transition count 338
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 124 place count 107 transition count 337
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 125 place count 106 transition count 337
Applied a total of 125 rules in 35 ms. Remains 106 /164 variables (removed 58) and now considering 337/534 (removed 197) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 106/164 places, 337/534 transitions.
RANDOM walk for 40000 steps (813 resets) in 145 ms. (273 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (117 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (119 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1085591 steps, run timeout after 3001 ms. (steps per millisecond=361 ) properties seen :0 out of 2
Probabilistic random walk after 1085591 steps, saw 185376 distinct states, run finished after 3005 ms. (steps per millisecond=361 ) properties seen :0
[2025-05-29 22:34:41] [INFO ] Flow matrix only has 152 transitions (discarded 185 similar events)
// Phase 1: matrix 152 rows 106 cols
[2025-05-29 22:34:41] [INFO ] Computed 20 invariants in 1 ms
[2025-05-29 22:34:41] [INFO ] State equation strengthened by 95 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/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 36/70 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/70 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 36/106 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 152/258 variables, 106/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 95/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/258 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 258/258 variables, and 221 constraints, problems are : Problem set: 0 solved, 2 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 106/106 constraints, ReadFeed: 95/95 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 26/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:34:41] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:34:41] [INFO ] Deduced a trap composed of 7 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 36/70 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:34:41] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/70 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 36/106 variables, 15/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:34:41] [INFO ] Deduced a trap composed of 4 places in 64 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:34:41] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/106 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-29 22:34:41] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/106 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/106 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf4 is UNSAT
Problem apf7 is UNSAT
After SMT solving in domain Int declared 258/258 variables, and 132 constraints, problems are : Problem set: 2 solved, 0 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 106/106 constraints, ReadFeed: 0/95 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 516ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (X (NOT p3))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 (NOT p0) p2)), (G (OR p1 (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p0)))), (F p0), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2)))]
Knowledge based reduction with 6 factoid took 512 ms. Reduced automaton from 12 states, 25 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 461 ms :[true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 489 ms :[true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2025-05-29 22:34:43] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2025-05-29 22:34:43] [INFO ] Computed 20 invariants in 4 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 22:34:43] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2025-05-29 22:34:43] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2025-05-29 22:34:43] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:34:43] [INFO ] [Real]Added 126 Read/Feed constraints in 14 ms returned sat
[2025-05-29 22:34:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 22:34:43] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 3 ms returned sat
[2025-05-29 22:34:43] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2025-05-29 22:34:43] [INFO ] [Nat]Added 126 Read/Feed constraints in 15 ms returned sat
[2025-05-29 22:34:43] [INFO ] Computed and/alt/rep : 250/882/250 causal constraints (skipped 44 transitions) in 20 ms.
[2025-05-29 22:34:43] [INFO ] Added : 0 causal constraints over 0 iterations in 49 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 8 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 4 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:34:43] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:34:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:34:43] [INFO ] Implicit Places using invariants in 65 ms returned []
[2025-05-29 22:34:43] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:34:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:34:43] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:34:43] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:34:43] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:34:43] [INFO ] Invariant cache hit.
[2025-05-29 22:34:43] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60425ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60428ms
Finished structural reductions in LTL mode , in 1 iterations and 60774 ms. Remains : 164/164 places, 534/534 transitions.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Detected a total of 79/164 stabilizing places and 364/534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 497 ms :[true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
RANDOM walk for 34382 steps (451 resets) in 101 ms. (337 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p2))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F p2), (F (NOT (OR (NOT p1) p0))), (F p1), (F (NOT (OR (NOT p1) (NOT p0)))), (F (NOT (OR (NOT p1) p0 p2))), (F p0)]
Knowledge based reduction with 3 factoid took 417 ms. Reduced automaton from 12 states, 23 edges and 3 AP (stutter sensitive) to 12 states, 23 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 483 ms :[true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 500 ms :[true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
[2025-05-29 22:35:46] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:35:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 22:35:46] [INFO ] [Real]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2025-05-29 22:35:46] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2025-05-29 22:35:46] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:35:46] [INFO ] [Real]Added 126 Read/Feed constraints in 19 ms returned sat
[2025-05-29 22:35:46] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-29 22:35:46] [INFO ] [Nat]Absence check using 0 positive and 20 generalized place invariants in 4 ms returned sat
[2025-05-29 22:35:46] [INFO ] [Nat]Absence check using state equation in 58 ms returned sat
[2025-05-29 22:35:46] [INFO ] [Nat]Added 126 Read/Feed constraints in 17 ms returned sat
[2025-05-29 22:35:46] [INFO ] Computed and/alt/rep : 250/882/250 causal constraints (skipped 44 transitions) in 20 ms.
[2025-05-29 22:35:46] [INFO ] Added : 0 causal constraints over 0 iterations in 41 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 471 ms :[true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 72 ms.
Product exploration explored 100000 steps with 0 reset in 80 ms.
Applying partial POR strategy [true, true, false, false, false, false, true, false, false, false, false, false]
Stuttering acceptance computed with spot in 485 ms :[true, (NOT p2), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) p0 (NOT p2)), p0, (AND (NOT p1) p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 192 edges and 164 vertex of which 49 / 164 are part of one of the 15 SCC in 0 ms
Free SCC test removed 34 places
Ensure Unique test removed 88 transitions
Reduce isomorphic transitions removed 88 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 126 transition count 418
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 126 transition count 418
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -74
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 0 with 13 rules applied. Total rules applied 22 place count 126 transition count 492
Deduced a syphon composed of 13 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 90 transitions
Redundant transition composition rules discarded 90 transitions
Iterating global reduction 0 with 90 rules applied. Total rules applied 112 place count 126 transition count 402
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 113 place count 126 transition count 402
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 113 rules in 32 ms. Remains 126 /164 variables (removed 38) and now considering 402/534 (removed 132) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:35:48] [INFO ] Redundant transitions in 193 ms returned []
Running 401 sub problems to find dead transitions.
[2025-05-29 22:35:48] [INFO ] Flow matrix only has 177 transitions (discarded 225 similar events)
// Phase 1: matrix 177 rows 126 cols
[2025-05-29 22:35:48] [INFO ] Computed 20 invariants in 1 ms
[2025-05-29 22:35:48] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/125 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/125 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD73 is UNSAT
At refinement iteration 2 (OVERLAPS) 176/301 variables, 125/145 constraints. Problems are: Problem set: 18 solved, 383 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/301 variables, 95/240 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/301 variables, 0/240 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 5 (OVERLAPS) 1/302 variables, 1/241 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/302 variables, 0/241 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 7 (OVERLAPS) 1/303 variables, 1/242 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 0/242 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 9 (OVERLAPS) 0/303 variables, 0/242 constraints. Problems are: Problem set: 18 solved, 383 unsolved
No progress, stopping.
After SMT solving in domain Real declared 303/303 variables, and 242 constraints, problems are : Problem set: 18 solved, 383 unsolved in 28244 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 126/126 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 401/401 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 383 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 15/15 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 0/15 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 2 (OVERLAPS) 14/125 variables, 5/20 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 4 (OVERLAPS) 176/301 variables, 125/145 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/301 variables, 95/240 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/301 variables, 383/623 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/623 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 8 (OVERLAPS) 1/302 variables, 1/624 constraints. Problems are: Problem set: 18 solved, 383 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/302 variables, 0/624 constraints. Problems are: Problem set: 18 solved, 383 unsolved
SMT process timed out in 58437ms, After SMT, problems are : Problem set: 18 solved, 383 unsolved
Search for dead transitions found 18 dead transitions in 58438ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 126/164 places, 384/534 transitions.
Graph (complete) has 1242 edges and 126 vertex of which 112 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 112 /126 variables (removed 14) and now considering 384/384 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 112/164 places, 384/534 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 58681 ms. Remains : 112/164 places, 384/534 transitions.
Built C files in :
/tmp/ltsmin4783947484480602428
[2025-05-29 22:36:46] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4783947484480602428
Running compilation step : cd /tmp/ltsmin4783947484480602428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 871 ms.
Running link step : cd /tmp/ltsmin4783947484480602428;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4783947484480602428;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14922318271701897336.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:37:01] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2025-05-29 22:37:01] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:01] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-29 22:37:01] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:37:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:37:02] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:37:02] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:37:02] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:37:02] [INFO ] Invariant cache hit.
[2025-05-29 22:37:02] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60358ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Finished structural reductions in LTL mode , in 1 iterations and 60704 ms. Remains : 164/164 places, 534/534 transitions.
Built C files in :
/tmp/ltsmin2410665197608142629
[2025-05-29 22:38:02] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2410665197608142629
Running compilation step : cd /tmp/ltsmin2410665197608142629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 803 ms.
Running link step : cd /tmp/ltsmin2410665197608142629;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2410665197608142629;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15446074870099707513.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-05-29 22:38:17] [INFO ] Flatten gal took : 19 ms
[2025-05-29 22:38:17] [INFO ] Flatten gal took : 20 ms
[2025-05-29 22:38:17] [INFO ] Time to serialize gal into /tmp/LTL10014955181428688085.gal : 4 ms
[2025-05-29 22:38:17] [INFO ] Time to serialize properties into /tmp/LTL16614643404238697686.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10014955181428688085.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17553344677410340242.hoa' '-atoms' '/tmp/LTL16614643404238697686.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16614643404238697686.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17553344677410340242.hoa
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...405
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2025-05-29 22:38:32] [INFO ] Flatten gal took : 17 ms
[2025-05-29 22:38:32] [INFO ] Flatten gal took : 16 ms
[2025-05-29 22:38:32] [INFO ] Time to serialize gal into /tmp/LTL15074069240483379927.gal : 3 ms
[2025-05-29 22:38:32] [INFO ] Time to serialize properties into /tmp/LTL7957199957068084097.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15074069240483379927.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7957199957068084097.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X((!((F("(p21==1)"))U(!("((p30==1)&&(p116==1))"))))||(X("((((p86==1)&&(p88==1))&&((p101==1)&&(p167==1)))&&(p178==1))")))))||...171
Formula 0 simplified : XX(!"(p75==1)" & XX((F"(p21==1)" U !"((p30==1)&&(p116==1))") & X!"((((p86==1)&&(p88==1))&&((p101==1)&&(p167==1)))&&(p178==1))"))
Reverse transition relation is NOT exact ! Due to transitions t2, t3, t16, t24, t29, t32, t33, t36, t38, t51, t59, t64, t67, t68, t71, t73, t86, t94, t99, ...405
Computing Next relation with stutter on 2 deadlock states
Detected timeout of ITS tools.
[2025-05-29 22:38:47] [INFO ] Flatten gal took : 16 ms
[2025-05-29 22:38:47] [INFO ] Applying decomposition
[2025-05-29 22:38:47] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph13819692370102489084.txt' '-o' '/tmp/graph13819692370102489084.bin' '-w' '/tmp/graph13819692370102489084.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13819692370102489084.bin' '-l' '-1' '-v' '-w' '/tmp/graph13819692370102489084.weights' '-q' '0' '-e' '0.001'
[2025-05-29 22:38:47] [INFO ] Decomposing Gal with order
[2025-05-29 22:38:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-29 22:38:48] [INFO ] Removed a total of 558 redundant transitions.
[2025-05-29 22:38:48] [INFO ] Flatten gal took : 48 ms
[2025-05-29 22:38:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 7 ms.
[2025-05-29 22:38:48] [INFO ] Time to serialize gal into /tmp/LTL14370138617082852652.gal : 3 ms
[2025-05-29 22:38:48] [INFO ] Time to serialize properties into /tmp/LTL12329747202541153772.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14370138617082852652.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12329747202541153772.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(X((X(X((!((F("(i1.u5.p21==1)"))U(!("((i10.u45.p30==1)&&(i10.u45.p116==1))"))))||(X("((((i10.u45.p86==1)&&(i10.u45.p88==1))&&((i6....239
Formula 0 simplified : XX(!"(i5.u18.p75==1)" & XX((F"(i1.u5.p21==1)" U !"((i10.u45.p30==1)&&(i10.u45.p116==1))") & X!"((((i10.u45.p86==1)&&(i10.u45.p88==1)...219
Reverse transition relation is NOT exact ! Due to transitions t16, t86, t178, i0.t169, i0.t156, i0.u3.t164, i0.u3.t446, i1.t176, i1.t173, i1.u6.t143, i1.u6...627
Computing Next relation with stutter on 2 deadlock states
21 unique states visited
0 strongly connected components in search stack
37 transitions explored
18 items max in DFS search stack
84 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.880643,54260,1,0,75434,1446,3488,108413,1178,5845,192392
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CloudDeployment-PT-5a-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property CloudDeployment-PT-5a-LTLFireability-11 finished in 314052 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(((X(X(!p0))&&F(p1))||G(!p0)))))'
Support contains 8 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:38:49] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:38:49] [INFO ] Implicit Places using invariants in 64 ms returned []
[2025-05-29 22:38:49] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:38:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:38:49] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:38:49] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:38:49] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:38:49] [INFO ] Invariant cache hit.
[2025-05-29 22:38:49] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60357ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Finished structural reductions in LTL mode , in 1 iterations and 60812 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 249 ms :[p0, p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-13
Product exploration explored 100000 steps with 25000 reset in 931 ms.
Product exploration explored 100000 steps with 25000 reset in 893 ms.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Detected a total of 79/164 stabilizing places and 364/534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[p0, p0, (AND (NOT p1) p0), p0, (AND (NOT p1) p0), p0]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 40000 steps (526 resets) in 154 ms. (258 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (52 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
[2025-05-29 22:39:52] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:39:52] [INFO ] Invariant cache hit.
[2025-05-29 22:39:52] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 8/459 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Generalized P Invariants (flows): 0/20 constraints, State Equation: 0/164 constraints, ReadFeed: 0/126 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X p1), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G (OR p1 p0))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p1 (NOT p0)))), (F p0)]
Knowledge based reduction with 8 factoid took 262 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 142 ms :[p0, p0, p0, p0]
Support contains 5 out of 164 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 3 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:39:53] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:39:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:53] [INFO ] Implicit Places using invariants in 62 ms returned []
[2025-05-29 22:39:53] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:39:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:39:53] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:39:53] [INFO ] Implicit Places using invariants and state equation in 370 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:39:53] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:39:53] [INFO ] Invariant cache hit.
[2025-05-29 22:39:53] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60373ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60376ms
Finished structural reductions in LTL mode , in 1 iterations and 60817 ms. Remains : 164/164 places, 534/534 transitions.
Computed a total of 79 stabilizing places and 364 stable transitions
Graph (complete) has 1502 edges and 164 vertex of which 163 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 79 stabilizing places and 364 stable transitions
Detected a total of 79/164 stabilizing places and 364/534 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[p0, p0, p0, p0]
RANDOM walk for 32228 steps (431 resets) in 98 ms. (325 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 163 ms :[p0, p0, p0, p0]
Stuttering acceptance computed with spot in 127 ms :[p0, p0, p0, p0]
Product exploration explored 100000 steps with 25000 reset in 904 ms.
Product exploration explored 100000 steps with 25000 reset in 894 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[p0, p0, p0, p0]
Support contains 5 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 197 edges and 164 vertex of which 50 / 164 are part of one of the 15 SCC in 1 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 124 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 124 transition count 404
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -76
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 0 with 14 rules applied. Total rules applied 25 place count 124 transition count 480
Deduced a syphon composed of 14 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 89 transitions
Redundant transition composition rules discarded 89 transitions
Iterating global reduction 0 with 89 rules applied. Total rules applied 114 place count 124 transition count 391
Deduced a syphon composed of 14 places in 0 ms
Applied a total of 114 rules in 24 ms. Remains 124 /164 variables (removed 40) and now considering 391/534 (removed 143) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:40:56] [INFO ] Redundant transitions in 188 ms returned []
Running 390 sub problems to find dead transitions.
[2025-05-29 22:40:56] [INFO ] Flow matrix only has 177 transitions (discarded 214 similar events)
// Phase 1: matrix 177 rows 124 cols
[2025-05-29 22:40:56] [INFO ] Computed 20 invariants in 1 ms
[2025-05-29 22:40:56] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/123 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 390 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 390 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD82 is UNSAT
At refinement iteration 2 (OVERLAPS) 176/299 variables, 123/143 constraints. Problems are: Problem set: 19 solved, 371 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 95/238 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 0/238 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 5 (OVERLAPS) 1/300 variables, 1/239 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/300 variables, 0/239 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 7 (OVERLAPS) 1/301 variables, 1/240 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/301 variables, 0/240 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 9 (OVERLAPS) 0/301 variables, 0/240 constraints. Problems are: Problem set: 19 solved, 371 unsolved
No progress, stopping.
After SMT solving in domain Real declared 301/301 variables, and 240 constraints, problems are : Problem set: 19 solved, 371 unsolved in 26815 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 124/124 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 390/390 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 19 solved, 371 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 15/15 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/15 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 2 (OVERLAPS) 14/123 variables, 5/20 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/123 variables, 0/20 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 4 (OVERLAPS) 176/299 variables, 123/143 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 95/238 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 371/609 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 0/609 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 8 (OVERLAPS) 1/300 variables, 1/610 constraints. Problems are: Problem set: 19 solved, 371 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/610 constraints. Problems are: Problem set: 19 solved, 371 unsolved
SMT process timed out in 56983ms, After SMT, problems are : Problem set: 19 solved, 371 unsolved
Search for dead transitions found 19 dead transitions in 56984ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 124/164 places, 372/534 transitions.
Graph (complete) has 1215 edges and 124 vertex of which 110 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 7 ms. Remains 110 /124 variables (removed 14) and now considering 372/372 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 110/164 places, 372/534 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 57211 ms. Remains : 110/164 places, 372/534 transitions.
Built C files in :
/tmp/ltsmin10920581935826220348
[2025-05-29 22:41:54] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10920581935826220348
Running compilation step : cd /tmp/ltsmin10920581935826220348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 884 ms.
Running link step : cd /tmp/ltsmin10920581935826220348;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin10920581935826220348;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8002883814776821598.hoa' '--buchi-type=spotba'
LTSmin run took 135 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CloudDeployment-PT-5a-LTLFireability-13 finished in 185982 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 7 out of 164 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Applied a total of 0 rules in 2 ms. Remains 164 /164 variables (removed 0) and now considering 534/534 (removed 0) transitions.
[2025-05-29 22:41:55] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
// Phase 1: matrix 295 rows 164 cols
[2025-05-29 22:41:55] [INFO ] Computed 20 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:55] [INFO ] Implicit Places using invariants in 70 ms returned []
[2025-05-29 22:41:55] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:41:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:41:55] [INFO ] State equation strengthened by 126 read => feed constraints.
[2025-05-29 22:41:55] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 533 sub problems to find dead transitions.
[2025-05-29 22:41:55] [INFO ] Flow matrix only has 295 transitions (discarded 239 similar events)
[2025-05-29 22:41:55] [INFO ] Invariant cache hit.
[2025-05-29 22:41:55] [INFO ] State equation strengthened by 126 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 0/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (OVERLAPS) 1/458 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 7 (OVERLAPS) 1/459 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/459 variables, and 310 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 126/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 533 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 2 (OVERLAPS) 294/457 variables, 163/183 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/457 variables, 125/308 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/457 variables, 533/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/457 variables, 0/841 constraints. Problems are: Problem set: 0 solved, 533 unsolved
At refinement iteration 6 (OVERLAPS) 1/458 variables, 1/842 constraints. Problems are: Problem set: 0 solved, 533 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 458/459 variables, and 842 constraints, problems are : Problem set: 0 solved, 533 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 164/164 constraints, ReadFeed: 125/126 constraints, PredecessorRefiner: 533/533 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 533 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Finished structural reductions in LTL mode , in 1 iterations and 60735 ms. Remains : 164/164 places, 534/534 transitions.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-14
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLFireability-14 finished in 60841 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 2 out of 164 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 164/164 places, 534/534 transitions.
Graph (trivial) has 200 edges and 164 vertex of which 50 / 164 are part of one of the 15 SCC in 0 ms
Free SCC test removed 35 places
Ensure Unique test removed 95 transitions
Reduce isomorphic transitions removed 95 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 6 place count 124 transition count 404
Iterating global reduction 0 with 5 rules applied. Total rules applied 11 place count 124 transition count 404
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -45
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 41 place count 109 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 121 place count 109 transition count 369
Applied a total of 121 rules in 19 ms. Remains 109 /164 variables (removed 55) and now considering 369/534 (removed 165) transitions.
[2025-05-29 22:42:55] [INFO ] Flow matrix only has 155 transitions (discarded 214 similar events)
// Phase 1: matrix 155 rows 109 cols
[2025-05-29 22:42:55] [INFO ] Computed 20 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:42:56] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-05-29 22:42:56] [INFO ] Flow matrix only has 155 transitions (discarded 214 similar events)
[2025-05-29 22:42:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-29 22:42:56] [INFO ] State equation strengthened by 96 read => feed constraints.
[2025-05-29 22:42:56] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-29 22:42:56] [INFO ] Redundant transitions in 195 ms returned []
Running 368 sub problems to find dead transitions.
[2025-05-29 22:42:56] [INFO ] Flow matrix only has 155 transitions (discarded 214 similar events)
[2025-05-29 22:42:56] [INFO ] Invariant cache hit.
[2025-05-29 22:42:56] [INFO ] State equation strengthened by 96 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 154/262 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 368 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 95/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (OVERLAPS) 1/263 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/263 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (OVERLAPS) 1/264 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 9 (OVERLAPS) 0/264 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 368 unsolved
No progress, stopping.
After SMT solving in domain Real declared 264/264 variables, and 225 constraints, problems are : Problem set: 0 solved, 368 unsolved in 25028 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 109/109 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 368 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 2 (OVERLAPS) 154/262 variables, 108/128 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/262 variables, 95/223 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/262 variables, 368/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/262 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 6 (OVERLAPS) 1/263 variables, 1/592 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/263 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 368 unsolved
At refinement iteration 8 (OVERLAPS) 1/264 variables, 1/593 constraints. Problems are: Problem set: 0 solved, 368 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/264 variables, and 593 constraints, problems are : Problem set: 0 solved, 368 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 20/20 constraints, State Equation: 109/109 constraints, ReadFeed: 96/96 constraints, PredecessorRefiner: 368/368 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 55180ms problems are : Problem set: 0 solved, 368 unsolved
Search for dead transitions found 0 dead transitions in 55181ms
Starting structural reductions in SI_LTL mode, iteration 1 : 109/164 places, 369/534 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55722 ms. Remains : 109/164 places, 369/534 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CloudDeployment-PT-5a-LTLFireability-15
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-5a-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-5a-LTLFireability-15 finished in 55824 ms.
All properties solved by simple procedures.
Total runtime 1596749 ms.

BK_STOP 1748558631800

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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="CloudDeployment-PT-5a"
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 CloudDeployment-PT-5a, 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 r044-tall-174854027700052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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