MCC'2023- Execution of r139-smll-167819423100477

About the Execution of Smart+red for DoubleExponent-PT-010

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
6525.663	3600000.00	3670162.00	8782.40	? ? 1 1 ? 1 ? ? ? ? ? ? ? ? 2 ?	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r139-smll-167819423100477.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is DoubleExponent-PT-010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r139-smll-167819423100477
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.2K Feb 26 13:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 26 13:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 26 13:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 13:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Feb 26 13:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 13:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 169K Mar 5 18:22 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 DoubleExponent-PT-010-UpperBounds-00
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-01
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-02
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-03
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-04
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-05
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-06
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-07
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-08
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-09
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-10
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-11
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-12
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-13
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-14
FORMULA_NAME DoubleExponent-PT-010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678418841578

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-010
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-10 03:27:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-10 03:27:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-10 03:27:24] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2023-03-10 03:27:24] [INFO ] Transformed 534 places.
[2023-03-10 03:27:24] [INFO ] Transformed 498 transitions.
[2023-03-10 03:27:24] [INFO ] Parsed PT model containing 534 places and 498 transitions and 1404 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 498 rows 534 cols
[2023-03-10 03:27:24] [INFO ] Computed 54 place invariants in 169 ms
Incomplete random walk after 10000 steps, including 324 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 16) seen :4
FORMULA DoubleExponent-PT-010-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 293 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 10000 steps, including 282 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 289 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 285 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10001 steps, including 281 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 289 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 288 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 283 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 291 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 15) seen :2
Incomplete Best-First random walk after 10000 steps, including 287 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 15) seen :2
[2023-03-10 03:27:25] [INFO ] Invariant cache hit.
[2023-03-10 03:27:25] [INFO ] [Real]Absence check using 3 positive place invariants in 16 ms returned sat
[2023-03-10 03:27:25] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 48 ms returned sat
[2023-03-10 03:27:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:26] [INFO ] [Real]Absence check using state equation in 342 ms returned sat
[2023-03-10 03:27:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:27:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-10 03:27:26] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 42 ms returned sat
[2023-03-10 03:27:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:26] [INFO ] [Nat]Absence check using state equation in 497 ms returned sat
[2023-03-10 03:27:27] [INFO ] Deduced a trap composed of 65 places in 368 ms of which 6 ms to minimize.
[2023-03-10 03:27:27] [INFO ] Deduced a trap composed of 35 places in 311 ms of which 2 ms to minimize.
[2023-03-10 03:27:28] [INFO ] Deduced a trap composed of 236 places in 382 ms of which 4 ms to minimize.
[2023-03-10 03:27:28] [INFO ] Deduced a trap composed of 176 places in 399 ms of which 4 ms to minimize.
[2023-03-10 03:27:29] [INFO ] Deduced a trap composed of 228 places in 355 ms of which 1 ms to minimize.
[2023-03-10 03:27:29] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2213 ms
[2023-03-10 03:27:29] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 52 ms.
[2023-03-10 03:27:31] [INFO ] Deduced a trap composed of 8 places in 243 ms of which 1 ms to minimize.
[2023-03-10 03:27:31] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 03:27:31] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-10 03:27:31] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 39 ms returned sat
[2023-03-10 03:27:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:32] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2023-03-10 03:27:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:27:32] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:27:32] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-10 03:27:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:32] [INFO ] [Nat]Absence check using state equation in 401 ms returned sat
[2023-03-10 03:27:33] [INFO ] Deduced a trap composed of 193 places in 372 ms of which 1 ms to minimize.
[2023-03-10 03:27:33] [INFO ] Deduced a trap composed of 126 places in 93 ms of which 1 ms to minimize.
[2023-03-10 03:27:33] [INFO ] Deduced a trap composed of 113 places in 99 ms of which 1 ms to minimize.
[2023-03-10 03:27:33] [INFO ] Deduced a trap composed of 115 places in 138 ms of which 1 ms to minimize.
[2023-03-10 03:27:34] [INFO ] Deduced a trap composed of 89 places in 288 ms of which 1 ms to minimize.
[2023-03-10 03:27:34] [INFO ] Deduced a trap composed of 221 places in 245 ms of which 1 ms to minimize.
[2023-03-10 03:27:34] [INFO ] Deduced a trap composed of 229 places in 350 ms of which 2 ms to minimize.
[2023-03-10 03:27:35] [INFO ] Deduced a trap composed of 29 places in 239 ms of which 1 ms to minimize.
[2023-03-10 03:27:35] [INFO ] Deduced a trap composed of 31 places in 243 ms of which 1 ms to minimize.
[2023-03-10 03:27:35] [INFO ] Deduced a trap composed of 91 places in 278 ms of which 1 ms to minimize.
[2023-03-10 03:27:35] [INFO ] Deduced a trap composed of 165 places in 270 ms of which 1 ms to minimize.
[2023-03-10 03:27:36] [INFO ] Deduced a trap composed of 103 places in 138 ms of which 1 ms to minimize.
[2023-03-10 03:27:36] [INFO ] Deduced a trap composed of 101 places in 100 ms of which 1 ms to minimize.
[2023-03-10 03:27:36] [INFO ] Deduced a trap composed of 65 places in 286 ms of which 1 ms to minimize.
[2023-03-10 03:27:37] [INFO ] Deduced a trap composed of 67 places in 234 ms of which 1 ms to minimize.
[2023-03-10 03:27:37] [INFO ] Deduced a trap composed of 224 places in 346 ms of which 1 ms to minimize.
[2023-03-10 03:27:37] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 1
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 03:27:37] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-10 03:27:37] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 26 ms returned unsat
[2023-03-10 03:27:37] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-10 03:27:37] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned unsat
[2023-03-10 03:27:37] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 03:27:37] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2023-03-10 03:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:38] [INFO ] [Real]Absence check using state equation in 361 ms returned sat
[2023-03-10 03:27:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:27:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-10 03:27:38] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 36 ms returned sat
[2023-03-10 03:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:39] [INFO ] [Nat]Absence check using state equation in 782 ms returned sat
[2023-03-10 03:27:39] [INFO ] Deduced a trap composed of 55 places in 358 ms of which 1 ms to minimize.
[2023-03-10 03:27:40] [INFO ] Deduced a trap composed of 190 places in 357 ms of which 1 ms to minimize.
[2023-03-10 03:27:40] [INFO ] Deduced a trap composed of 189 places in 369 ms of which 1 ms to minimize.
[2023-03-10 03:27:40] [INFO ] Deduced a trap composed of 186 places in 360 ms of which 2 ms to minimize.
[2023-03-10 03:27:41] [INFO ] Deduced a trap composed of 67 places in 283 ms of which 1 ms to minimize.
[2023-03-10 03:27:41] [INFO ] Deduced a trap composed of 166 places in 270 ms of which 1 ms to minimize.
[2023-03-10 03:27:41] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 2275 ms
[2023-03-10 03:27:41] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 36 ms.
[2023-03-10 03:27:42] [INFO ] Added : 150 causal constraints over 30 iterations in 1440 ms. Result :sat
Minimization took 340 ms.
[2023-03-10 03:27:43] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 03:27:43] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 22 ms returned sat
[2023-03-10 03:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:43] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2023-03-10 03:27:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:27:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:27:43] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-10 03:27:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:44] [INFO ] [Nat]Absence check using state equation in 256 ms returned sat
[2023-03-10 03:27:44] [INFO ] Deduced a trap composed of 211 places in 381 ms of which 1 ms to minimize.
[2023-03-10 03:27:44] [INFO ] Deduced a trap composed of 192 places in 367 ms of which 1 ms to minimize.
[2023-03-10 03:27:45] [INFO ] Deduced a trap composed of 189 places in 461 ms of which 1 ms to minimize.
[2023-03-10 03:27:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1418 ms
[2023-03-10 03:27:45] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 48 ms.
[2023-03-10 03:27:46] [INFO ] Added : 109 causal constraints over 22 iterations in 1343 ms. Result :sat
Minimization took 619 ms.
[2023-03-10 03:27:47] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-10 03:27:47] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-10 03:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:48] [INFO ] [Real]Absence check using state equation in 506 ms returned sat
[2023-03-10 03:27:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:27:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-10 03:27:48] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 41 ms returned sat
[2023-03-10 03:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:49] [INFO ] [Nat]Absence check using state equation in 705 ms returned sat
[2023-03-10 03:27:49] [INFO ] Deduced a trap composed of 205 places in 201 ms of which 0 ms to minimize.
[2023-03-10 03:27:49] [INFO ] Deduced a trap composed of 226 places in 226 ms of which 1 ms to minimize.
[2023-03-10 03:27:49] [INFO ] Deduced a trap composed of 241 places in 302 ms of which 2 ms to minimize.
[2023-03-10 03:27:50] [INFO ] Deduced a trap composed of 41 places in 370 ms of which 3 ms to minimize.
[2023-03-10 03:27:50] [INFO ] Deduced a trap composed of 83 places in 363 ms of which 2 ms to minimize.
[2023-03-10 03:27:51] [INFO ] Deduced a trap composed of 49 places in 404 ms of which 1 ms to minimize.
[2023-03-10 03:27:51] [INFO ] Deduced a trap composed of 214 places in 277 ms of which 1 ms to minimize.
[2023-03-10 03:27:51] [INFO ] Deduced a trap composed of 219 places in 244 ms of which 1 ms to minimize.
[2023-03-10 03:27:52] [INFO ] Deduced a trap composed of 213 places in 203 ms of which 1 ms to minimize.
[2023-03-10 03:27:52] [INFO ] Deduced a trap composed of 218 places in 235 ms of which 1 ms to minimize.
[2023-03-10 03:27:52] [INFO ] Deduced a trap composed of 199 places in 235 ms of which 1 ms to minimize.
[2023-03-10 03:27:53] [INFO ] Deduced a trap composed of 211 places in 219 ms of which 1 ms to minimize.
[2023-03-10 03:27:53] [INFO ] Deduced a trap composed of 198 places in 204 ms of which 1 ms to minimize.
[2023-03-10 03:27:53] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 6
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 03:27:53] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:27:53] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 32 ms returned sat
[2023-03-10 03:27:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:53] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2023-03-10 03:27:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:27:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:27:54] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-10 03:27:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:54] [INFO ] [Nat]Absence check using state equation in 282 ms returned sat
[2023-03-10 03:27:54] [INFO ] Deduced a trap composed of 209 places in 369 ms of which 1 ms to minimize.
[2023-03-10 03:27:55] [INFO ] Deduced a trap composed of 203 places in 359 ms of which 1 ms to minimize.
[2023-03-10 03:27:55] [INFO ] Deduced a trap composed of 43 places in 376 ms of which 1 ms to minimize.
[2023-03-10 03:27:56] [INFO ] Deduced a trap composed of 220 places in 445 ms of which 1 ms to minimize.
[2023-03-10 03:27:56] [INFO ] Deduced a trap composed of 41 places in 362 ms of which 2 ms to minimize.
[2023-03-10 03:27:56] [INFO ] Deduced a trap composed of 204 places in 358 ms of which 1 ms to minimize.
[2023-03-10 03:27:57] [INFO ] Deduced a trap composed of 221 places in 367 ms of which 1 ms to minimize.
[2023-03-10 03:27:57] [INFO ] Deduced a trap composed of 223 places in 364 ms of which 1 ms to minimize.
[2023-03-10 03:27:58] [INFO ] Deduced a trap composed of 225 places in 361 ms of which 1 ms to minimize.
[2023-03-10 03:27:58] [INFO ] Deduced a trap composed of 221 places in 236 ms of which 1 ms to minimize.
[2023-03-10 03:27:58] [INFO ] Deduced a trap composed of 207 places in 350 ms of which 1 ms to minimize.
[2023-03-10 03:27:59] [INFO ] Deduced a trap composed of 237 places in 369 ms of which 6 ms to minimize.
[2023-03-10 03:27:59] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 7
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 03:27:59] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-10 03:27:59] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 39 ms returned sat
[2023-03-10 03:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:27:59] [INFO ] [Real]Absence check using state equation in 398 ms returned sat
[2023-03-10 03:27:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:27:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-10 03:27:59] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 40 ms returned sat
[2023-03-10 03:27:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:00] [INFO ] [Nat]Absence check using state equation in 625 ms returned sat
[2023-03-10 03:28:00] [INFO ] Deduced a trap composed of 203 places in 258 ms of which 1 ms to minimize.
[2023-03-10 03:28:00] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 1 ms to minimize.
[2023-03-10 03:28:01] [INFO ] Deduced a trap composed of 91 places in 163 ms of which 1 ms to minimize.
[2023-03-10 03:28:01] [INFO ] Deduced a trap composed of 65 places in 232 ms of which 1 ms to minimize.
[2023-03-10 03:28:01] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 983 ms
[2023-03-10 03:28:01] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-10 03:28:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ... while checking expression at index 8
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 03:28:04] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-10 03:28:04] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 45 ms returned sat
[2023-03-10 03:28:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:05] [INFO ] [Real]Absence check using state equation in 451 ms returned sat
[2023-03-10 03:28:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:28:05] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:28:05] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-10 03:28:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:05] [INFO ] [Nat]Absence check using state equation in 315 ms returned sat
[2023-03-10 03:28:06] [INFO ] Deduced a trap composed of 206 places in 452 ms of which 2 ms to minimize.
[2023-03-10 03:28:06] [INFO ] Deduced a trap composed of 204 places in 416 ms of which 1 ms to minimize.
[2023-03-10 03:28:07] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 1 ms to minimize.
[2023-03-10 03:28:07] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 0 ms to minimize.
[2023-03-10 03:28:07] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 1 ms to minimize.
[2023-03-10 03:28:07] [INFO ] Deduced a trap composed of 55 places in 251 ms of which 3 ms to minimize.
[2023-03-10 03:28:08] [INFO ] Deduced a trap composed of 41 places in 276 ms of which 4 ms to minimize.
[2023-03-10 03:28:08] [INFO ] Deduced a trap composed of 217 places in 313 ms of which 4 ms to minimize.
[2023-03-10 03:28:08] [INFO ] Deduced a trap composed of 77 places in 441 ms of which 1 ms to minimize.
[2023-03-10 03:28:09] [INFO ] Deduced a trap composed of 199 places in 280 ms of which 1 ms to minimize.
[2023-03-10 03:28:09] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 1 ms to minimize.
[2023-03-10 03:28:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3733 ms
[2023-03-10 03:28:09] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 50 ms.
[2023-03-10 03:28:10] [INFO ] Added : 20 causal constraints over 4 iterations in 819 ms. Result :unknown
[2023-03-10 03:28:10] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 03:28:10] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-10 03:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:10] [INFO ] [Real]Absence check using state equation in 360 ms returned sat
[2023-03-10 03:28:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:28:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:28:11] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-10 03:28:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:11] [INFO ] [Nat]Absence check using state equation in 411 ms returned sat
[2023-03-10 03:28:11] [INFO ] Deduced a trap composed of 185 places in 267 ms of which 1 ms to minimize.
[2023-03-10 03:28:12] [INFO ] Deduced a trap composed of 192 places in 407 ms of which 1 ms to minimize.
[2023-03-10 03:28:12] [INFO ] Deduced a trap composed of 189 places in 427 ms of which 1 ms to minimize.
[2023-03-10 03:28:13] [INFO ] Deduced a trap composed of 196 places in 271 ms of which 1 ms to minimize.
[2023-03-10 03:28:13] [INFO ] Deduced a trap composed of 228 places in 285 ms of which 1 ms to minimize.
[2023-03-10 03:28:13] [INFO ] Deduced a trap composed of 204 places in 288 ms of which 1 ms to minimize.
[2023-03-10 03:28:14] [INFO ] Deduced a trap composed of 236 places in 298 ms of which 1 ms to minimize.
[2023-03-10 03:28:14] [INFO ] Deduced a trap composed of 65 places in 303 ms of which 1 ms to minimize.
[2023-03-10 03:28:14] [INFO ] Deduced a trap composed of 215 places in 396 ms of which 1 ms to minimize.
[2023-03-10 03:28:15] [INFO ] Deduced a trap composed of 202 places in 397 ms of which 1 ms to minimize.
[2023-03-10 03:28:15] [INFO ] Deduced a trap composed of 177 places in 395 ms of which 1 ms to minimize.
[2023-03-10 03:28:15] [INFO ] Deduced a trap composed of 101 places in 174 ms of which 1 ms to minimize.
[2023-03-10 03:28:15] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 4396 ms
[2023-03-10 03:28:15] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-10 03:28:16] [INFO ] Deduced a trap composed of 8 places in 313 ms of which 1 ms to minimize.
[2023-03-10 03:28:16] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 10
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 03:28:16] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:28:16] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 31 ms returned sat
[2023-03-10 03:28:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:16] [INFO ] [Real]Absence check using state equation in 401 ms returned sat
[2023-03-10 03:28:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:28:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-10 03:28:17] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 31 ms returned sat
[2023-03-10 03:28:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:17] [INFO ] [Nat]Absence check using state equation in 311 ms returned sat
[2023-03-10 03:28:17] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 49 ms.
[2023-03-10 03:28:21] [INFO ] Added : 275 causal constraints over 55 iterations in 4502 ms. Result :unknown
[2023-03-10 03:28:22] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:28:22] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 30 ms returned sat
[2023-03-10 03:28:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:22] [INFO ] [Real]Absence check using state equation in 300 ms returned sat
[2023-03-10 03:28:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:28:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:28:22] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 28 ms returned sat
[2023-03-10 03:28:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:22] [INFO ] [Nat]Absence check using state equation in 304 ms returned sat
[2023-03-10 03:28:23] [INFO ] Deduced a trap composed of 18 places in 245 ms of which 1 ms to minimize.
[2023-03-10 03:28:23] [INFO ] Deduced a trap composed of 174 places in 242 ms of which 0 ms to minimize.
[2023-03-10 03:28:23] [INFO ] Deduced a trap composed of 167 places in 196 ms of which 1 ms to minimize.
[2023-03-10 03:28:23] [INFO ] Deduced a trap composed of 53 places in 297 ms of which 1 ms to minimize.
[2023-03-10 03:28:24] [INFO ] Deduced a trap composed of 169 places in 197 ms of which 0 ms to minimize.
[2023-03-10 03:28:24] [INFO ] Deduced a trap composed of 41 places in 200 ms of which 0 ms to minimize.
[2023-03-10 03:28:24] [INFO ] Deduced a trap composed of 183 places in 180 ms of which 0 ms to minimize.
[2023-03-10 03:28:25] [INFO ] Deduced a trap composed of 194 places in 301 ms of which 1 ms to minimize.
[2023-03-10 03:28:25] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2298 ms
[2023-03-10 03:28:25] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-10 03:28:27] [INFO ] Deduced a trap composed of 214 places in 409 ms of which 1 ms to minimize.
[2023-03-10 03:28:27] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 12
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 03:28:27] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2023-03-10 03:28:27] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 42 ms returned sat
[2023-03-10 03:28:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:28] [INFO ] [Real]Absence check using state equation in 520 ms returned sat
[2023-03-10 03:28:28] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:28:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:28:28] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 29 ms returned sat
[2023-03-10 03:28:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:29] [INFO ] [Nat]Absence check using state equation in 605 ms returned sat
[2023-03-10 03:28:29] [INFO ] Deduced a trap composed of 232 places in 256 ms of which 2 ms to minimize.
[2023-03-10 03:28:29] [INFO ] Deduced a trap composed of 186 places in 313 ms of which 1 ms to minimize.
[2023-03-10 03:28:30] [INFO ] Deduced a trap composed of 204 places in 304 ms of which 1 ms to minimize.
[2023-03-10 03:28:30] [INFO ] Deduced a trap composed of 229 places in 282 ms of which 1 ms to minimize.
[2023-03-10 03:28:30] [INFO ] Deduced a trap composed of 67 places in 218 ms of which 1 ms to minimize.
[2023-03-10 03:28:30] [INFO ] Deduced a trap composed of 31 places in 339 ms of which 1 ms to minimize.
[2023-03-10 03:28:31] [INFO ] Deduced a trap composed of 221 places in 226 ms of which 1 ms to minimize.
[2023-03-10 03:28:31] [INFO ] Deduced a trap composed of 241 places in 219 ms of which 1 ms to minimize.
[2023-03-10 03:28:31] [INFO ] Deduced a trap composed of 221 places in 225 ms of which 1 ms to minimize.
[2023-03-10 03:28:32] [INFO ] Deduced a trap composed of 225 places in 222 ms of which 1 ms to minimize.
[2023-03-10 03:28:32] [INFO ] Deduced a trap composed of 226 places in 338 ms of which 1 ms to minimize.
[2023-03-10 03:28:32] [INFO ] Deduced a trap composed of 217 places in 302 ms of which 1 ms to minimize.
[2023-03-10 03:28:33] [INFO ] Deduced a trap composed of 203 places in 273 ms of which 1 ms to minimize.
[2023-03-10 03:28:33] [INFO ] Deduced a trap composed of 206 places in 300 ms of which 1 ms to minimize.
[2023-03-10 03:28:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 13
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-10 03:28:33] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:28:33] [INFO ] [Real]Absence check using 3 positive and 51 generalized place invariants in 35 ms returned sat
[2023-03-10 03:28:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:34] [INFO ] [Real]Absence check using state equation in 679 ms returned sat
[2023-03-10 03:28:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:28:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-10 03:28:34] [INFO ] [Nat]Absence check using 3 positive and 51 generalized place invariants in 29 ms returned sat
[2023-03-10 03:28:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:34] [INFO ] [Nat]Absence check using state equation in 358 ms returned sat
[2023-03-10 03:28:35] [INFO ] Computed and/alt/rep : 497/963/497 causal constraints (skipped 0 transitions) in 51 ms.
[2023-03-10 03:28:39] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 14
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:714)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, 1, 2, -1, -1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 1, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DoubleExponent-PT-010-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 13 out of 534 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 534/534 places, 498/498 transitions.
Graph (complete) has 906 edges and 534 vertex of which 528 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions removed 106 transitions
Trivial Post-agglo rules discarded 106 transitions
Performed 106 trivial Post agglomeration. Transition count delta: 106
Iterating post reduction 0 with 109 rules applied. Total rules applied 110 place count 527 transition count 390
Reduce places removed 106 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 109 rules applied. Total rules applied 219 place count 421 transition count 387
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 222 place count 418 transition count 387
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 222 place count 418 transition count 365
Deduced a syphon composed of 22 places in 3 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 266 place count 396 transition count 365
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 4 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 446 place count 306 transition count 275
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 480 place count 289 transition count 275
Free-agglomeration rule (complex) applied 37 times.
Iterating global reduction 3 with 37 rules applied. Total rules applied 517 place count 289 transition count 238
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 3 with 37 rules applied. Total rules applied 554 place count 252 transition count 238
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 4 with 42 rules applied. Total rules applied 596 place count 252 transition count 238
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 597 place count 251 transition count 237
Applied a total of 597 rules in 204 ms. Remains 251 /534 variables (removed 283) and now considering 237/498 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 251/534 places, 237/498 transitions.
// Phase 1: matrix 237 rows 251 cols
[2023-03-10 03:28:40] [INFO ] Computed 50 place invariants in 24 ms
Incomplete random walk after 1000000 steps, including 127744 resets, run finished after 1448 ms. (steps per millisecond=690 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84739 resets, run finished after 1050 ms. (steps per millisecond=952 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84611 resets, run finished after 856 ms. (steps per millisecond=1168 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84761 resets, run finished after 836 ms. (steps per millisecond=1196 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84780 resets, run finished after 835 ms. (steps per millisecond=1197 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000001 steps, including 84784 resets, run finished after 836 ms. (steps per millisecond=1196 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84856 resets, run finished after 836 ms. (steps per millisecond=1196 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84990 resets, run finished after 846 ms. (steps per millisecond=1182 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84829 resets, run finished after 841 ms. (steps per millisecond=1189 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84654 resets, run finished after 857 ms. (steps per millisecond=1166 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84847 resets, run finished after 837 ms. (steps per millisecond=1194 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84766 resets, run finished after 834 ms. (steps per millisecond=1199 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84370 resets, run finished after 839 ms. (steps per millisecond=1191 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1000000 steps, including 84727 resets, run finished after 833 ms. (steps per millisecond=1200 ) properties (out of 13) seen :1
[2023-03-10 03:28:53] [INFO ] Invariant cache hit.
[2023-03-10 03:28:53] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:28:53] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-10 03:28:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:53] [INFO ] [Real]Absence check using state equation in 146 ms returned sat
[2023-03-10 03:28:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:28:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:28:53] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-10 03:28:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:53] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-10 03:28:53] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:28:54] [INFO ] [Nat]Added 33 Read/Feed constraints in 86 ms returned sat
[2023-03-10 03:28:54] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 33 ms.
[2023-03-10 03:28:55] [INFO ] Deduced a trap composed of 74 places in 180 ms of which 1 ms to minimize.
[2023-03-10 03:28:55] [INFO ] Deduced a trap composed of 20 places in 177 ms of which 1 ms to minimize.
[2023-03-10 03:28:55] [INFO ] Deduced a trap composed of 77 places in 238 ms of which 2 ms to minimize.
[2023-03-10 03:28:56] [INFO ] Deduced a trap composed of 68 places in 206 ms of which 0 ms to minimize.
[2023-03-10 03:28:56] [INFO ] Deduced a trap composed of 23 places in 126 ms of which 1 ms to minimize.
[2023-03-10 03:28:56] [INFO ] Deduced a trap composed of 24 places in 171 ms of which 1 ms to minimize.
[2023-03-10 03:28:56] [INFO ] Deduced a trap composed of 23 places in 154 ms of which 1 ms to minimize.
[2023-03-10 03:28:57] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 0 ms to minimize.
[2023-03-10 03:28:57] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2700 ms
[2023-03-10 03:28:57] [INFO ] Added : 92 causal constraints over 19 iterations in 3658 ms. Result :sat
Minimization took 225 ms.
[2023-03-10 03:28:58] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 03:28:58] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2023-03-10 03:28:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:58] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-03-10 03:28:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:28:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:28:58] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:28:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:28:58] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-10 03:28:58] [INFO ] [Nat]Added 33 Read/Feed constraints in 61 ms returned sat
[2023-03-10 03:28:58] [INFO ] Deduced a trap composed of 76 places in 157 ms of which 1 ms to minimize.
[2023-03-10 03:28:58] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 0 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 30 places in 92 ms of which 0 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 0 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 1 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2023-03-10 03:28:59] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1279 ms
[2023-03-10 03:28:59] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 29 ms.
[2023-03-10 03:29:01] [INFO ] Deduced a trap composed of 12 places in 136 ms of which 1 ms to minimize.
[2023-03-10 03:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-10 03:29:01] [INFO ] Added : 132 causal constraints over 27 iterations in 1925 ms. Result :sat
Minimization took 402 ms.
[2023-03-10 03:29:02] [INFO ] [Real]Absence check using 2 positive place invariants in 13 ms returned sat
[2023-03-10 03:29:02] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 23 ms returned sat
[2023-03-10 03:29:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:02] [INFO ] [Real]Absence check using state equation in 203 ms returned sat
[2023-03-10 03:29:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 03:29:02] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 29 ms returned sat
[2023-03-10 03:29:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:02] [INFO ] [Nat]Absence check using state equation in 224 ms returned sat
[2023-03-10 03:29:02] [INFO ] [Nat]Added 33 Read/Feed constraints in 90 ms returned sat
[2023-03-10 03:29:03] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 31 ms.
[2023-03-10 03:29:05] [INFO ] Deduced a trap composed of 9 places in 274 ms of which 1 ms to minimize.
[2023-03-10 03:29:05] [INFO ] Deduced a trap composed of 78 places in 232 ms of which 1 ms to minimize.
[2023-03-10 03:29:05] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 1 ms to minimize.
[2023-03-10 03:29:05] [INFO ] Deduced a trap composed of 54 places in 113 ms of which 1 ms to minimize.
[2023-03-10 03:29:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 989 ms
[2023-03-10 03:29:05] [INFO ] Added : 82 causal constraints over 17 iterations in 2872 ms. Result :sat
Minimization took 257 ms.
[2023-03-10 03:29:06] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:29:06] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned unsat
[2023-03-10 03:29:06] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:06] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:29:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:06] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2023-03-10 03:29:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:06] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-10 03:29:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:06] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2023-03-10 03:29:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 455 ms returned sat
[2023-03-10 03:29:07] [INFO ] Deduced a trap composed of 12 places in 137 ms of which 1 ms to minimize.
[2023-03-10 03:29:07] [INFO ] Deduced a trap composed of 14 places in 277 ms of which 1 ms to minimize.
[2023-03-10 03:29:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 465 ms
[2023-03-10 03:29:07] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 25 ms.
[2023-03-10 03:29:09] [INFO ] Added : 129 causal constraints over 26 iterations in 1897 ms. Result :sat
Minimization took 695 ms.
[2023-03-10 03:29:10] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:10] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-10 03:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:10] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-10 03:29:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:10] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:29:10] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-10 03:29:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:10] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-10 03:29:11] [INFO ] [Nat]Added 33 Read/Feed constraints in 650 ms returned sat
[2023-03-10 03:29:11] [INFO ] Deduced a trap composed of 12 places in 174 ms of which 1 ms to minimize.
[2023-03-10 03:29:11] [INFO ] Deduced a trap composed of 13 places in 214 ms of which 1 ms to minimize.
[2023-03-10 03:29:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 464 ms
[2023-03-10 03:29:11] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 19 ms.
[2023-03-10 03:29:13] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 0 ms to minimize.
[2023-03-10 03:29:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 249 ms
[2023-03-10 03:29:13] [INFO ] Added : 97 causal constraints over 21 iterations in 1787 ms. Result :sat
Minimization took 716 ms.
[2023-03-10 03:29:14] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:14] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:29:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:14] [INFO ] [Real]Absence check using state equation in 149 ms returned sat
[2023-03-10 03:29:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 03:29:14] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 30 ms returned sat
[2023-03-10 03:29:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:14] [INFO ] [Nat]Absence check using state equation in 222 ms returned sat
[2023-03-10 03:29:15] [INFO ] [Nat]Added 33 Read/Feed constraints in 169 ms returned sat
[2023-03-10 03:29:15] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 30 ms.
[2023-03-10 03:29:18] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 1 ms to minimize.
[2023-03-10 03:29:18] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-10 03:29:18] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 1 ms to minimize.
[2023-03-10 03:29:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 464 ms
[2023-03-10 03:29:18] [INFO ] Added : 172 causal constraints over 35 iterations in 3496 ms. Result :sat
Minimization took 716 ms.
[2023-03-10 03:29:19] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:19] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2023-03-10 03:29:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:19] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2023-03-10 03:29:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:19] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:19] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2023-03-10 03:29:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:19] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-10 03:29:20] [INFO ] [Nat]Added 33 Read/Feed constraints in 267 ms returned sat
[2023-03-10 03:29:20] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 0 ms to minimize.
[2023-03-10 03:29:20] [INFO ] Deduced a trap composed of 18 places in 223 ms of which 0 ms to minimize.
[2023-03-10 03:29:20] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 0 ms to minimize.
[2023-03-10 03:29:20] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2023-03-10 03:29:20] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 0 ms to minimize.
[2023-03-10 03:29:20] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 886 ms
[2023-03-10 03:29:20] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 20 ms.
[2023-03-10 03:29:22] [INFO ] Added : 85 causal constraints over 17 iterations in 1133 ms. Result :sat
Minimization took 321 ms.
[2023-03-10 03:29:22] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:22] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:29:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:22] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-10 03:29:22] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:22] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:29:22] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:29:22] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:22] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-10 03:29:22] [INFO ] [Nat]Added 33 Read/Feed constraints in 73 ms returned sat
[2023-03-10 03:29:23] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 26 ms.
[2023-03-10 03:29:25] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 0 ms to minimize.
[2023-03-10 03:29:25] [INFO ] Deduced a trap composed of 54 places in 170 ms of which 0 ms to minimize.
[2023-03-10 03:29:25] [INFO ] Deduced a trap composed of 72 places in 258 ms of which 1 ms to minimize.
[2023-03-10 03:29:25] [INFO ] Deduced a trap composed of 87 places in 191 ms of which 1 ms to minimize.
[2023-03-10 03:29:26] [INFO ] Deduced a trap composed of 87 places in 239 ms of which 1 ms to minimize.
[2023-03-10 03:29:26] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 1 ms to minimize.
[2023-03-10 03:29:26] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 1 ms to minimize.
[2023-03-10 03:29:26] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 0 ms to minimize.
[2023-03-10 03:29:26] [INFO ] Deduced a trap composed of 74 places in 150 ms of which 1 ms to minimize.
[2023-03-10 03:29:27] [INFO ] Deduced a trap composed of 82 places in 226 ms of which 0 ms to minimize.
[2023-03-10 03:29:27] [INFO ] Deduced a trap composed of 77 places in 213 ms of which 1 ms to minimize.
[2023-03-10 03:29:27] [INFO ] Deduced a trap composed of 78 places in 244 ms of which 1 ms to minimize.
[2023-03-10 03:29:28] [INFO ] Deduced a trap composed of 82 places in 244 ms of which 1 ms to minimize.
[2023-03-10 03:29:28] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3232 ms
[2023-03-10 03:29:28] [INFO ] Added : 179 causal constraints over 36 iterations in 5208 ms. Result :sat
Minimization took 522 ms.
[2023-03-10 03:29:28] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:29:28] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-10 03:29:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:29] [INFO ] [Real]Absence check using state equation in 181 ms returned sat
[2023-03-10 03:29:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:29] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:29] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-10 03:29:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:29] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2023-03-10 03:29:29] [INFO ] [Nat]Added 33 Read/Feed constraints in 90 ms returned sat
[2023-03-10 03:29:29] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 17 ms.
[2023-03-10 03:29:30] [INFO ] Added : 120 causal constraints over 24 iterations in 1072 ms. Result :sat
Minimization took 225 ms.
[2023-03-10 03:29:30] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:30] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 19 ms returned sat
[2023-03-10 03:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:30] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-10 03:29:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 03:29:30] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 26 ms returned sat
[2023-03-10 03:29:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:31] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2023-03-10 03:29:31] [INFO ] [Nat]Added 33 Read/Feed constraints in 47 ms returned sat
[2023-03-10 03:29:31] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 21 ms.
[2023-03-10 03:29:31] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 1 ms to minimize.
[2023-03-10 03:29:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 314 ms
[2023-03-10 03:29:32] [INFO ] Added : 69 causal constraints over 15 iterations in 1010 ms. Result :sat
Minimization took 450 ms.
[2023-03-10 03:29:32] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:29:32] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:29:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:32] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2023-03-10 03:29:32] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:32] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:29:33] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-10 03:29:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:33] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-10 03:29:33] [INFO ] [Nat]Added 33 Read/Feed constraints in 224 ms returned sat
[2023-03-10 03:29:33] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 21 ms.
[2023-03-10 03:29:35] [INFO ] Added : 139 causal constraints over 28 iterations in 1805 ms. Result :sat
Minimization took 357 ms.
[2023-03-10 03:29:35] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:29:35] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-10 03:29:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:35] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2023-03-10 03:29:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:29:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:29:36] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-10 03:29:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:29:36] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2023-03-10 03:29:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 200 ms returned sat
[2023-03-10 03:29:36] [INFO ] Computed and/alt/rep : 199/1052/199 causal constraints (skipped 37 transitions) in 30 ms.
[2023-03-10 03:29:37] [INFO ] Deduced a trap composed of 4 places in 217 ms of which 2 ms to minimize.
[2023-03-10 03:29:38] [INFO ] Deduced a trap composed of 9 places in 203 ms of which 2 ms to minimize.
[2023-03-10 03:29:38] [INFO ] Deduced a trap composed of 13 places in 121 ms of which 1 ms to minimize.
[2023-03-10 03:29:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 662 ms
[2023-03-10 03:29:38] [INFO ] Added : 124 causal constraints over 25 iterations in 1776 ms. Result :sat
Minimization took 438 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, 1, -1, -1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA DoubleExponent-PT-010-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 12 out of 251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 251/251 places, 237/237 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 250 transition count 236
Applied a total of 2 rules in 26 ms. Remains 250 /251 variables (removed 1) and now considering 236/237 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 250/251 places, 236/237 transitions.
// Phase 1: matrix 236 rows 250 cols
[2023-03-10 03:30:24] [INFO ] Computed 50 place invariants in 20 ms
Incomplete random walk after 1000000 steps, including 128294 resets, run finished after 1141 ms. (steps per millisecond=876 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84887 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 85012 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84674 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84977 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84571 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84659 resets, run finished after 823 ms. (steps per millisecond=1215 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84388 resets, run finished after 828 ms. (steps per millisecond=1207 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84655 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84666 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 84872 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84687 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 84684 resets, run finished after 822 ms. (steps per millisecond=1216 ) properties (out of 12) seen :0
[2023-03-10 03:30:35] [INFO ] Invariant cache hit.
[2023-03-10 03:30:35] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:35] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 17 ms returned sat
[2023-03-10 03:30:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:36] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2023-03-10 03:30:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:30:36] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:36] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:30:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:36] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2023-03-10 03:30:36] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:30:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 69 ms returned sat
[2023-03-10 03:30:36] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
[2023-03-10 03:30:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2023-03-10 03:30:36] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 24 ms.
[2023-03-10 03:30:37] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 0 ms to minimize.
[2023-03-10 03:30:37] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 1 ms to minimize.
[2023-03-10 03:30:38] [INFO ] Deduced a trap composed of 70 places in 178 ms of which 1 ms to minimize.
[2023-03-10 03:30:38] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 1 ms to minimize.
[2023-03-10 03:30:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 905 ms
[2023-03-10 03:30:38] [INFO ] Added : 109 causal constraints over 23 iterations in 1998 ms. Result :sat
Minimization took 353 ms.
[2023-03-10 03:30:38] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 03:30:38] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2023-03-10 03:30:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:39] [INFO ] [Real]Absence check using state equation in 184 ms returned sat
[2023-03-10 03:30:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:30:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:30:39] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:30:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:39] [INFO ] [Nat]Absence check using state equation in 147 ms returned sat
[2023-03-10 03:30:39] [INFO ] [Nat]Added 33 Read/Feed constraints in 72 ms returned sat
[2023-03-10 03:30:39] [INFO ] Deduced a trap composed of 75 places in 158 ms of which 1 ms to minimize.
[2023-03-10 03:30:40] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 1 ms to minimize.
[2023-03-10 03:30:40] [INFO ] Deduced a trap composed of 16 places in 168 ms of which 1 ms to minimize.
[2023-03-10 03:30:40] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 783 ms
[2023-03-10 03:30:40] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 25 ms.
[2023-03-10 03:30:41] [INFO ] Added : 119 causal constraints over 24 iterations in 1183 ms. Result :sat
Minimization took 273 ms.
[2023-03-10 03:30:41] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:41] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2023-03-10 03:30:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:42] [INFO ] [Real]Absence check using state equation in 172 ms returned sat
[2023-03-10 03:30:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:30:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:42] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:30:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:42] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-10 03:30:42] [INFO ] [Nat]Added 33 Read/Feed constraints in 90 ms returned sat
[2023-03-10 03:30:42] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 25 ms.
[2023-03-10 03:30:42] [INFO ] Added : 56 causal constraints over 12 iterations in 550 ms. Result :sat
Minimization took 442 ms.
[2023-03-10 03:30:43] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:43] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-10 03:30:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:43] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2023-03-10 03:30:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:30:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:30:43] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-10 03:30:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:43] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-10 03:30:44] [INFO ] [Nat]Added 33 Read/Feed constraints in 853 ms returned sat
[2023-03-10 03:30:44] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 25 ms.
[2023-03-10 03:30:46] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 1 ms to minimize.
[2023-03-10 03:30:46] [INFO ] Deduced a trap composed of 20 places in 138 ms of which 1 ms to minimize.
[2023-03-10 03:30:46] [INFO ] Deduced a trap composed of 14 places in 137 ms of which 1 ms to minimize.
[2023-03-10 03:30:46] [INFO ] Deduced a trap composed of 18 places in 87 ms of which 1 ms to minimize.
[2023-03-10 03:30:47] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-10 03:30:47] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2023-03-10 03:30:47] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 0 ms to minimize.
[2023-03-10 03:30:47] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1037 ms
[2023-03-10 03:30:47] [INFO ] Added : 123 causal constraints over 25 iterations in 2635 ms. Result :sat
Minimization took 280 ms.
[2023-03-10 03:30:47] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:47] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:30:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:47] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-10 03:30:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:30:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:48] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:30:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:48] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2023-03-10 03:30:48] [INFO ] [Nat]Added 33 Read/Feed constraints in 243 ms returned sat
[2023-03-10 03:30:48] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 25 ms.
[2023-03-10 03:30:49] [INFO ] Deduced a trap composed of 12 places in 230 ms of which 1 ms to minimize.
[2023-03-10 03:30:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2023-03-10 03:30:49] [INFO ] Added : 92 causal constraints over 20 iterations in 1321 ms. Result :sat
Minimization took 287 ms.
[2023-03-10 03:30:50] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:30:50] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-10 03:30:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:50] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2023-03-10 03:30:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:30:50] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:30:50] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 25 ms returned sat
[2023-03-10 03:30:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:50] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-10 03:30:50] [INFO ] [Nat]Added 33 Read/Feed constraints in 109 ms returned sat
[2023-03-10 03:30:50] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2023-03-10 03:30:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2023-03-10 03:30:50] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 19 ms.
[2023-03-10 03:30:52] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 1 ms to minimize.
[2023-03-10 03:30:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 153 ms
[2023-03-10 03:30:52] [INFO ] Added : 176 causal constraints over 36 iterations in 2023 ms. Result :sat
Minimization took 541 ms.
[2023-03-10 03:30:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:53] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:30:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:53] [INFO ] [Real]Absence check using state equation in 166 ms returned sat
[2023-03-10 03:30:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:30:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:53] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:30:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:54] [INFO ] [Nat]Absence check using state equation in 200 ms returned sat
[2023-03-10 03:30:54] [INFO ] [Nat]Added 33 Read/Feed constraints in 101 ms returned sat
[2023-03-10 03:30:54] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 1 ms to minimize.
[2023-03-10 03:30:54] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 1 ms to minimize.
[2023-03-10 03:30:54] [INFO ] Deduced a trap composed of 74 places in 168 ms of which 1 ms to minimize.
[2023-03-10 03:30:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 587 ms
[2023-03-10 03:30:54] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 26 ms.
[2023-03-10 03:30:55] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 1 ms to minimize.
[2023-03-10 03:30:55] [INFO ] Deduced a trap composed of 12 places in 265 ms of which 1 ms to minimize.
[2023-03-10 03:30:56] [INFO ] Deduced a trap composed of 8 places in 279 ms of which 1 ms to minimize.
[2023-03-10 03:30:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 809 ms
[2023-03-10 03:30:56] [INFO ] Added : 91 causal constraints over 19 iterations in 1647 ms. Result :sat
Minimization took 442 ms.
[2023-03-10 03:30:56] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:56] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:30:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:57] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-10 03:30:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:30:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:30:57] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:30:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:30:57] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2023-03-10 03:30:57] [INFO ] [Nat]Added 33 Read/Feed constraints in 139 ms returned sat
[2023-03-10 03:30:57] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 27 ms.
[2023-03-10 03:30:59] [INFO ] Deduced a trap composed of 21 places in 235 ms of which 0 ms to minimize.
[2023-03-10 03:30:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2023-03-10 03:30:59] [INFO ] Added : 164 causal constraints over 33 iterations in 2123 ms. Result :sat
Minimization took 371 ms.
[2023-03-10 03:31:00] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 03:31:00] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 27 ms returned sat
[2023-03-10 03:31:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:00] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2023-03-10 03:31:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:31:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-10 03:31:00] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:31:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:00] [INFO ] [Nat]Absence check using state equation in 182 ms returned sat
[2023-03-10 03:31:00] [INFO ] [Nat]Added 33 Read/Feed constraints in 141 ms returned sat
[2023-03-10 03:31:00] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 31 ms.
[2023-03-10 03:31:02] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 1 ms to minimize.
[2023-03-10 03:31:02] [INFO ] Deduced a trap composed of 13 places in 128 ms of which 1 ms to minimize.
[2023-03-10 03:31:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 343 ms
[2023-03-10 03:31:02] [INFO ] Added : 79 causal constraints over 17 iterations in 1371 ms. Result :sat
Minimization took 465 ms.
[2023-03-10 03:31:02] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:31:02] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 20 ms returned sat
[2023-03-10 03:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:02] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2023-03-10 03:31:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:31:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:31:03] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:03] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2023-03-10 03:31:03] [INFO ] [Nat]Added 33 Read/Feed constraints in 92 ms returned sat
[2023-03-10 03:31:03] [INFO ] Deduced a trap composed of 4 places in 163 ms of which 0 ms to minimize.
[2023-03-10 03:31:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2023-03-10 03:31:03] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 18 ms.
[2023-03-10 03:31:04] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2023-03-10 03:31:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 268 ms
[2023-03-10 03:31:04] [INFO ] Added : 51 causal constraints over 11 iterations in 637 ms. Result :sat
Minimization took 137 ms.
[2023-03-10 03:31:04] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-10 03:31:04] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 28 ms returned sat
[2023-03-10 03:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:04] [INFO ] [Real]Absence check using state equation in 215 ms returned sat
[2023-03-10 03:31:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:31:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:31:04] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:31:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:04] [INFO ] [Nat]Absence check using state equation in 162 ms returned sat
[2023-03-10 03:31:05] [INFO ] [Nat]Added 33 Read/Feed constraints in 104 ms returned sat
[2023-03-10 03:31:05] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 25 ms.
[2023-03-10 03:31:06] [INFO ] Deduced a trap composed of 12 places in 166 ms of which 1 ms to minimize.
[2023-03-10 03:31:06] [INFO ] Deduced a trap composed of 15 places in 167 ms of which 0 ms to minimize.
[2023-03-10 03:31:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 423 ms
[2023-03-10 03:31:06] [INFO ] Added : 139 causal constraints over 28 iterations in 1501 ms. Result :sat
Minimization took 378 ms.
[2023-03-10 03:31:07] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:31:07] [INFO ] [Real]Absence check using 2 positive and 48 generalized place invariants in 21 ms returned sat
[2023-03-10 03:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:07] [INFO ] [Real]Absence check using state equation in 148 ms returned sat
[2023-03-10 03:31:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:31:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-10 03:31:07] [INFO ] [Nat]Absence check using 2 positive and 48 generalized place invariants in 22 ms returned sat
[2023-03-10 03:31:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:07] [INFO ] [Nat]Absence check using state equation in 156 ms returned sat
[2023-03-10 03:31:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 106 ms returned sat
[2023-03-10 03:31:07] [INFO ] Computed and/alt/rep : 198/1054/198 causal constraints (skipped 37 transitions) in 24 ms.
[2023-03-10 03:31:08] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2023-03-10 03:31:08] [INFO ] Deduced a trap composed of 13 places in 113 ms of which 1 ms to minimize.
[2023-03-10 03:31:09] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 1 ms to minimize.
[2023-03-10 03:31:09] [INFO ] Deduced a trap composed of 13 places in 108 ms of which 0 ms to minimize.
[2023-03-10 03:31:09] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-10 03:31:09] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 1 ms to minimize.
[2023-03-10 03:31:09] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 0 ms to minimize.
[2023-03-10 03:31:09] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1017 ms
[2023-03-10 03:31:09] [INFO ] Added : 124 causal constraints over 25 iterations in 2184 ms. Result :sat
Minimization took 371 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 1, -1, -1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 236/236 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 236/236 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 250/250 places, 236/236 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 236/236 transitions.
Applied a total of 0 rules in 14 ms. Remains 250 /250 variables (removed 0) and now considering 236/236 (removed 0) transitions.
[2023-03-10 03:31:41] [INFO ] Invariant cache hit.
[2023-03-10 03:31:41] [INFO ] Implicit Places using invariants in 571 ms returned [21, 27, 48, 53, 76, 81, 102, 110, 132, 137, 138, 158, 163, 187, 193, 200, 210, 216, 241, 247]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 575 ms to find 20 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 230/250 places, 236/236 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 229 transition count 235
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 229 transition count 235
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 11 place count 229 transition count 226
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 20 place count 220 transition count 226
Applied a total of 20 rules in 31 ms. Remains 220 /230 variables (removed 10) and now considering 226/236 (removed 10) transitions.
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:31:41] [INFO ] Computed 31 place invariants in 15 ms
[2023-03-10 03:31:42] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-10 03:31:42] [INFO ] Invariant cache hit.
[2023-03-10 03:31:42] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:31:44] [INFO ] Implicit Places using invariants and state equation in 2263 ms returned []
Implicit Place search using SMT with State Equation took 2540 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 220/250 places, 226/236 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 3162 ms. Remains : 220/250 places, 226/236 transitions.
[2023-03-10 03:31:44] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 144422 resets, run finished after 1326 ms. (steps per millisecond=754 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91532 resets, run finished after 1049 ms. (steps per millisecond=953 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91678 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91480 resets, run finished after 740 ms. (steps per millisecond=1351 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91462 resets, run finished after 741 ms. (steps per millisecond=1349 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91550 resets, run finished after 745 ms. (steps per millisecond=1342 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91712 resets, run finished after 739 ms. (steps per millisecond=1353 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91693 resets, run finished after 743 ms. (steps per millisecond=1345 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91427 resets, run finished after 753 ms. (steps per millisecond=1328 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91246 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91384 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91193 resets, run finished after 760 ms. (steps per millisecond=1315 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91053 resets, run finished after 752 ms. (steps per millisecond=1329 ) properties (out of 12) seen :0
[2023-03-10 03:31:54] [INFO ] Invariant cache hit.
[2023-03-10 03:31:54] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:31:54] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:31:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:55] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2023-03-10 03:31:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:31:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:31:55] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:31:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:55] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-10 03:31:55] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:31:55] [INFO ] [Nat]Added 33 Read/Feed constraints in 97 ms returned sat
[2023-03-10 03:31:55] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 24 ms.
[2023-03-10 03:31:56] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 1 ms to minimize.
[2023-03-10 03:31:56] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-10 03:31:56] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 1 ms to minimize.
[2023-03-10 03:31:56] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 1 ms to minimize.
[2023-03-10 03:31:57] [INFO ] Deduced a trap composed of 13 places in 134 ms of which 1 ms to minimize.
[2023-03-10 03:31:57] [INFO ] Deduced a trap composed of 18 places in 168 ms of which 1 ms to minimize.
[2023-03-10 03:31:57] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 1 ms to minimize.
[2023-03-10 03:31:57] [INFO ] Deduced a trap composed of 12 places in 119 ms of which 1 ms to minimize.
[2023-03-10 03:31:57] [INFO ] Deduced a trap composed of 76 places in 165 ms of which 1 ms to minimize.
[2023-03-10 03:31:58] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 1 ms to minimize.
[2023-03-10 03:31:58] [INFO ] Deduced a trap composed of 80 places in 165 ms of which 1 ms to minimize.
[2023-03-10 03:31:58] [INFO ] Deduced a trap composed of 74 places in 159 ms of which 0 ms to minimize.
[2023-03-10 03:31:58] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2123 ms
[2023-03-10 03:31:58] [INFO ] Added : 107 causal constraints over 22 iterations in 3075 ms. Result :sat
Minimization took 220 ms.
[2023-03-10 03:31:58] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:31:58] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:31:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:59] [INFO ] [Real]Absence check using state equation in 285 ms returned sat
[2023-03-10 03:31:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:31:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:31:59] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:31:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:31:59] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2023-03-10 03:31:59] [INFO ] [Nat]Added 33 Read/Feed constraints in 42 ms returned sat
[2023-03-10 03:31:59] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-10 03:32:02] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 1 ms to minimize.
[2023-03-10 03:32:02] [INFO ] Deduced a trap composed of 4 places in 98 ms of which 1 ms to minimize.
[2023-03-10 03:32:03] [INFO ] Deduced a trap composed of 12 places in 77 ms of which 1 ms to minimize.
[2023-03-10 03:32:03] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2023-03-10 03:32:03] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2023-03-10 03:32:03] [INFO ] Deduced a trap composed of 27 places in 70 ms of which 1 ms to minimize.
[2023-03-10 03:32:03] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 0 ms to minimize.
[2023-03-10 03:32:03] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2023-03-10 03:32:03] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1209 ms
[2023-03-10 03:32:03] [INFO ] Added : 191 causal constraints over 39 iterations in 4530 ms. Result :sat
Minimization took 856 ms.
[2023-03-10 03:32:04] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:32:04] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:32:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:04] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-10 03:32:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:05] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:32:05] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:32:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:05] [INFO ] [Nat]Absence check using state equation in 177 ms returned sat
[2023-03-10 03:32:05] [INFO ] [Nat]Added 33 Read/Feed constraints in 158 ms returned sat
[2023-03-10 03:32:05] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 1 ms to minimize.
[2023-03-10 03:32:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 125 ms
[2023-03-10 03:32:05] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 20 ms.
[2023-03-10 03:32:06] [INFO ] Added : 59 causal constraints over 13 iterations in 553 ms. Result :sat
Minimization took 280 ms.
[2023-03-10 03:32:06] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:32:06] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:32:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:06] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2023-03-10 03:32:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:06] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:32:06] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:32:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:06] [INFO ] [Nat]Absence check using state equation in 212 ms returned sat
[2023-03-10 03:32:07] [INFO ] [Nat]Added 33 Read/Feed constraints in 1086 ms returned sat
[2023-03-10 03:32:08] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 0 ms to minimize.
[2023-03-10 03:32:08] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 0 ms to minimize.
[2023-03-10 03:32:08] [INFO ] Deduced a trap composed of 12 places in 113 ms of which 1 ms to minimize.
[2023-03-10 03:32:08] [INFO ] Deduced a trap composed of 71 places in 145 ms of which 2 ms to minimize.
[2023-03-10 03:32:08] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 0 ms to minimize.
[2023-03-10 03:32:08] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 1 ms to minimize.
[2023-03-10 03:32:09] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 1 ms to minimize.
[2023-03-10 03:32:09] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 0 ms to minimize.
[2023-03-10 03:32:09] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 1 ms to minimize.
[2023-03-10 03:32:09] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 0 ms to minimize.
[2023-03-10 03:32:09] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1868 ms
[2023-03-10 03:32:09] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 23 ms.
[2023-03-10 03:32:14] [INFO ] Deduced a trap composed of 11 places in 200 ms of which 1 ms to minimize.
[2023-03-10 03:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2023-03-10 03:32:14] [INFO ] Added : 177 causal constraints over 36 iterations in 4831 ms. Result :sat
Minimization took 3005 ms.
[2023-03-10 03:32:17] [INFO ] [Real]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-10 03:32:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:32:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:17] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-10 03:32:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:32:17] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 03:32:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:18] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2023-03-10 03:32:18] [INFO ] [Nat]Added 33 Read/Feed constraints in 719 ms returned sat
[2023-03-10 03:32:19] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 19 ms to minimize.
[2023-03-10 03:32:19] [INFO ] Deduced a trap composed of 56 places in 141 ms of which 0 ms to minimize.
[2023-03-10 03:32:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-03-10 03:32:19] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 20 ms.
[2023-03-10 03:32:20] [INFO ] Added : 94 causal constraints over 20 iterations in 919 ms. Result :sat
Minimization took 292 ms.
[2023-03-10 03:32:20] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-10 03:32:20] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:32:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:20] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2023-03-10 03:32:20] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:20] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-10 03:32:20] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:32:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:20] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2023-03-10 03:32:21] [INFO ] [Nat]Added 33 Read/Feed constraints in 108 ms returned sat
[2023-03-10 03:32:21] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-10 03:32:24] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 0 ms to minimize.
[2023-03-10 03:32:24] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-10 03:32:24] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 0 ms to minimize.
[2023-03-10 03:32:24] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 416 ms
[2023-03-10 03:32:24] [INFO ] Added : 183 causal constraints over 37 iterations in 3751 ms. Result :sat
Minimization took 1097 ms.
[2023-03-10 03:32:26] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-10 03:32:26] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:32:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:26] [INFO ] [Real]Absence check using state equation in 152 ms returned sat
[2023-03-10 03:32:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:26] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:32:26] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:32:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:26] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2023-03-10 03:32:26] [INFO ] [Nat]Added 33 Read/Feed constraints in 41 ms returned sat
[2023-03-10 03:32:26] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 26 ms.
[2023-03-10 03:32:29] [INFO ] Added : 132 causal constraints over 28 iterations in 2950 ms. Result :sat
Minimization took 886 ms.
[2023-03-10 03:32:30] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-10 03:32:30] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:30] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2023-03-10 03:32:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:30] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-10 03:32:30] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:32:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:30] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2023-03-10 03:32:31] [INFO ] [Nat]Added 33 Read/Feed constraints in 234 ms returned sat
[2023-03-10 03:32:31] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 27 ms.
[2023-03-10 03:32:34] [INFO ] Deduced a trap composed of 7 places in 104 ms of which 1 ms to minimize.
[2023-03-10 03:32:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 148 ms
[2023-03-10 03:32:34] [INFO ] Added : 155 causal constraints over 32 iterations in 3471 ms. Result :sat
Minimization took 671 ms.
[2023-03-10 03:32:35] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:32:35] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:32:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:35] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2023-03-10 03:32:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:35] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-10 03:32:35] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:32:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:35] [INFO ] [Nat]Absence check using state equation in 159 ms returned sat
[2023-03-10 03:32:36] [INFO ] [Nat]Added 33 Read/Feed constraints in 488 ms returned sat
[2023-03-10 03:32:36] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-10 03:32:37] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 1 ms to minimize.
[2023-03-10 03:32:37] [INFO ] Deduced a trap composed of 12 places in 129 ms of which 1 ms to minimize.
[2023-03-10 03:32:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 317 ms
[2023-03-10 03:32:37] [INFO ] Added : 79 causal constraints over 17 iterations in 1179 ms. Result :sat
Minimization took 257 ms.
[2023-03-10 03:32:38] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:32:38] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:32:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:38] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2023-03-10 03:32:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-10 03:32:38] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 03:32:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:38] [INFO ] [Nat]Absence check using state equation in 154 ms returned sat
[2023-03-10 03:32:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 142 ms returned sat
[2023-03-10 03:32:38] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 26 ms.
[2023-03-10 03:32:40] [INFO ] Deduced a trap composed of 60 places in 210 ms of which 1 ms to minimize.
[2023-03-10 03:32:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2023-03-10 03:32:40] [INFO ] Added : 89 causal constraints over 19 iterations in 1434 ms. Result :sat
Minimization took 750 ms.
[2023-03-10 03:32:40] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-10 03:32:40] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:32:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:41] [INFO ] [Real]Absence check using state equation in 195 ms returned sat
[2023-03-10 03:32:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:41] [INFO ] [Nat]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-10 03:32:41] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:32:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:41] [INFO ] [Nat]Absence check using state equation in 194 ms returned sat
[2023-03-10 03:32:41] [INFO ] [Nat]Added 33 Read/Feed constraints in 189 ms returned sat
[2023-03-10 03:32:41] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 20 ms.
[2023-03-10 03:32:44] [INFO ] Deduced a trap composed of 51 places in 152 ms of which 1 ms to minimize.
[2023-03-10 03:32:44] [INFO ] Deduced a trap composed of 62 places in 164 ms of which 5 ms to minimize.
[2023-03-10 03:32:44] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 0 ms to minimize.
[2023-03-10 03:32:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 623 ms
[2023-03-10 03:32:44] [INFO ] Added : 132 causal constraints over 27 iterations in 3095 ms. Result :sat
Minimization took 815 ms.
[2023-03-10 03:32:45] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-10 03:32:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:32:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:45] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2023-03-10 03:32:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:32:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:32:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:32:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:32:46] [INFO ] [Nat]Absence check using state equation in 205 ms returned sat
[2023-03-10 03:32:46] [INFO ] [Nat]Added 33 Read/Feed constraints in 347 ms returned sat
[2023-03-10 03:32:46] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2023-03-10 03:32:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2023-03-10 03:32:46] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 15 ms.
[2023-03-10 03:32:48] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 0 ms to minimize.
[2023-03-10 03:32:48] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 1 ms to minimize.
[2023-03-10 03:32:48] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 0 ms to minimize.
[2023-03-10 03:32:49] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 0 ms to minimize.
[2023-03-10 03:32:49] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 716 ms
[2023-03-10 03:32:49] [INFO ] Added : 139 causal constraints over 29 iterations in 2967 ms. Result :sat
Minimization took 794 ms.
Current structural bounds on expressions (after SMT) : [1, 1, 1, -1, -1, 1, 1, 1, 1, 1, 1, 1] Max seen :[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
Support contains 12 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Applied a total of 0 rules in 19 ms. Remains 220 /220 variables (removed 0) and now considering 226/226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 220/220 places, 226/226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Applied a total of 0 rules in 17 ms. Remains 220 /220 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-10 03:33:20] [INFO ] Invariant cache hit.
[2023-03-10 03:33:21] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-10 03:33:21] [INFO ] Invariant cache hit.
[2023-03-10 03:33:21] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:33:23] [INFO ] Implicit Places using invariants and state equation in 2515 ms returned []
Implicit Place search using SMT with State Equation took 3038 ms to find 0 implicit places.
[2023-03-10 03:33:23] [INFO ] Redundant transitions in 18 ms returned []
[2023-03-10 03:33:23] [INFO ] Invariant cache hit.
[2023-03-10 03:33:24] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3428 ms. Remains : 220/220 places, 226/226 transitions.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-00
[2023-03-10 03:33:24] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 1437 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 937 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-10 03:33:24] [INFO ] Invariant cache hit.
[2023-03-10 03:33:24] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:33:24] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:33:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:33:24] [INFO ] [Real]Absence check using state equation in 194 ms returned sat
[2023-03-10 03:33:24] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:33:24] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:33:24] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:33:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:33:24] [INFO ] [Nat]Absence check using state equation in 188 ms returned sat
[2023-03-10 03:33:24] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:33:24] [INFO ] [Nat]Added 33 Read/Feed constraints in 166 ms returned sat
[2023-03-10 03:33:25] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 27 ms.
[2023-03-10 03:33:26] [INFO ] Deduced a trap composed of 11 places in 193 ms of which 4 ms to minimize.
[2023-03-10 03:33:26] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 1 ms to minimize.
[2023-03-10 03:33:27] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 1 ms to minimize.
[2023-03-10 03:33:27] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 1 ms to minimize.
[2023-03-10 03:33:27] [INFO ] Deduced a trap composed of 13 places in 220 ms of which 1 ms to minimize.
[2023-03-10 03:33:27] [INFO ] Deduced a trap composed of 18 places in 135 ms of which 1 ms to minimize.
[2023-03-10 03:33:27] [INFO ] Deduced a trap composed of 68 places in 193 ms of which 2 ms to minimize.
[2023-03-10 03:33:28] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 3 ms to minimize.
[2023-03-10 03:33:28] [INFO ] Deduced a trap composed of 76 places in 133 ms of which 1 ms to minimize.
[2023-03-10 03:33:28] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 1 ms to minimize.
[2023-03-10 03:33:28] [INFO ] Deduced a trap composed of 80 places in 197 ms of which 1 ms to minimize.
[2023-03-10 03:33:28] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 1 ms to minimize.
[2023-03-10 03:33:28] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2586 ms
[2023-03-10 03:33:28] [INFO ] Added : 107 causal constraints over 22 iterations in 4012 ms. Result :sat
Minimization took 219 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 210 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 207 transition count 216
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 27 place count 207 transition count 215
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 28 place count 206 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 206 transition count 215
Applied a total of 31 rules in 64 ms. Remains 206 /220 variables (removed 14) and now considering 215/226 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 206/220 places, 215/226 transitions.
// Phase 1: matrix 215 rows 206 cols
[2023-03-10 03:33:29] [INFO ] Computed 31 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 144050 resets, run finished after 995 ms. (steps per millisecond=1005 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91343 resets, run finished after 605 ms. (steps per millisecond=1652 ) properties (out of 1) seen :0
[2023-03-10 03:33:31] [INFO ] Invariant cache hit.
[2023-03-10 03:33:31] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 03:33:31] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-10 03:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:33:31] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2023-03-10 03:33:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:33:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2023-03-10 03:33:31] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 14 ms returned sat
[2023-03-10 03:33:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:33:31] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2023-03-10 03:33:31] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:33:31] [INFO ] [Nat]Added 42 Read/Feed constraints in 79 ms returned sat
[2023-03-10 03:33:31] [INFO ] Computed and/alt/rep : 168/1091/168 causal constraints (skipped 46 transitions) in 23 ms.
[2023-03-10 03:33:32] [INFO ] Added : 98 causal constraints over 20 iterations in 1107 ms. Result :sat
Minimization took 564 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 206/206 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-10 03:33:33] [INFO ] Invariant cache hit.
[2023-03-10 03:33:34] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-10 03:33:34] [INFO ] Invariant cache hit.
[2023-03-10 03:33:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:33:37] [INFO ] Implicit Places using invariants and state equation in 2832 ms returned []
Implicit Place search using SMT with State Equation took 3184 ms to find 0 implicit places.
[2023-03-10 03:33:37] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-10 03:33:37] [INFO ] Invariant cache hit.
[2023-03-10 03:33:37] [INFO ] Dead Transitions using invariants and state equation in 297 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3548 ms. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-00 in 13268 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-01
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:33:37] [INFO ] Computed 31 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 1462 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 897 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-10 03:33:37] [INFO ] Invariant cache hit.
[2023-03-10 03:33:37] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-10 03:33:37] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 11 ms returned sat
[2023-03-10 03:33:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:33:37] [INFO ] [Real]Absence check using state equation in 288 ms returned sat
[2023-03-10 03:33:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:33:37] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:33:37] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:33:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:33:38] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2023-03-10 03:33:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:33:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 41 ms returned sat
[2023-03-10 03:33:38] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 16 ms.
[2023-03-10 03:33:42] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 0 ms to minimize.
[2023-03-10 03:33:42] [INFO ] Deduced a trap composed of 4 places in 110 ms of which 0 ms to minimize.
[2023-03-10 03:33:42] [INFO ] Deduced a trap composed of 12 places in 73 ms of which 0 ms to minimize.
[2023-03-10 03:33:43] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 0 ms to minimize.
[2023-03-10 03:33:43] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression at index 0
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2620)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:186)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:733)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 220 transition count 222
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 216 transition count 222
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 212 transition count 218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 22 place count 209 transition count 218
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 209 transition count 214
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 37 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-10 03:33:43] [INFO ] Computed 31 place invariants in 25 ms
Incomplete random walk after 1000000 steps, including 144386 resets, run finished after 1071 ms. (steps per millisecond=933 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 91598 resets, run finished after 830 ms. (steps per millisecond=1204 ) properties (out of 1) seen :0
[2023-03-10 03:33:44] [INFO ] Invariant cache hit.
[2023-03-10 03:33:45] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:33:45] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 10 ms returned sat
[2023-03-10 03:33:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:33:45] [INFO ] [Real]Absence check using state equation in 264 ms returned sat
[2023-03-10 03:33:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:33:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:33:45] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 18 ms returned sat
[2023-03-10 03:33:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:33:45] [INFO ] [Nat]Absence check using state equation in 230 ms returned sat
[2023-03-10 03:33:45] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:33:45] [INFO ] [Nat]Added 42 Read/Feed constraints in 81 ms returned sat
[2023-03-10 03:33:45] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 1 ms to minimize.
[2023-03-10 03:33:46] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 1 ms to minimize.
[2023-03-10 03:33:46] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 1 ms to minimize.
[2023-03-10 03:33:46] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 0 ms to minimize.
[2023-03-10 03:33:46] [INFO ] Deduced a trap composed of 61 places in 195 ms of which 1 ms to minimize.
[2023-03-10 03:33:47] [INFO ] Deduced a trap composed of 62 places in 196 ms of which 1 ms to minimize.
[2023-03-10 03:33:47] [INFO ] Deduced a trap composed of 63 places in 181 ms of which 1 ms to minimize.
[2023-03-10 03:33:47] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 0 ms to minimize.
[2023-03-10 03:33:47] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2023-03-10 03:33:47] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 1 ms to minimize.
[2023-03-10 03:33:48] [INFO ] Deduced a trap composed of 54 places in 180 ms of which 1 ms to minimize.
[2023-03-10 03:33:48] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 1 ms to minimize.
[2023-03-10 03:33:48] [INFO ] Deduced a trap composed of 63 places in 186 ms of which 1 ms to minimize.
[2023-03-10 03:33:48] [INFO ] Deduced a trap composed of 12 places in 189 ms of which 1 ms to minimize.
[2023-03-10 03:33:48] [INFO ] Deduced a trap composed of 54 places in 190 ms of which 1 ms to minimize.
[2023-03-10 03:33:49] [INFO ] Deduced a trap composed of 72 places in 178 ms of which 1 ms to minimize.
[2023-03-10 03:33:49] [INFO ] Deduced a trap composed of 62 places in 180 ms of which 1 ms to minimize.
[2023-03-10 03:33:49] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 0 ms to minimize.
[2023-03-10 03:33:49] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 1 ms to minimize.
[2023-03-10 03:33:49] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 0 ms to minimize.
[2023-03-10 03:33:49] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 22 places in 93 ms of which 0 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 1 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 0 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 1 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 25 places in 67 ms of which 0 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-10 03:33:50] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 0 ms to minimize.
[2023-03-10 03:33:51] [INFO ] Trap strengthening (SAT) tested/added 31/30 trap constraints in 5253 ms
[2023-03-10 03:33:51] [INFO ] Computed and/alt/rep : 167/1086/167 causal constraints (skipped 46 transitions) in 19 ms.
[2023-03-10 03:33:53] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-10 03:33:54] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 0 ms to minimize.
[2023-03-10 03:33:54] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2023-03-10 03:33:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 460 ms
[2023-03-10 03:33:54] [INFO ] Added : 101 causal constraints over 21 iterations in 3277 ms. Result :sat
Minimization took 713 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:34:00] [INFO ] Invariant cache hit.
[2023-03-10 03:34:01] [INFO ] Implicit Places using invariants in 222 ms returned []
[2023-03-10 03:34:01] [INFO ] Invariant cache hit.
[2023-03-10 03:34:01] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:34:03] [INFO ] Implicit Places using invariants and state equation in 2397 ms returned []
Implicit Place search using SMT with State Equation took 2643 ms to find 0 implicit places.
[2023-03-10 03:34:03] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-10 03:34:03] [INFO ] Invariant cache hit.
[2023-03-10 03:34:03] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2870 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-01 in 26389 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-04
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:34:03] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1446 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 914 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
[2023-03-10 03:34:03] [INFO ] Invariant cache hit.
[2023-03-10 03:34:03] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:34:03] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:34:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:04] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2023-03-10 03:34:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:34:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:34:04] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:34:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:04] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2023-03-10 03:34:04] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:34:04] [INFO ] [Nat]Added 33 Read/Feed constraints in 89 ms returned sat
[2023-03-10 03:34:04] [INFO ] Deduced a trap composed of 7 places in 130 ms of which 0 ms to minimize.
[2023-03-10 03:34:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 159 ms
[2023-03-10 03:34:04] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 23 ms.
[2023-03-10 03:34:05] [INFO ] Added : 59 causal constraints over 13 iterations in 513 ms. Result :sat
Minimization took 164 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 208 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 208 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 49 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-10 03:34:05] [INFO ] Computed 31 place invariants in 12 ms
Incomplete random walk after 1000000 steps, including 144124 resets, run finished after 905 ms. (steps per millisecond=1104 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91753 resets, run finished after 645 ms. (steps per millisecond=1550 ) properties (out of 1) seen :0
[2023-03-10 03:34:06] [INFO ] Invariant cache hit.
[2023-03-10 03:34:07] [INFO ] [Real]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-10 03:34:07] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:34:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:07] [INFO ] [Real]Absence check using state equation in 134 ms returned sat
[2023-03-10 03:34:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:34:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:34:07] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:34:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:07] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-10 03:34:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:34:07] [INFO ] [Nat]Added 41 Read/Feed constraints in 102 ms returned sat
[2023-03-10 03:34:07] [INFO ] Computed and/alt/rep : 167/1080/167 causal constraints (skipped 46 transitions) in 25 ms.
[2023-03-10 03:34:08] [INFO ] Deduced a trap composed of 8 places in 141 ms of which 0 ms to minimize.
[2023-03-10 03:34:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 189 ms
[2023-03-10 03:34:08] [INFO ] Added : 46 causal constraints over 11 iterations in 666 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 8 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:34:08] [INFO ] Invariant cache hit.
[2023-03-10 03:34:08] [INFO ] Implicit Places using invariants in 371 ms returned []
[2023-03-10 03:34:08] [INFO ] Invariant cache hit.
[2023-03-10 03:34:08] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:34:10] [INFO ] Implicit Places using invariants and state equation in 2128 ms returned []
Implicit Place search using SMT with State Equation took 2503 ms to find 0 implicit places.
[2023-03-10 03:34:10] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 03:34:10] [INFO ] Invariant cache hit.
[2023-03-10 03:34:11] [INFO ] Dead Transitions using invariants and state equation in 332 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2856 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-04 in 7412 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-06
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:34:11] [INFO ] Computed 31 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 1438 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 898 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-10 03:34:11] [INFO ] Invariant cache hit.
[2023-03-10 03:34:11] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:34:11] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 03:34:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:11] [INFO ] [Real]Absence check using state equation in 196 ms returned sat
[2023-03-10 03:34:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:34:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:34:11] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:34:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:11] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-10 03:34:11] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:34:12] [INFO ] [Nat]Added 33 Read/Feed constraints in 1090 ms returned sat
[2023-03-10 03:34:13] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 1 ms to minimize.
[2023-03-10 03:34:13] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 1 ms to minimize.
[2023-03-10 03:34:13] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 0 ms to minimize.
[2023-03-10 03:34:13] [INFO ] Deduced a trap composed of 71 places in 194 ms of which 1 ms to minimize.
[2023-03-10 03:34:14] [INFO ] Deduced a trap composed of 66 places in 146 ms of which 1 ms to minimize.
[2023-03-10 03:34:14] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 1 ms to minimize.
[2023-03-10 03:34:14] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 0 ms to minimize.
[2023-03-10 03:34:14] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 1 ms to minimize.
[2023-03-10 03:34:14] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 1 ms to minimize.
[2023-03-10 03:34:15] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 1 ms to minimize.
[2023-03-10 03:34:15] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2559 ms
[2023-03-10 03:34:15] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 21 ms.
[2023-03-10 03:34:16] [INFO ] Added : 40 causal constraints over 8 iterations in 1149 ms. Result :unknown
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 5 Pre rules applied. Total rules applied 0 place count 220 transition count 221
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 209 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 25 place count 209 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 28 place count 206 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 1 with 3 rules applied. Total rules applied 31 place count 206 transition count 214
Applied a total of 31 rules in 43 ms. Remains 206 /220 variables (removed 14) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-10 03:34:16] [INFO ] Computed 31 place invariants in 15 ms
Incomplete random walk after 1000000 steps, including 144390 resets, run finished after 1114 ms. (steps per millisecond=897 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91554 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 1) seen :0
[2023-03-10 03:34:18] [INFO ] Invariant cache hit.
[2023-03-10 03:34:18] [INFO ] [Real]Absence check using 12 positive place invariants in 13 ms returned sat
[2023-03-10 03:34:18] [INFO ] [Real]Absence check using 12 positive and 19 generalized place invariants in 8 ms returned sat
[2023-03-10 03:34:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:18] [INFO ] [Real]Absence check using state equation in 187 ms returned sat
[2023-03-10 03:34:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:34:18] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2023-03-10 03:34:18] [INFO ] [Nat]Absence check using 12 positive and 19 generalized place invariants in 6 ms returned sat
[2023-03-10 03:34:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:18] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2023-03-10 03:34:18] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-10 03:34:19] [INFO ] [Nat]Added 39 Read/Feed constraints in 702 ms returned sat
[2023-03-10 03:34:19] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 1 ms to minimize.
[2023-03-10 03:34:19] [INFO ] Deduced a trap composed of 66 places in 136 ms of which 1 ms to minimize.
[2023-03-10 03:34:20] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 1 ms to minimize.
[2023-03-10 03:34:20] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 1 ms to minimize.
[2023-03-10 03:34:20] [INFO ] Deduced a trap composed of 40 places in 134 ms of which 1 ms to minimize.
[2023-03-10 03:34:20] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 1 ms to minimize.
[2023-03-10 03:34:20] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 0 ms to minimize.
[2023-03-10 03:34:21] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 1 ms to minimize.
[2023-03-10 03:34:21] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 1 ms to minimize.
[2023-03-10 03:34:21] [INFO ] Deduced a trap composed of 21 places in 160 ms of which 1 ms to minimize.
[2023-03-10 03:34:21] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 0 ms to minimize.
[2023-03-10 03:34:21] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 1 ms to minimize.
[2023-03-10 03:34:21] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2206 ms
[2023-03-10 03:34:21] [INFO ] Computed and/alt/rep : 170/1089/170 causal constraints (skipped 43 transitions) in 19 ms.
[2023-03-10 03:34:24] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2023-03-10 03:34:24] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 1 ms to minimize.
[2023-03-10 03:34:24] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 0 ms to minimize.
[2023-03-10 03:34:24] [INFO ] Deduced a trap composed of 13 places in 98 ms of which 0 ms to minimize.
[2023-03-10 03:34:25] [INFO ] Deduced a trap composed of 70 places in 97 ms of which 1 ms to minimize.
[2023-03-10 03:34:25] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 807 ms
[2023-03-10 03:34:25] [INFO ] Added : 114 causal constraints over 24 iterations in 3419 ms. Result :sat
Minimization took 705 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 5 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:34:34] [INFO ] Invariant cache hit.
[2023-03-10 03:34:35] [INFO ] Implicit Places using invariants in 388 ms returned []
[2023-03-10 03:34:35] [INFO ] Invariant cache hit.
[2023-03-10 03:34:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-10 03:34:37] [INFO ] Implicit Places using invariants and state equation in 2420 ms returned []
Implicit Place search using SMT with State Equation took 2810 ms to find 0 implicit places.
[2023-03-10 03:34:37] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-10 03:34:37] [INFO ] Invariant cache hit.
[2023-03-10 03:34:37] [INFO ] Dead Transitions using invariants and state equation in 252 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3078 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-06 in 26672 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-07
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:34:37] [INFO ] Computed 31 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 1398 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 913 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 03:34:37] [INFO ] Invariant cache hit.
[2023-03-10 03:34:38] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-10 03:34:38] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:34:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:38] [INFO ] [Real]Absence check using state equation in 174 ms returned sat
[2023-03-10 03:34:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:34:38] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:34:38] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:34:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:38] [INFO ] [Nat]Absence check using state equation in 141 ms returned sat
[2023-03-10 03:34:38] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:34:38] [INFO ] [Nat]Added 33 Read/Feed constraints in 463 ms returned sat
[2023-03-10 03:34:38] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 1 ms to minimize.
[2023-03-10 03:34:39] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 1 ms to minimize.
[2023-03-10 03:34:39] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 288 ms
[2023-03-10 03:34:39] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 21 ms.
[2023-03-10 03:34:40] [INFO ] Added : 94 causal constraints over 20 iterations in 931 ms. Result :sat
Minimization took 406 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 210 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 208 transition count 216
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 208 transition count 214
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 28 place count 206 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 206 transition count 214
Applied a total of 29 rules in 33 ms. Remains 206 /220 variables (removed 14) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-10 03:34:41] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 144115 resets, run finished after 909 ms. (steps per millisecond=1100 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91469 resets, run finished after 620 ms. (steps per millisecond=1612 ) properties (out of 1) seen :0
[2023-03-10 03:34:42] [INFO ] Invariant cache hit.
[2023-03-10 03:34:42] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-10 03:34:42] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:34:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:43] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-10 03:34:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:34:43] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-03-10 03:34:43] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:34:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:43] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2023-03-10 03:34:43] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 03:34:43] [INFO ] [Nat]Added 38 Read/Feed constraints in 316 ms returned sat
[2023-03-10 03:34:43] [INFO ] Computed and/alt/rep : 175/1104/175 causal constraints (skipped 38 transitions) in 18 ms.
[2023-03-10 03:34:45] [INFO ] Deduced a trap composed of 8 places in 139 ms of which 1 ms to minimize.
[2023-03-10 03:34:45] [INFO ] Deduced a trap composed of 4 places in 162 ms of which 1 ms to minimize.
[2023-03-10 03:34:45] [INFO ] Deduced a trap composed of 3 places in 152 ms of which 0 ms to minimize.
[2023-03-10 03:34:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 649 ms
[2023-03-10 03:34:45] [INFO ] Added : 78 causal constraints over 18 iterations in 1975 ms. Result :sat
Minimization took 368 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 11 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 7 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:34:46] [INFO ] Invariant cache hit.
[2023-03-10 03:34:46] [INFO ] Implicit Places using invariants in 367 ms returned []
[2023-03-10 03:34:46] [INFO ] Invariant cache hit.
[2023-03-10 03:34:46] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-10 03:34:48] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 2618 ms to find 0 implicit places.
[2023-03-10 03:34:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:34:48] [INFO ] Invariant cache hit.
[2023-03-10 03:34:49] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2903 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-07 in 11158 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-08
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:34:49] [INFO ] Computed 31 place invariants in 20 ms
Incomplete random walk after 10000 steps, including 1429 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 911 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-10 03:34:49] [INFO ] Invariant cache hit.
[2023-03-10 03:34:49] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-10 03:34:49] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:34:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:49] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2023-03-10 03:34:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:34:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:34:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:34:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:49] [INFO ] [Nat]Absence check using state equation in 294 ms returned sat
[2023-03-10 03:34:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:34:50] [INFO ] [Nat]Added 33 Read/Feed constraints in 181 ms returned sat
[2023-03-10 03:34:50] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 30 ms.
[2023-03-10 03:34:53] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 1 ms to minimize.
[2023-03-10 03:34:53] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2023-03-10 03:34:53] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 0 ms to minimize.
[2023-03-10 03:34:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 361 ms
[2023-03-10 03:34:53] [INFO ] Added : 183 causal constraints over 37 iterations in 3356 ms. Result :sat
Minimization took 1068 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 219 transition count 221
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 212 transition count 218
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 209 transition count 218
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 209 transition count 215
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 206 transition count 215
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 206 transition count 215
Applied a total of 31 rules in 32 ms. Remains 206 /220 variables (removed 14) and now considering 215/226 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 206/220 places, 215/226 transitions.
// Phase 1: matrix 215 rows 206 cols
[2023-03-10 03:34:54] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144112 resets, run finished after 1239 ms. (steps per millisecond=807 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91424 resets, run finished after 631 ms. (steps per millisecond=1584 ) properties (out of 1) seen :0
[2023-03-10 03:34:56] [INFO ] Invariant cache hit.
[2023-03-10 03:34:56] [INFO ] [Real]Absence check using 13 positive place invariants in 14 ms returned sat
[2023-03-10 03:34:56] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:34:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:56] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2023-03-10 03:34:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:34:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 11 ms returned sat
[2023-03-10 03:34:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:34:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:34:57] [INFO ] [Nat]Absence check using state equation in 251 ms returned sat
[2023-03-10 03:34:57] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:34:57] [INFO ] [Nat]Added 42 Read/Feed constraints in 394 ms returned sat
[2023-03-10 03:34:57] [INFO ] Computed and/alt/rep : 168/1077/168 causal constraints (skipped 46 transitions) in 23 ms.
[2023-03-10 03:34:59] [INFO ] Deduced a trap composed of 69 places in 158 ms of which 1 ms to minimize.
[2023-03-10 03:34:59] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 0 ms to minimize.
[2023-03-10 03:34:59] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 0 ms to minimize.
[2023-03-10 03:35:00] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2023-03-10 03:35:00] [INFO ] Deduced a trap composed of 57 places in 97 ms of which 1 ms to minimize.
[2023-03-10 03:35:00] [INFO ] Deduced a trap composed of 65 places in 97 ms of which 0 ms to minimize.
[2023-03-10 03:35:00] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2023-03-10 03:35:00] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 0 ms to minimize.
[2023-03-10 03:35:00] [INFO ] Deduced a trap composed of 28 places in 93 ms of which 1 ms to minimize.
[2023-03-10 03:35:00] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 0 ms to minimize.
[2023-03-10 03:35:01] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 0 ms to minimize.
[2023-03-10 03:35:01] [INFO ] Deduced a trap composed of 75 places in 105 ms of which 0 ms to minimize.
[2023-03-10 03:35:01] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 1 ms to minimize.
[2023-03-10 03:35:01] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1862 ms
[2023-03-10 03:35:01] [INFO ] Added : 150 causal constraints over 30 iterations in 3862 ms. Result :sat
Minimization took 1301 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 16 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 206/206 places, 215/215 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 215/215 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2023-03-10 03:35:05] [INFO ] Invariant cache hit.
[2023-03-10 03:35:06] [INFO ] Implicit Places using invariants in 329 ms returned []
[2023-03-10 03:35:06] [INFO ] Invariant cache hit.
[2023-03-10 03:35:06] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:35:08] [INFO ] Implicit Places using invariants and state equation in 1980 ms returned []
Implicit Place search using SMT with State Equation took 2311 ms to find 0 implicit places.
[2023-03-10 03:35:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:35:08] [INFO ] Invariant cache hit.
[2023-03-10 03:35:08] [INFO ] Dead Transitions using invariants and state equation in 292 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2616 ms. Remains : 206/206 places, 215/215 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-08 in 19463 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-09
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:35:08] [INFO ] Computed 31 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-10 03:35:08] [INFO ] Invariant cache hit.
[2023-03-10 03:35:08] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-10 03:35:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:08] [INFO ] [Real]Absence check using state equation in 242 ms returned sat
[2023-03-10 03:35:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:35:09] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:35:09] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:35:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:09] [INFO ] [Nat]Absence check using state equation in 254 ms returned sat
[2023-03-10 03:35:09] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:35:09] [INFO ] [Nat]Added 33 Read/Feed constraints in 40 ms returned sat
[2023-03-10 03:35:09] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 30 ms.
[2023-03-10 03:35:12] [INFO ] Added : 132 causal constraints over 28 iterations in 2871 ms. Result :sat
Minimization took 769 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 20 place count 210 transition count 216
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 207 transition count 216
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 207 transition count 213
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 204 transition count 213
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 34 place count 204 transition count 213
Applied a total of 34 rules in 34 ms. Remains 204 /220 variables (removed 16) and now considering 213/226 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 204/220 places, 213/226 transitions.
// Phase 1: matrix 213 rows 204 cols
[2023-03-10 03:35:13] [INFO ] Computed 31 place invariants in 10 ms
Incomplete random walk after 1000000 steps, including 144331 resets, run finished after 892 ms. (steps per millisecond=1121 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91262 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 1) seen :0
[2023-03-10 03:35:14] [INFO ] Invariant cache hit.
[2023-03-10 03:35:14] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:35:14] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:35:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:14] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-10 03:35:14] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:35:14] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:35:14] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:35:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:15] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-10 03:35:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:35:15] [INFO ] [Nat]Added 42 Read/Feed constraints in 232 ms returned sat
[2023-03-10 03:35:15] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 0 ms to minimize.
[2023-03-10 03:35:15] [INFO ] Deduced a trap composed of 19 places in 77 ms of which 0 ms to minimize.
[2023-03-10 03:35:15] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 0 ms to minimize.
[2023-03-10 03:35:15] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 1 ms to minimize.
[2023-03-10 03:35:15] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 462 ms
[2023-03-10 03:35:15] [INFO ] Computed and/alt/rep : 165/1067/165 causal constraints (skipped 47 transitions) in 16 ms.
[2023-03-10 03:35:17] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 1 ms to minimize.
[2023-03-10 03:35:17] [INFO ] Deduced a trap composed of 8 places in 175 ms of which 1 ms to minimize.
[2023-03-10 03:35:17] [INFO ] Deduced a trap composed of 60 places in 163 ms of which 1 ms to minimize.
[2023-03-10 03:35:18] [INFO ] Deduced a trap composed of 66 places in 131 ms of which 1 ms to minimize.
[2023-03-10 03:35:18] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 1 ms to minimize.
[2023-03-10 03:35:18] [INFO ] Deduced a trap composed of 67 places in 160 ms of which 1 ms to minimize.
[2023-03-10 03:35:18] [INFO ] Deduced a trap composed of 65 places in 149 ms of which 1 ms to minimize.
[2023-03-10 03:35:18] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 1 ms to minimize.
[2023-03-10 03:35:18] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 1 ms to minimize.
[2023-03-10 03:35:19] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 1 ms to minimize.
[2023-03-10 03:35:19] [INFO ] Deduced a trap composed of 69 places in 181 ms of which 1 ms to minimize.
[2023-03-10 03:35:19] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 1 ms to minimize.
[2023-03-10 03:35:19] [INFO ] Deduced a trap composed of 72 places in 148 ms of which 1 ms to minimize.
[2023-03-10 03:35:20] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 1 ms to minimize.
[2023-03-10 03:35:20] [INFO ] Deduced a trap composed of 61 places in 185 ms of which 1 ms to minimize.
[2023-03-10 03:35:20] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 1 ms to minimize.
[2023-03-10 03:35:20] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 1 ms to minimize.
[2023-03-10 03:35:20] [INFO ] Deduced a trap composed of 50 places in 125 ms of which 1 ms to minimize.
[2023-03-10 03:35:20] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 0 ms to minimize.
[2023-03-10 03:35:21] [INFO ] Deduced a trap composed of 60 places in 162 ms of which 1 ms to minimize.
[2023-03-10 03:35:21] [INFO ] Deduced a trap composed of 59 places in 159 ms of which 1 ms to minimize.
[2023-03-10 03:35:21] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 1 ms to minimize.
[2023-03-10 03:35:21] [INFO ] Trap strengthening (SAT) tested/added 23/22 trap constraints in 4111 ms
[2023-03-10 03:35:21] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 1 ms to minimize.
[2023-03-10 03:35:21] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 0 ms to minimize.
[2023-03-10 03:35:22] [INFO ] Deduced a trap composed of 61 places in 184 ms of which 1 ms to minimize.
[2023-03-10 03:35:22] [INFO ] Deduced a trap composed of 60 places in 184 ms of which 0 ms to minimize.
[2023-03-10 03:35:22] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 0 ms to minimize.
[2023-03-10 03:35:22] [INFO ] Deduced a trap composed of 44 places in 147 ms of which 0 ms to minimize.
[2023-03-10 03:35:22] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1181 ms
[2023-03-10 03:35:22] [INFO ] Added : 107 causal constraints over 24 iterations in 7138 ms. Result :sat
Minimization took 795 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 204 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 213/213 transitions.
Applied a total of 0 rules in 5 ms. Remains 204 /204 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 204/204 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 204/204 places, 213/213 transitions.
Applied a total of 0 rules in 4 ms. Remains 204 /204 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2023-03-10 03:35:24] [INFO ] Invariant cache hit.
[2023-03-10 03:35:24] [INFO ] Implicit Places using invariants in 252 ms returned []
[2023-03-10 03:35:24] [INFO ] Invariant cache hit.
[2023-03-10 03:35:24] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:35:27] [INFO ] Implicit Places using invariants and state equation in 2911 ms returned []
Implicit Place search using SMT with State Equation took 3165 ms to find 0 implicit places.
[2023-03-10 03:35:27] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:35:27] [INFO ] Invariant cache hit.
[2023-03-10 03:35:27] [INFO ] Dead Transitions using invariants and state equation in 236 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3414 ms. Remains : 204/204 places, 213/213 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-09 in 18977 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-10
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:35:27] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 10000 steps, including 1440 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 906 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-10 03:35:27] [INFO ] Invariant cache hit.
[2023-03-10 03:35:27] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:35:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:35:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:27] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2023-03-10 03:35:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:35:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 12 ms returned sat
[2023-03-10 03:35:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:35:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:28] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2023-03-10 03:35:28] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:35:28] [INFO ] [Nat]Added 33 Read/Feed constraints in 146 ms returned sat
[2023-03-10 03:35:28] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 17 ms.
[2023-03-10 03:35:31] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2023-03-10 03:35:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-10 03:35:31] [INFO ] Added : 155 causal constraints over 32 iterations in 3049 ms. Result :sat
Minimization took 580 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 209 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 209 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 206 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 206 transition count 214
Applied a total of 31 rules in 26 ms. Remains 206 /220 variables (removed 14) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-10 03:35:35] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144082 resets, run finished after 886 ms. (steps per millisecond=1128 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91370 resets, run finished after 617 ms. (steps per millisecond=1620 ) properties (out of 1) seen :0
[2023-03-10 03:35:36] [INFO ] Invariant cache hit.
[2023-03-10 03:35:36] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-10 03:35:36] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 7 ms returned sat
[2023-03-10 03:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:36] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2023-03-10 03:35:36] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:35:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-10 03:35:36] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:35:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:37] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2023-03-10 03:35:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-10 03:35:37] [INFO ] [Nat]Added 40 Read/Feed constraints in 86 ms returned sat
[2023-03-10 03:35:37] [INFO ] Computed and/alt/rep : 170/1086/170 causal constraints (skipped 43 transitions) in 16 ms.
[2023-03-10 03:35:38] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-10 03:35:38] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 1 ms to minimize.
[2023-03-10 03:35:39] [INFO ] Deduced a trap composed of 12 places in 115 ms of which 0 ms to minimize.
[2023-03-10 03:35:39] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 0 ms to minimize.
[2023-03-10 03:35:39] [INFO ] Deduced a trap composed of 68 places in 130 ms of which 0 ms to minimize.
[2023-03-10 03:35:39] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 1 ms to minimize.
[2023-03-10 03:35:39] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-10 03:35:39] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 0 ms to minimize.
[2023-03-10 03:35:40] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 1 ms to minimize.
[2023-03-10 03:35:40] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 1 ms to minimize.
[2023-03-10 03:35:40] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 1 ms to minimize.
[2023-03-10 03:35:40] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 1 ms to minimize.
[2023-03-10 03:35:40] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 0 ms to minimize.
[2023-03-10 03:35:41] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 1 ms to minimize.
[2023-03-10 03:35:41] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-03-10 03:35:41] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 1 ms to minimize.
[2023-03-10 03:35:41] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2023-03-10 03:35:41] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 2802 ms
[2023-03-10 03:35:41] [INFO ] Added : 136 causal constraints over 28 iterations in 4302 ms. Result :sat
Minimization took 624 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:35:49] [INFO ] Invariant cache hit.
[2023-03-10 03:35:49] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-10 03:35:49] [INFO ] Invariant cache hit.
[2023-03-10 03:35:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-10 03:35:50] [INFO ] Implicit Places using invariants and state equation in 1493 ms returned []
Implicit Place search using SMT with State Equation took 1740 ms to find 0 implicit places.
[2023-03-10 03:35:50] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:35:50] [INFO ] Invariant cache hit.
[2023-03-10 03:35:51] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2072 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-10 in 23693 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-11
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:35:51] [INFO ] Computed 31 place invariants in 13 ms
Incomplete random walk after 10000 steps, including 1453 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 912 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-10 03:35:51] [INFO ] Invariant cache hit.
[2023-03-10 03:35:51] [INFO ] [Real]Absence check using 13 positive place invariants in 17 ms returned sat
[2023-03-10 03:35:51] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:51] [INFO ] [Real]Absence check using state equation in 222 ms returned sat
[2023-03-10 03:35:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:35:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 13 ms returned sat
[2023-03-10 03:35:51] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:35:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:51] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-10 03:35:51] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:35:52] [INFO ] [Nat]Added 33 Read/Feed constraints in 325 ms returned sat
[2023-03-10 03:35:52] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 23 ms.
[2023-03-10 03:35:53] [INFO ] Deduced a trap composed of 13 places in 130 ms of which 0 ms to minimize.
[2023-03-10 03:35:53] [INFO ] Deduced a trap composed of 12 places in 168 ms of which 1 ms to minimize.
[2023-03-10 03:35:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 372 ms
[2023-03-10 03:35:53] [INFO ] Added : 79 causal constraints over 17 iterations in 1315 ms. Result :sat
Minimization took 265 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 2 place count 219 transition count 220
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 12 place count 214 transition count 220
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 208 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 208 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 36 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-10 03:35:53] [INFO ] Computed 31 place invariants in 17 ms
Incomplete random walk after 1000000 steps, including 144544 resets, run finished after 1062 ms. (steps per millisecond=941 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91545 resets, run finished after 612 ms. (steps per millisecond=1633 ) properties (out of 1) seen :0
[2023-03-10 03:35:55] [INFO ] Invariant cache hit.
[2023-03-10 03:35:55] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:35:55] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 03:35:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:55] [INFO ] [Real]Absence check using state equation in 190 ms returned sat
[2023-03-10 03:35:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:35:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:35:56] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 03:35:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:35:56] [INFO ] [Nat]Absence check using state equation in 192 ms returned sat
[2023-03-10 03:35:56] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:35:56] [INFO ] [Nat]Added 41 Read/Feed constraints in 143 ms returned sat
[2023-03-10 03:35:56] [INFO ] Computed and/alt/rep : 167/1078/167 causal constraints (skipped 46 transitions) in 24 ms.
[2023-03-10 03:35:57] [INFO ] Deduced a trap composed of 12 places in 172 ms of which 1 ms to minimize.
[2023-03-10 03:35:57] [INFO ] Deduced a trap composed of 8 places in 192 ms of which 0 ms to minimize.
[2023-03-10 03:35:57] [INFO ] Deduced a trap composed of 55 places in 208 ms of which 1 ms to minimize.
[2023-03-10 03:35:58] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 1 ms to minimize.
[2023-03-10 03:35:58] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 1 ms to minimize.
[2023-03-10 03:35:58] [INFO ] Deduced a trap composed of 63 places in 196 ms of which 1 ms to minimize.
[2023-03-10 03:35:58] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 0 ms to minimize.
[2023-03-10 03:35:59] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 1 ms to minimize.
[2023-03-10 03:35:59] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 1 ms to minimize.
[2023-03-10 03:35:59] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 1 ms to minimize.
[2023-03-10 03:35:59] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 0 ms to minimize.
[2023-03-10 03:36:00] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 1 ms to minimize.
[2023-03-10 03:36:00] [INFO ] Deduced a trap composed of 50 places in 156 ms of which 1 ms to minimize.
[2023-03-10 03:36:00] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 1 ms to minimize.
[2023-03-10 03:36:00] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 3475 ms
[2023-03-10 03:36:00] [INFO ] Added : 86 causal constraints over 19 iterations in 4492 ms. Result :sat
Minimization took 518 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:36:05] [INFO ] Invariant cache hit.
[2023-03-10 03:36:05] [INFO ] Implicit Places using invariants in 330 ms returned []
[2023-03-10 03:36:05] [INFO ] Invariant cache hit.
[2023-03-10 03:36:06] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-10 03:36:07] [INFO ] Implicit Places using invariants and state equation in 1973 ms returned []
Implicit Place search using SMT with State Equation took 2305 ms to find 0 implicit places.
[2023-03-10 03:36:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:36:07] [INFO ] Invariant cache hit.
[2023-03-10 03:36:08] [INFO ] Dead Transitions using invariants and state equation in 246 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2575 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-11 in 16894 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-12
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:36:08] [INFO ] Computed 31 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 1449 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 925 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
[2023-03-10 03:36:08] [INFO ] Invariant cache hit.
[2023-03-10 03:36:08] [INFO ] [Real]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:36:08] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 03:36:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:08] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2023-03-10 03:36:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:36:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 24 ms returned sat
[2023-03-10 03:36:08] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:36:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:08] [INFO ] [Nat]Absence check using state equation in 169 ms returned sat
[2023-03-10 03:36:08] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:36:08] [INFO ] [Nat]Added 33 Read/Feed constraints in 143 ms returned sat
[2023-03-10 03:36:08] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 27 ms.
[2023-03-10 03:36:10] [INFO ] Deduced a trap composed of 60 places in 207 ms of which 1 ms to minimize.
[2023-03-10 03:36:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 263 ms
[2023-03-10 03:36:10] [INFO ] Added : 89 causal constraints over 19 iterations in 1433 ms. Result :sat
Minimization took 698 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 219 transition count 221
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 208 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 208 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 24 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-10 03:36:11] [INFO ] Computed 31 place invariants in 14 ms
Incomplete random walk after 1000000 steps, including 144481 resets, run finished after 935 ms. (steps per millisecond=1069 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91344 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties (out of 1) seen :0
[2023-03-10 03:36:12] [INFO ] Invariant cache hit.
[2023-03-10 03:36:12] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-10 03:36:12] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:12] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-10 03:36:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:36:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:36:13] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:36:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:13] [INFO ] [Nat]Absence check using state equation in 225 ms returned sat
[2023-03-10 03:36:13] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:36:13] [INFO ] [Nat]Added 42 Read/Feed constraints in 128 ms returned sat
[2023-03-10 03:36:13] [INFO ] Computed and/alt/rep : 167/1081/167 causal constraints (skipped 46 transitions) in 25 ms.
[2023-03-10 03:36:14] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 0 ms to minimize.
[2023-03-10 03:36:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2023-03-10 03:36:14] [INFO ] Added : 58 causal constraints over 13 iterations in 1034 ms. Result :sat
Minimization took 241 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 6 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:36:14] [INFO ] Invariant cache hit.
[2023-03-10 03:36:15] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-10 03:36:15] [INFO ] Invariant cache hit.
[2023-03-10 03:36:15] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:36:17] [INFO ] Implicit Places using invariants and state equation in 2159 ms returned []
Implicit Place search using SMT with State Equation took 2534 ms to find 0 implicit places.
[2023-03-10 03:36:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:36:17] [INFO ] Invariant cache hit.
[2023-03-10 03:36:17] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2861 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-12 in 9521 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-13
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:36:17] [INFO ] Computed 31 place invariants in 22 ms
Incomplete random walk after 10000 steps, including 1448 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 902 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
[2023-03-10 03:36:17] [INFO ] Invariant cache hit.
[2023-03-10 03:36:17] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:36:17] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 8 ms returned sat
[2023-03-10 03:36:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:17] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2023-03-10 03:36:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:36:18] [INFO ] [Nat]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-03-10 03:36:18] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 03:36:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:18] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-10 03:36:18] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:36:18] [INFO ] [Nat]Added 33 Read/Feed constraints in 223 ms returned sat
[2023-03-10 03:36:18] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 24 ms.
[2023-03-10 03:36:21] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 0 ms to minimize.
[2023-03-10 03:36:21] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 1 ms to minimize.
[2023-03-10 03:36:21] [INFO ] Deduced a trap composed of 57 places in 141 ms of which 0 ms to minimize.
[2023-03-10 03:36:21] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 593 ms
[2023-03-10 03:36:21] [INFO ] Added : 132 causal constraints over 27 iterations in 3146 ms. Result :sat
Minimization took 834 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 219 transition count 221
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 208 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 27 place count 208 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 205 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 33 place count 205 transition count 214
Applied a total of 33 rules in 19 ms. Remains 205 /220 variables (removed 15) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 205/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 205 cols
[2023-03-10 03:36:26] [INFO ] Computed 31 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 144080 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91350 resets, run finished after 619 ms. (steps per millisecond=1615 ) properties (out of 1) seen :0
[2023-03-10 03:36:27] [INFO ] Invariant cache hit.
[2023-03-10 03:36:27] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-10 03:36:27] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-10 03:36:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:27] [INFO ] [Real]Absence check using state equation in 173 ms returned sat
[2023-03-10 03:36:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:36:27] [INFO ] [Nat]Absence check using 13 positive place invariants in 15 ms returned sat
[2023-03-10 03:36:27] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 9 ms returned sat
[2023-03-10 03:36:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:28] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2023-03-10 03:36:28] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:36:28] [INFO ] [Nat]Added 42 Read/Feed constraints in 185 ms returned sat
[2023-03-10 03:36:28] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 0 ms to minimize.
[2023-03-10 03:36:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-10 03:36:28] [INFO ] Computed and/alt/rep : 167/1081/167 causal constraints (skipped 46 transitions) in 25 ms.
[2023-03-10 03:36:30] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 1 ms to minimize.
[2023-03-10 03:36:30] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 1 ms to minimize.
[2023-03-10 03:36:30] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 1 ms to minimize.
[2023-03-10 03:36:31] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 1 ms to minimize.
[2023-03-10 03:36:31] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 1 ms to minimize.
[2023-03-10 03:36:31] [INFO ] Deduced a trap composed of 71 places in 177 ms of which 1 ms to minimize.
[2023-03-10 03:36:31] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 0 ms to minimize.
[2023-03-10 03:36:32] [INFO ] Deduced a trap composed of 61 places in 180 ms of which 1 ms to minimize.
[2023-03-10 03:36:32] [INFO ] Deduced a trap composed of 22 places in 193 ms of which 1 ms to minimize.
[2023-03-10 03:36:32] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 1 ms to minimize.
[2023-03-10 03:36:32] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 1 ms to minimize.
[2023-03-10 03:36:32] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2513 ms
[2023-03-10 03:36:32] [INFO ] Added : 117 causal constraints over 25 iterations in 4311 ms. Result :sat
Minimization took 534 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 3 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 205/205 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 205 /205 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:36:45] [INFO ] Invariant cache hit.
[2023-03-10 03:36:46] [INFO ] Implicit Places using invariants in 283 ms returned []
[2023-03-10 03:36:46] [INFO ] Invariant cache hit.
[2023-03-10 03:36:46] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:36:48] [INFO ] Implicit Places using invariants and state equation in 2374 ms returned []
Implicit Place search using SMT with State Equation took 2690 ms to find 0 implicit places.
[2023-03-10 03:36:48] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-10 03:36:48] [INFO ] Invariant cache hit.
[2023-03-10 03:36:48] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2896 ms. Remains : 205/205 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-13 in 31100 ms.
Starting property specific reduction for DoubleExponent-PT-010-UpperBounds-15
// Phase 1: matrix 226 rows 220 cols
[2023-03-10 03:36:48] [INFO ] Computed 31 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 1458 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 936 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-10 03:36:48] [INFO ] Invariant cache hit.
[2023-03-10 03:36:48] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-03-10 03:36:48] [INFO ] [Real]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:36:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:48] [INFO ] [Real]Absence check using state equation in 140 ms returned sat
[2023-03-10 03:36:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:36:49] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-03-10 03:36:49] [INFO ] [Nat]Absence check using 13 positive and 18 generalized place invariants in 5 ms returned sat
[2023-03-10 03:36:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:49] [INFO ] [Nat]Absence check using state equation in 149 ms returned sat
[2023-03-10 03:36:49] [INFO ] State equation strengthened by 33 read => feed constraints.
[2023-03-10 03:36:49] [INFO ] [Nat]Added 33 Read/Feed constraints in 234 ms returned sat
[2023-03-10 03:36:49] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 0 ms to minimize.
[2023-03-10 03:36:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2023-03-10 03:36:49] [INFO ] Computed and/alt/rep : 192/1086/192 causal constraints (skipped 33 transitions) in 15 ms.
[2023-03-10 03:36:51] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2023-03-10 03:36:51] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 0 ms to minimize.
[2023-03-10 03:36:52] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 0 ms to minimize.
[2023-03-10 03:36:52] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 0 ms to minimize.
[2023-03-10 03:36:52] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 672 ms
[2023-03-10 03:36:52] [INFO ] Added : 139 causal constraints over 29 iterations in 2917 ms. Result :sat
Minimization took 497 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 226/226 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 220 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 219 transition count 225
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 219 transition count 221
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 215 transition count 221
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 18 place count 211 transition count 217
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 209 transition count 217
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 25 place count 209 transition count 214
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 28 place count 206 transition count 214
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 31 place count 206 transition count 214
Applied a total of 31 rules in 25 ms. Remains 206 /220 variables (removed 14) and now considering 214/226 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 206/220 places, 214/226 transitions.
// Phase 1: matrix 214 rows 206 cols
[2023-03-10 03:36:57] [INFO ] Computed 31 place invariants in 8 ms
Incomplete random walk after 1000000 steps, including 144062 resets, run finished after 1072 ms. (steps per millisecond=932 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 91499 resets, run finished after 638 ms. (steps per millisecond=1567 ) properties (out of 1) seen :0
[2023-03-10 03:36:59] [INFO ] Invariant cache hit.
[2023-03-10 03:36:59] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 03:36:59] [INFO ] [Real]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-10 03:36:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:59] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-10 03:36:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-10 03:36:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-10 03:36:59] [INFO ] [Nat]Absence check using 3 positive and 28 generalized place invariants in 12 ms returned sat
[2023-03-10 03:36:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-10 03:36:59] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2023-03-10 03:36:59] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:37:00] [INFO ] [Nat]Added 42 Read/Feed constraints in 108 ms returned sat
[2023-03-10 03:37:00] [INFO ] Computed and/alt/rep : 169/1085/169 causal constraints (skipped 44 transitions) in 25 ms.
[2023-03-10 03:37:01] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 1 ms to minimize.
[2023-03-10 03:37:01] [INFO ] Deduced a trap composed of 11 places in 175 ms of which 1 ms to minimize.
[2023-03-10 03:37:01] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 1 ms to minimize.
[2023-03-10 03:37:02] [INFO ] Deduced a trap composed of 13 places in 185 ms of which 1 ms to minimize.
[2023-03-10 03:37:02] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 915 ms
[2023-03-10 03:37:02] [INFO ] Added : 99 causal constraints over 20 iterations in 2270 ms. Result :sat
Minimization took 390 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 206/206 places, 214/214 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 206/206 places, 214/214 transitions.
Applied a total of 0 rules in 4 ms. Remains 206 /206 variables (removed 0) and now considering 214/214 (removed 0) transitions.
[2023-03-10 03:37:03] [INFO ] Invariant cache hit.
[2023-03-10 03:37:03] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-03-10 03:37:03] [INFO ] Invariant cache hit.
[2023-03-10 03:37:03] [INFO ] State equation strengthened by 42 read => feed constraints.
[2023-03-10 03:37:06] [INFO ] Implicit Places using invariants and state equation in 2446 ms returned []
Implicit Place search using SMT with State Equation took 2697 ms to find 0 implicit places.
[2023-03-10 03:37:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-10 03:37:06] [INFO ] Invariant cache hit.
[2023-03-10 03:37:06] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2913 ms. Remains : 206/206 places, 214/214 transitions.
Ending property specific reduction for DoubleExponent-PT-010-UpperBounds-15 in 17770 ms.
[2023-03-10 03:37:06] [INFO ] Flatten gal took : 169 ms
[2023-03-10 03:37:06] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/UpperBounds.sr.xml took 7 ms.
[2023-03-10 03:37:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 220 places, 226 transitions and 1236 arcs took 5 ms.
Total runtime 582554 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DoubleExponent (PT), instance 010
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 220 places, 226 transitions, 1236 arcs.
Final Score: 6109.013
Took : 13 seconds
Bounds file is: UpperBounds.xml
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9625132 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16107348 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool smartxred"
echo " Input is DoubleExponent-PT-010, 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 r139-smll-167819423100477"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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