Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r091-tall-171624187900509.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is DBSingleClientW-PT-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r091-tall-171624187900509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

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

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

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716290913066

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 11:28:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-21 11:28:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 11:28:34] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-05-21 11:28:34] [INFO ] Transformed 1440 places.
[2024-05-21 11:28:34] [INFO ] Transformed 672 transitions.
[2024-05-21 11:28:34] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 228 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-21 11:28:34] [INFO ] Computed 6 invariants in 43 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 6, 6]
RANDOM walk for 10000 steps (2286 resets) in 125 ms. (79 steps per ms)
BEST_FIRST walk for 40004 steps (3716 resets) in 167 ms. (238 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 3] Max Struct:[6, 6, 6, 6]
[2024-05-21 11:28:34] [INFO ] Invariant cache hit.
[2024-05-21 11:28:35] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2024-05-21 11:28:35] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2024-05-21 11:28:35] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2024-05-21 11:28:35] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-21 11:28:35] [INFO ] [Real]Added 418 Read/Feed constraints in 80 ms returned sat
[2024-05-21 11:28:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:28:35] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:28:35] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2024-05-21 11:28:35] [INFO ] [Nat]Added 418 Read/Feed constraints in 75 ms returned sat
[2024-05-21 11:28:36] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 137 ms.
[2024-05-21 11:28:36] [INFO ] Added : 7 causal constraints over 2 iterations in 303 ms. Result :sat
Minimization took 524 ms.
[2024-05-21 11:28:36] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-21 11:28:36] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-21 11:28:37] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2024-05-21 11:28:37] [INFO ] [Real]Added 418 Read/Feed constraints in 142 ms returned sat
[2024-05-21 11:28:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:37] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-21 11:28:37] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:28:37] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2024-05-21 11:28:37] [INFO ] [Nat]Added 418 Read/Feed constraints in 73 ms returned sat
[2024-05-21 11:28:37] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 67 ms.
[2024-05-21 11:28:37] [INFO ] Added : 5 causal constraints over 1 iterations in 168 ms. Result :sat
Minimization took 565 ms.
[2024-05-21 11:28:38] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:28:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 19 ms returned sat
[2024-05-21 11:28:38] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2024-05-21 11:28:38] [INFO ] [Real]Added 418 Read/Feed constraints in 82 ms returned sat
[2024-05-21 11:28:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:28:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 11:28:38] [INFO ] [Nat]Absence check using state equation in 142 ms returned sat
[2024-05-21 11:28:38] [INFO ] [Nat]Added 418 Read/Feed constraints in 75 ms returned sat
[2024-05-21 11:28:39] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 68 ms.
[2024-05-21 11:28:39] [INFO ] Added : 7 causal constraints over 2 iterations in 223 ms. Result :sat
Minimization took 586 ms.
[2024-05-21 11:28:39] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-21 11:28:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-21 11:28:40] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2024-05-21 11:28:40] [INFO ] [Real]Added 418 Read/Feed constraints in 84 ms returned sat
[2024-05-21 11:28:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:40] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-21 11:28:40] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-05-21 11:28:40] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2024-05-21 11:28:40] [INFO ] [Nat]Added 418 Read/Feed constraints in 65 ms returned sat
[2024-05-21 11:28:40] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 59 ms.
[2024-05-21 11:28:40] [INFO ] Added : 1 causal constraints over 1 iterations in 159 ms. Result :sat
Minimization took 527 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 3] Max Struct:[6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 3] Max Struct:[6, 6, 6, 6]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 181 place count 233 transition count 339
Iterating global reduction 1 with 92 rules applied. Total rules applied 273 place count 233 transition count 339
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 277 place count 233 transition count 335
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 348 place count 162 transition count 264
Iterating global reduction 2 with 71 rules applied. Total rules applied 419 place count 162 transition count 264
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 425 place count 162 transition count 258
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 465 place count 122 transition count 196
Iterating global reduction 3 with 40 rules applied. Total rules applied 505 place count 122 transition count 196
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 528 place count 122 transition count 173
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 538 place count 112 transition count 159
Iterating global reduction 4 with 10 rules applied. Total rules applied 548 place count 112 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 550 place count 112 transition count 157
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 556 place count 106 transition count 151
Iterating global reduction 5 with 6 rules applied. Total rules applied 562 place count 106 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 563 place count 106 transition count 150
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 568 place count 101 transition count 145
Iterating global reduction 6 with 5 rules applied. Total rules applied 573 place count 101 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 575 place count 101 transition count 143
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 577 place count 99 transition count 135
Iterating global reduction 7 with 2 rules applied. Total rules applied 579 place count 99 transition count 135
Applied a total of 579 rules in 106 ms. Remains 99 /347 variables (removed 248) and now considering 135/672 (removed 537) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 99/347 places, 135/672 transitions.
// Phase 1: matrix 135 rows 99 cols
[2024-05-21 11:28:41] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 3] Max Struct:[6, 6, 6, 6]
RANDOM walk for 1000000 steps (229548 resets) in 1131 ms. (883 steps per ms)
BEST_FIRST walk for 4000002 steps (381322 resets) in 2042 ms. (1957 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 5] Max Struct:[6, 6, 6, 6]
[2024-05-21 11:28:44] [INFO ] Invariant cache hit.
[2024-05-21 11:28:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:28:44] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-21 11:28:44] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-21 11:28:44] [INFO ] [Real]Added 46 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:28:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:44] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:28:44] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-21 11:28:44] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:28:44] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 99 transitions) in 8 ms.
[2024-05-21 11:28:44] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 25 ms to minimize.
[2024-05-21 11:28:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 147 ms
[2024-05-21 11:28:44] [INFO ] Added : 17 causal constraints over 5 iterations in 245 ms. Result :sat
Minimization took 86 ms.
[2024-05-21 11:28:44] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Real]Added 46 Read/Feed constraints in 9 ms returned sat
[2024-05-21 11:28:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Nat]Added 46 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:28:45] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 99 transitions) in 8 ms.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 14 places in 53 ms of which 2 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 135 ms
[2024-05-21 11:28:45] [INFO ] Added : 21 causal constraints over 6 iterations in 216 ms. Result :sat
Minimization took 105 ms.
[2024-05-21 11:28:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Real]Added 46 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:28:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:45] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Nat]Added 46 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:28:45] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 99 transitions) in 9 ms.
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 13 places in 47 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2024-05-21 11:28:45] [INFO ] Added : 8 causal constraints over 3 iterations in 101 ms. Result :sat
Minimization took 84 ms.
[2024-05-21 11:28:45] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-21 11:28:45] [INFO ] [Real]Added 46 Read/Feed constraints in 7 ms returned sat
[2024-05-21 11:28:45] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 1 ms to minimize.
[2024-05-21 11:28:45] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 54 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 5] Max Struct:[6, 6, 6, 5]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 6]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 130
Applied a total of 2 rules in 10 ms. Remains 98 /99 variables (removed 1) and now considering 130/135 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 98/99 places, 130/135 transitions.
// Phase 1: matrix 130 rows 98 cols
[2024-05-21 11:28:46] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 6]
RANDOM walk for 1000000 steps (229412 resets) in 1000 ms. (999 steps per ms)
BEST_FIRST walk for 3000001 steps (294888 resets) in 1501 ms. (1997 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 6]
[2024-05-21 11:28:48] [INFO ] Invariant cache hit.
[2024-05-21 11:28:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:28:48] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 11:28:48] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:28:48] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:28:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:48] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:28:48] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-21 11:28:48] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:28:48] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 7 ms.
[2024-05-21 11:28:48] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 2 ms to minimize.
[2024-05-21 11:28:48] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-21 11:28:48] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 126 ms
[2024-05-21 11:28:48] [INFO ] Added : 16 causal constraints over 4 iterations in 189 ms. Result :sat
Minimization took 110 ms.
[2024-05-21 11:28:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:28:49] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-21 11:28:49] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:28:49] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-21 11:28:49] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:28:49] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 7 ms.
[2024-05-21 11:28:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 11:28:49] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-21 11:28:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 116 ms
[2024-05-21 11:28:49] [INFO ] Added : 12 causal constraints over 4 iterations in 181 ms. Result :sat
Minimization took 82 ms.
[2024-05-21 11:28:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:28:49] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-21 11:28:49] [INFO ] [Real]Added 41 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:28:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:28:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:28:49] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-21 11:28:49] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:28:49] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 7 ms.
[2024-05-21 11:28:49] [INFO ] Added : 8 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 83 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 6]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 98/98 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Applied a total of 0 rules in 7 ms. Remains 98 /98 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-21 11:28:49] [INFO ] Invariant cache hit.
[2024-05-21 11:28:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-21 11:28:49] [INFO ] Invariant cache hit.
[2024-05-21 11:28:49] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:28:49] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
[2024-05-21 11:28:50] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-21 11:28:50] [INFO ] Invariant cache hit.
[2024-05-21 11:28:50] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/228 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 141 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3485 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/228 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 129/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 270 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5774 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 9636ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 9651ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9930 ms. Remains : 98/98 places, 130/130 transitions.
RANDOM walk for 40000 steps (9226 resets) in 1369 ms. (29 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3948 resets) in 298 ms. (133 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3940 resets) in 271 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3855 resets) in 212 ms. (187 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3843 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3991 resets) in 102 ms. (388 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3905 resets) in 104 ms. (380 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 652994 steps, run timeout after 3001 ms. (steps per millisecond=217 ) properties seen :3 out of 6
Probabilistic random walk after 652994 steps, saw 252333 distinct states, run finished after 3008 ms. (steps per millisecond=217 ) properties seen :3
[2024-05-21 11:29:03] [INFO ] Invariant cache hit.
[2024-05-21 11:29:03] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 104/117 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 60/177 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/184 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 44/228 variables, 40/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 27/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 11:29:03] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
After SMT solving in domain Real declared 228/228 variables, and 142 constraints, problems are : Problem set: 3 solved, 0 unsolved in 217 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 223ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 6]
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-21 11:29:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2322 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (964 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 11:29:03] [INFO ] Invariant cache hit.
[2024-05-21 11:29:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:29:03] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-21 11:29:03] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:29:03] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:29:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:29:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:29:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-21 11:29:03] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:29:03] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 8 ms.
[2024-05-21 11:29:04] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2024-05-21 11:29:04] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-21 11:29:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 131 ms
[2024-05-21 11:29:04] [INFO ] Added : 16 causal constraints over 4 iterations in 190 ms. Result :sat
Minimization took 115 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 94 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 94 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 92 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 92 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 90 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 90 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 88 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 88 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 88 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 87 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 87 transition count 107
Applied a total of 24 rules in 25 ms. Remains 87 /98 variables (removed 11) and now considering 107/130 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 87/98 places, 107/130 transitions.
// Phase 1: matrix 107 rows 87 cols
[2024-05-21 11:29:04] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229480 resets) in 900 ms. (1109 steps per ms)
BEST_FIRST walk for 1000001 steps (98729 resets) in 445 ms. (2242 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 11:29:05] [INFO ] Invariant cache hit.
[2024-05-21 11:29:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:29:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 11:29:05] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 11:29:05] [INFO ] [Real]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:29:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:29:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:29:05] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-21 11:29:05] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:29:05] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 75 transitions) in 9 ms.
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-05-21 11:29:05] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-21 11:29:06] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 2 ms to minimize.
[2024-05-21 11:29:06] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 251 ms
[2024-05-21 11:29:06] [INFO ] Added : 14 causal constraints over 4 iterations in 312 ms. Result :sat
Minimization took 56 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 87/87 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-21 11:29:06] [INFO ] Invariant cache hit.
[2024-05-21 11:29:06] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 11:29:06] [INFO ] Invariant cache hit.
[2024-05-21 11:29:06] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-21 11:29:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 11:29:06] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-21 11:29:06] [INFO ] Invariant cache hit.
[2024-05-21 11:29:06] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/194 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 121 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1952 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/194 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 106/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 227 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4328 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6394ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6396ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6604 ms. Remains : 87/87 places, 107/107 transitions.
RANDOM walk for 40000 steps (9175 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3818 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (3879 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
Probably explored full state space saw : 742649 states, properties seen :1
Probabilistic random walk after 1897282 steps, saw 742649 distinct states, run finished after 2191 ms. (steps per millisecond=865 ) properties seen :1
Explored full state space saw : 745167 states, properties seen :0
Exhaustive walk after 1903331 steps, saw 745167 distinct states, run finished after 1637 ms. (steps per millisecond=1162 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-05 in 12979 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 130 rows 98 cols
[2024-05-21 11:29:16] [INFO ] Computed 2 invariants in 4 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2317 resets) in 13 ms. (714 steps per ms)
BEST_FIRST walk for 10001 steps (980 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 11:29:16] [INFO ] Invariant cache hit.
[2024-05-21 11:29:16] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:29:16] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-21 11:29:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:29:16] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-05-21 11:29:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:29:16] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:29:16] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-21 11:29:16] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:29:16] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 9 ms.
[2024-05-21 11:29:17] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-21 11:29:17] [INFO ] Deduced a trap composed of 16 places in 52 ms of which 1 ms to minimize.
[2024-05-21 11:29:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 146 ms
[2024-05-21 11:29:17] [INFO ] Added : 12 causal constraints over 4 iterations in 201 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 94 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 94 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 92 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 92 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 90 transition count 117
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 90 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 88 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 88 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 88 transition count 112
Applied a total of 24 rules in 14 ms. Remains 88 /98 variables (removed 10) and now considering 112/130 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 88/98 places, 112/130 transitions.
// Phase 1: matrix 112 rows 88 cols
[2024-05-21 11:29:17] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229621 resets) in 938 ms. (1064 steps per ms)
BEST_FIRST walk for 1000001 steps (98542 resets) in 437 ms. (2283 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 11:29:18] [INFO ] Invariant cache hit.
[2024-05-21 11:29:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:29:18] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-05-21 11:29:18] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:29:18] [INFO ] [Real]Added 36 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:29:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:29:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:29:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-21 11:29:18] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:29:18] [INFO ] Computed and/alt/rep : 31/66/31 causal constraints (skipped 80 transitions) in 7 ms.
[2024-05-21 11:29:18] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2024-05-21 11:29:18] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-05-21 11:29:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-21 11:29:19] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2024-05-21 11:29:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-21 11:29:19] [INFO ] Added : 15 causal constraints over 6 iterations in 248 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 88/88 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 6 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-21 11:29:19] [INFO ] Invariant cache hit.
[2024-05-21 11:29:19] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-21 11:29:19] [INFO ] Invariant cache hit.
[2024-05-21 11:29:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-21 11:29:19] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2024-05-21 11:29:19] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-21 11:29:19] [INFO ] Invariant cache hit.
[2024-05-21 11:29:19] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 126 constraints, problems are : Problem set: 0 solved, 111 unsolved in 3291 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 111/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 237 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4700 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 8130ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 8133ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8408 ms. Remains : 88/88 places, 112/112 transitions.
RANDOM walk for 40000 steps (9174 resets) in 80 ms. (493 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3938 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3797 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Probably explored full state space saw : 818181 states, properties seen :1
Probabilistic random walk after 2196419 steps, saw 818181 distinct states, run finished after 2109 ms. (steps per millisecond=1041 ) properties seen :1
Explored full state space saw : 821355 states, properties seen :0
Exhaustive walk after 2205019 steps, saw 821355 distinct states, run finished after 1937 ms. (steps per millisecond=1138 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-09 in 14937 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 130 rows 98 cols
[2024-05-21 11:29:31] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2272 resets) in 11 ms. (833 steps per ms)
BEST_FIRST walk for 10001 steps (999 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 11:29:31] [INFO ] Invariant cache hit.
[2024-05-21 11:29:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:29:31] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-21 11:29:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 11:29:31] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:29:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:29:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-21 11:29:31] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-21 11:29:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:29:31] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 42 ms.
[2024-05-21 11:29:31] [INFO ] Added : 8 causal constraints over 3 iterations in 86 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 94 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 94 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 92 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 92 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 92 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 90 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 88 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 88 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 87 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 87 transition count 109
Applied a total of 24 rules in 29 ms. Remains 87 /98 variables (removed 11) and now considering 109/130 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 87/98 places, 109/130 transitions.
// Phase 1: matrix 109 rows 87 cols
[2024-05-21 11:29:32] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229649 resets) in 902 ms. (1107 steps per ms)
BEST_FIRST walk for 1000000 steps (98847 resets) in 479 ms. (2083 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-21 11:29:33] [INFO ] Invariant cache hit.
[2024-05-21 11:29:33] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2024-05-21 11:29:33] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-21 11:29:33] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 11:29:33] [INFO ] [Real]Added 31 Read/Feed constraints in 5 ms returned sat
[2024-05-21 11:29:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 11:29:33] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-21 11:29:33] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-21 11:29:33] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-21 11:29:33] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 77 transitions) in 6 ms.
[2024-05-21 11:29:33] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 1 ms to minimize.
[2024-05-21 11:29:33] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-21 11:29:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2024-05-21 11:29:33] [INFO ] Added : 8 causal constraints over 3 iterations in 164 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 87/87 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-21 11:29:33] [INFO ] Invariant cache hit.
[2024-05-21 11:29:33] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-21 11:29:33] [INFO ] Invariant cache hit.
[2024-05-21 11:29:34] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-21 11:29:34] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-21 11:29:34] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-21 11:29:34] [INFO ] Invariant cache hit.
[2024-05-21 11:29:34] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 120 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2113 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 228 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4044 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6243ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6246ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6495 ms. Remains : 87/87 places, 109/109 transitions.
RANDOM walk for 40000 steps (9186 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (3838 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (3910 resets) in 35 ms. (1111 steps per ms) remains 2/2 properties
Probably explored full state space saw : 809046 states, properties seen :1
Probabilistic random walk after 2090207 steps, saw 809046 distinct states, run finished after 2163 ms. (steps per millisecond=966 ) properties seen :1
Explored full state space saw : 812642 states, properties seen :0
Exhaustive walk after 2099778 steps, saw 812642 distinct states, run finished after 1953 ms. (steps per millisecond=1075 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-11 in 12860 ms.
[2024-05-21 11:29:44] [INFO ] Flatten gal took : 62 ms
[2024-05-21 11:29:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 4 ms.
[2024-05-21 11:29:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 130 transitions and 513 arcs took 4 ms.
Total runtime 70509 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DBSingleClientW-PT-d1m06

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 98
TRANSITIONS: 130
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 802
MODEL NAME: /home/mcc/execution/413/model
98 places, 130 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 3 TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716290992789

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

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

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="DBSingleClientW-PT-d1m06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is DBSingleClientW-PT-d1m06, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r091-tall-171624187900509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m06.tgz
mv DBSingleClientW-PT-d1m06 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;