About the Execution of LTSMin+red for PolyORBNT-COL-S05J80
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1017.571 | 3600000.00 | 13518768.00 | 855.80 | 4 ? 1 3 2 1 10 ? 1 1 5 2 4 3 1 1 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r297-tall-167873950800669.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 ltsminxred
Input is PolyORBNT-COL-S05J80, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950800669
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 25 23:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 23:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 25 23:45 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 00:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 00:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:58 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 23:58 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 94K Mar 5 18:23 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 PolyORBNT-COL-S05J80-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S05J80-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1679605055276
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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S05J80
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-23 20:57:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-23 20:57:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 20:57:37] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-03-23 20:57:37] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-03-23 20:57:37] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 595 ms
[2023-03-23 20:57:37] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2023-03-23 20:57:37] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2023-03-23 20:57:37] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2023-03-23 20:57:37] [INFO ] Computed 13 place invariants in 6 ms
FORMULA PolyORBNT-COL-S05J80-UpperBounds-10 5 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-06 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
FORMULA PolyORBNT-COL-S05J80-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2023-03-23 20:57:38] [INFO ] Invariant cache hit.
[2023-03-23 20:57:38] [INFO ] [Real]Absence check using 6 positive place invariants in 6 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:38] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-23 20:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-23 20:57:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:57:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 6 ms returned sat
[2023-03-23 20:57:38] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 3 ms to minimize.
[2023-03-23 20:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-23 20:57:38] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 20:57:38] [INFO ] Added : 18 causal constraints over 4 iterations in 289 ms. Result :sat
Minimization took 113 ms.
[2023-03-23 20:57:38] [INFO ] [Real]Absence check using 6 positive place invariants in 24 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:38] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-23 20:57:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:38] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2023-03-23 20:57:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:38] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2023-03-23 20:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-23 20:57:38] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 20:57:39] [INFO ] Added : 22 causal constraints over 5 iterations in 166 ms. Result :sat
Minimization took 30 ms.
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 20:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2023-03-23 20:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-23 20:57:39] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-23 20:57:39] [INFO ] Deduced a trap composed of 25 places in 32 ms of which 0 ms to minimize.
[2023-03-23 20:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-23 20:57:39] [INFO ] Added : 33 causal constraints over 7 iterations in 161 ms. Result :sat
Minimization took 27 ms.
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 20:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:39] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 20:57:39] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2023-03-23 20:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 20:57:39] [INFO ] Added : 22 causal constraints over 5 iterations in 71 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:39] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 20:57:39] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2023-03-23 20:57:39] [INFO ] [Nat]Added 1 Read/Feed constraints in 38 ms returned sat
[2023-03-23 20:57:39] [INFO ] Deduced a trap composed of 14 places in 37 ms of which 1 ms to minimize.
[2023-03-23 20:57:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-23 20:57:39] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 20:57:39] [INFO ] Added : 20 causal constraints over 5 iterations in 89 ms. Result :sat
Minimization took 16 ms.
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 20:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:40] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-23 20:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2023-03-23 20:57:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-23 20:57:40] [INFO ] Added : 21 causal constraints over 5 iterations in 37 ms. Result :sat
Minimization took 183 ms.
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2023-03-23 20:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:40] [INFO ] Deduced a trap composed of 14 places in 28 ms of which 1 ms to minimize.
[2023-03-23 20:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2023-03-23 20:57:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 20:57:40] [INFO ] Added : 36 causal constraints over 8 iterations in 109 ms. Result :sat
Minimization took 21 ms.
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2023-03-23 20:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2023-03-23 20:57:40] [INFO ] Added : 36 causal constraints over 8 iterations in 50 ms. Result :sat
Minimization took 17 ms.
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:40] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2023-03-23 20:57:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:40] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-23 20:57:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:40] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2023-03-23 20:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2023-03-23 20:57:40] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 20:57:40] [INFO ] Added : 20 causal constraints over 5 iterations in 30 ms. Result :sat
Minimization took 15 ms.
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2023-03-23 20:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:41] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 0 ms to minimize.
[2023-03-23 20:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2023-03-23 20:57:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 20:57:41] [INFO ] Added : 18 causal constraints over 4 iterations in 277 ms. Result :sat
Minimization took 56 ms.
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-23 20:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:41] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 0 ms to minimize.
[2023-03-23 20:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2023-03-23 20:57:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2023-03-23 20:57:41] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2023-03-23 20:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-23 20:57:41] [INFO ] Added : 36 causal constraints over 8 iterations in 154 ms. Result :sat
Minimization took 18 ms.
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 1 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:41] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-23 20:57:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:41] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-23 20:57:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2023-03-23 20:57:41] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 ms to minimize.
[2023-03-23 20:57:41] [INFO ] Deduced a trap composed of 15 places in 21 ms of which 0 ms to minimize.
[2023-03-23 20:57:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2023-03-23 20:57:41] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2023-03-23 20:57:42] [INFO ] Added : 36 causal constraints over 8 iterations in 43 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [10, 4, 1, 3, 2, 10, -1, -1, 2, 10, 3, -1, -1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-13 3 TECHNIQUES TOPOLOGICAL SAT_SMT CPN_APPROX INITIAL_STATE
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2023-03-23 20:57:42] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 2430 transitions 14624 arcs in 86 ms.
[2023-03-23 20:57:42] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 18 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
Incomplete random walk after 10000 steps, including 709 resets, run finished after 155 ms. (steps per millisecond=64 ) properties (out of 12) seen :22
FORMULA PolyORBNT-COL-S05J80-UpperBounds-03 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 51 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :13
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :15
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10000 steps, including 128 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 10) seen :17
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :14
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :9
Incomplete Best-First random walk after 10001 steps, including 55 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :18
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :17
[2023-03-23 20:57:42] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2023-03-23 20:57:42] [INFO ] Computed 182 place invariants in 160 ms
[2023-03-23 20:57:43] [INFO ] [Real]Absence check using 175 positive place invariants in 76 ms returned sat
[2023-03-23 20:57:43] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned unsat
[2023-03-23 20:57:43] [INFO ] [Real]Absence check using 175 positive place invariants in 60 ms returned sat
[2023-03-23 20:57:43] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 39 ms returned sat
[2023-03-23 20:57:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:44] [INFO ] [Real]Absence check using state equation in 637 ms returned sat
[2023-03-23 20:57:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:44] [INFO ] [Nat]Absence check using 175 positive place invariants in 50 ms returned sat
[2023-03-23 20:57:44] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-23 20:57:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:45] [INFO ] [Nat]Absence check using state equation in 885 ms returned sat
[2023-03-23 20:57:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:57:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 1096 ms returned sat
[2023-03-23 20:57:46] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 158 ms.
[2023-03-23 20:57:47] [INFO ] Deduced a trap composed of 664 places in 517 ms of which 2 ms to minimize.
[2023-03-23 20:57:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 824 ms
[2023-03-23 20:57:48] [INFO ] Added : 19 causal constraints over 4 iterations in 1665 ms. Result :sat
Minimization took 684 ms.
[2023-03-23 20:57:48] [INFO ] [Real]Absence check using 175 positive place invariants in 62 ms returned sat
[2023-03-23 20:57:48] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 27 ms returned sat
[2023-03-23 20:57:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:49] [INFO ] [Real]Absence check using state equation in 549 ms returned sat
[2023-03-23 20:57:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:49] [INFO ] [Nat]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-23 20:57:49] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-23 20:57:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:51] [INFO ] [Nat]Absence check using state equation in 1859 ms returned sat
[2023-03-23 20:57:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 16 ms returned sat
[2023-03-23 20:57:52] [INFO ] Deduced a trap composed of 388 places in 569 ms of which 1 ms to minimize.
[2023-03-23 20:57:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 854 ms
[2023-03-23 20:57:52] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 114 ms.
[2023-03-23 20:57:53] [INFO ] Added : 15 causal constraints over 3 iterations in 554 ms. Result :sat
Minimization took 1509 ms.
[2023-03-23 20:57:54] [INFO ] [Real]Absence check using 175 positive place invariants in 50 ms returned sat
[2023-03-23 20:57:54] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-23 20:57:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:55] [INFO ] [Real]Absence check using state equation in 478 ms returned sat
[2023-03-23 20:57:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:55] [INFO ] [Nat]Absence check using 175 positive place invariants in 50 ms returned sat
[2023-03-23 20:57:55] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 28 ms returned sat
[2023-03-23 20:57:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:56] [INFO ] [Nat]Absence check using state equation in 581 ms returned sat
[2023-03-23 20:57:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2023-03-23 20:57:56] [INFO ] Deduced a trap composed of 403 places in 523 ms of which 1 ms to minimize.
[2023-03-23 20:57:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 752 ms
[2023-03-23 20:57:57] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 116 ms.
[2023-03-23 20:57:57] [INFO ] Added : 17 causal constraints over 4 iterations in 738 ms. Result :sat
Minimization took 580 ms.
[2023-03-23 20:57:58] [INFO ] [Real]Absence check using 175 positive place invariants in 51 ms returned sat
[2023-03-23 20:57:58] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 31 ms returned unsat
[2023-03-23 20:57:58] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-23 20:57:58] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 27 ms returned unsat
[2023-03-23 20:57:58] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-23 20:57:58] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-23 20:57:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:57:59] [INFO ] [Real]Absence check using state equation in 504 ms returned sat
[2023-03-23 20:57:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:57:59] [INFO ] [Nat]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-23 20:57:59] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-23 20:57:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:58:00] [INFO ] [Nat]Absence check using state equation in 869 ms returned sat
[2023-03-23 20:58:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 658 ms returned sat
[2023-03-23 20:58:01] [INFO ] Computed and/alt/rep : 949/2209/949 causal constraints (skipped 736 transitions) in 110 ms.
[2023-03-23 20:58:03] [INFO ] Deduced a trap composed of 383 places in 573 ms of which 1 ms to minimize.
[2023-03-23 20:58:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1019 ms
[2023-03-23 20:58:04] [INFO ] Added : 13 causal constraints over 3 iterations in 2863 ms. Result :sat
Minimization took 342 ms.
[2023-03-23 20:58:04] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-23 20:58:04] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 17 ms returned unsat
[2023-03-23 20:58:04] [INFO ] [Real]Absence check using 175 positive place invariants in 54 ms returned sat
[2023-03-23 20:58:04] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 24 ms returned unsat
[2023-03-23 20:58:05] [INFO ] [Real]Absence check using 175 positive place invariants in 52 ms returned sat
[2023-03-23 20:58:05] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 25 ms returned unsat
Current structural bounds on expressions (after SMT) : [4, 4, 2, 10, 1, 1, 2, 4, 1, 1] Max seen :[4, 3, 0, 3, 1, 1, 0, 4, 1, 1]
FORMULA PolyORBNT-COL-S05J80-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-UpperBounds-11 2 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 3 out of 1189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Drop transitions removed 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 91 rules applied. Total rules applied 91 place count 1184 transition count 1609
Reduce places removed 86 places and 0 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 177 place count 1098 transition count 1609
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 177 place count 1098 transition count 1525
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 345 place count 1014 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 346 place count 1013 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 347 place count 1013 transition count 1524
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 351 place count 1011 transition count 1522
Applied a total of 351 rules in 417 ms. Remains 1011 /1189 variables (removed 178) and now considering 1522/1695 (removed 173) transitions.
[2023-03-23 20:58:05] [INFO ] Flow matrix only has 1518 transitions (discarded 4 similar events)
// Phase 1: matrix 1518 rows 1011 cols
[2023-03-23 20:58:05] [INFO ] Computed 177 place invariants in 123 ms
[2023-03-23 20:58:07] [INFO ] Dead Transitions using invariants and state equation in 1529 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1011/1189 places, 1427/1695 transitions.
Applied a total of 0 rules in 103 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2052 ms. Remains : 1011/1189 places, 1427/1695 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 20:58:07] [INFO ] Computed 177 place invariants in 28 ms
Incomplete random walk after 1000000 steps, including 47248 resets, run finished after 7177 ms. (steps per millisecond=139 ) properties (out of 3) seen :8
FORMULA PolyORBNT-COL-S05J80-UpperBounds-04 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 2567 resets, run finished after 1616 ms. (steps per millisecond=618 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2718 resets, run finished after 1588 ms. (steps per millisecond=629 ) properties (out of 2) seen :6
[2023-03-23 20:58:17] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 20:58:17] [INFO ] Computed 177 place invariants in 36 ms
[2023-03-23 20:58:17] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2023-03-23 20:58:18] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 20:58:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:58:18] [INFO ] [Real]Absence check using state equation in 422 ms returned sat
[2023-03-23 20:58:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:58:18] [INFO ] [Nat]Absence check using 170 positive place invariants in 40 ms returned sat
[2023-03-23 20:58:18] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 20 ms returned sat
[2023-03-23 20:58:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:58:19] [INFO ] [Nat]Absence check using state equation in 477 ms returned sat
[2023-03-23 20:58:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:58:19] [INFO ] [Nat]Added 1 Read/Feed constraints in 577 ms returned sat
[2023-03-23 20:58:20] [INFO ] Deduced a trap composed of 320 places in 372 ms of which 1 ms to minimize.
[2023-03-23 20:58:20] [INFO ] Deduced a trap composed of 305 places in 392 ms of which 1 ms to minimize.
[2023-03-23 20:58:21] [INFO ] Deduced a trap composed of 326 places in 395 ms of which 1 ms to minimize.
[2023-03-23 20:58:21] [INFO ] Deduced a trap composed of 314 places in 388 ms of which 0 ms to minimize.
[2023-03-23 20:58:21] [INFO ] Deduced a trap composed of 314 places in 380 ms of which 1 ms to minimize.
[2023-03-23 20:58:22] [INFO ] Deduced a trap composed of 323 places in 365 ms of which 1 ms to minimize.
[2023-03-23 20:58:22] [INFO ] Deduced a trap composed of 317 places in 359 ms of which 1 ms to minimize.
[2023-03-23 20:58:23] [INFO ] Deduced a trap composed of 323 places in 356 ms of which 1 ms to minimize.
[2023-03-23 20:58:23] [INFO ] Deduced a trap composed of 345 places in 386 ms of which 1 ms to minimize.
[2023-03-23 20:58:24] [INFO ] Deduced a trap composed of 324 places in 398 ms of which 1 ms to minimize.
[2023-03-23 20:58:25] [INFO ] Deduced a trap composed of 320 places in 396 ms of which 1 ms to minimize.
[2023-03-23 20:58:25] [INFO ] Deduced a trap composed of 338 places in 425 ms of which 1 ms to minimize.
[2023-03-23 20:58:26] [INFO ] Deduced a trap composed of 335 places in 417 ms of which 1 ms to minimize.
[2023-03-23 20:58:26] [INFO ] Deduced a trap composed of 329 places in 384 ms of which 1 ms to minimize.
[2023-03-23 20:58:27] [INFO ] Deduced a trap composed of 326 places in 371 ms of which 1 ms to minimize.
[2023-03-23 20:58:27] [INFO ] Deduced a trap composed of 332 places in 395 ms of which 2 ms to minimize.
[2023-03-23 20:58:28] [INFO ] Deduced a trap composed of 317 places in 365 ms of which 1 ms to minimize.
[2023-03-23 20:58:28] [INFO ] Deduced a trap composed of 341 places in 358 ms of which 1 ms to minimize.
[2023-03-23 20:58:29] [INFO ] Deduced a trap composed of 317 places in 371 ms of which 1 ms to minimize.
[2023-03-23 20:58:29] [INFO ] Deduced a trap composed of 353 places in 378 ms of which 1 ms to minimize.
[2023-03-23 20:58:29] [INFO ] Deduced a trap composed of 323 places in 362 ms of which 1 ms to minimize.
[2023-03-23 20:58:31] [INFO ] Deduced a trap composed of 311 places in 367 ms of which 1 ms to minimize.
[2023-03-23 20:58:31] [INFO ] Deduced a trap composed of 326 places in 369 ms of which 1 ms to minimize.
[2023-03-23 20:58:32] [INFO ] Deduced a trap composed of 317 places in 358 ms of which 1 ms to minimize.
[2023-03-23 20:58:33] [INFO ] Deduced a trap composed of 314 places in 360 ms of which 1 ms to minimize.
[2023-03-23 20:58:33] [INFO ] Deduced a trap composed of 329 places in 362 ms of which 1 ms to minimize.
[2023-03-23 20:58:34] [INFO ] Deduced a trap composed of 317 places in 357 ms of which 1 ms to minimize.
[2023-03-23 20:58:35] [INFO ] Deduced a trap composed of 326 places in 365 ms of which 1 ms to minimize.
[2023-03-23 20:58:35] [INFO ] Deduced a trap composed of 329 places in 365 ms of which 1 ms to minimize.
[2023-03-23 20:58:36] [INFO ] Deduced a trap composed of 320 places in 369 ms of which 1 ms to minimize.
[2023-03-23 20:58:38] [INFO ] Deduced a trap composed of 317 places in 343 ms of which 1 ms to minimize.
[2023-03-23 20:58:41] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 21782 ms
[2023-03-23 20:58:41] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2023-03-23 20:58:41] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-23 20:58:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:58:42] [INFO ] [Real]Absence check using state equation in 444 ms returned sat
[2023-03-23 20:58:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:58:42] [INFO ] [Nat]Absence check using 170 positive place invariants in 41 ms returned sat
[2023-03-23 20:58:42] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 30 ms returned sat
[2023-03-23 20:58:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:58:43] [INFO ] [Nat]Absence check using state equation in 633 ms returned sat
[2023-03-23 20:58:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 121 ms returned sat
[2023-03-23 20:58:43] [INFO ] Deduced a trap composed of 302 places in 373 ms of which 1 ms to minimize.
[2023-03-23 20:58:43] [INFO ] Deduced a trap composed of 317 places in 372 ms of which 2 ms to minimize.
[2023-03-23 20:58:44] [INFO ] Deduced a trap composed of 308 places in 373 ms of which 0 ms to minimize.
[2023-03-23 20:58:44] [INFO ] Deduced a trap composed of 302 places in 362 ms of which 1 ms to minimize.
[2023-03-23 20:58:45] [INFO ] Deduced a trap composed of 326 places in 367 ms of which 1 ms to minimize.
[2023-03-23 20:58:45] [INFO ] Deduced a trap composed of 344 places in 368 ms of which 0 ms to minimize.
[2023-03-23 20:58:46] [INFO ] Deduced a trap composed of 320 places in 345 ms of which 0 ms to minimize.
[2023-03-23 20:58:46] [INFO ] Deduced a trap composed of 320 places in 360 ms of which 1 ms to minimize.
[2023-03-23 20:58:47] [INFO ] Deduced a trap composed of 314 places in 363 ms of which 1 ms to minimize.
[2023-03-23 20:58:47] [INFO ] Deduced a trap composed of 329 places in 372 ms of which 1 ms to minimize.
[2023-03-23 20:58:48] [INFO ] Deduced a trap composed of 326 places in 345 ms of which 0 ms to minimize.
[2023-03-23 20:58:48] [INFO ] Deduced a trap composed of 308 places in 358 ms of which 1 ms to minimize.
[2023-03-23 20:58:48] [INFO ] Deduced a trap composed of 329 places in 357 ms of which 1 ms to minimize.
[2023-03-23 20:58:49] [INFO ] Deduced a trap composed of 323 places in 357 ms of which 1 ms to minimize.
[2023-03-23 20:58:49] [INFO ] Deduced a trap composed of 308 places in 364 ms of which 1 ms to minimize.
[2023-03-23 20:58:50] [INFO ] Deduced a trap composed of 323 places in 355 ms of which 1 ms to minimize.
[2023-03-23 20:58:50] [INFO ] Deduced a trap composed of 311 places in 371 ms of which 2 ms to minimize.
[2023-03-23 20:58:51] [INFO ] Deduced a trap composed of 314 places in 393 ms of which 1 ms to minimize.
[2023-03-23 20:58:52] [INFO ] Deduced a trap composed of 320 places in 357 ms of which 2 ms to minimize.
[2023-03-23 20:58:52] [INFO ] Deduced a trap composed of 332 places in 353 ms of which 1 ms to minimize.
[2023-03-23 20:58:52] [INFO ] Deduced a trap composed of 332 places in 347 ms of which 1 ms to minimize.
[2023-03-23 20:58:53] [INFO ] Deduced a trap composed of 305 places in 351 ms of which 1 ms to minimize.
[2023-03-23 20:58:53] [INFO ] Deduced a trap composed of 320 places in 356 ms of which 1 ms to minimize.
[2023-03-23 20:58:54] [INFO ] Deduced a trap composed of 329 places in 357 ms of which 0 ms to minimize.
[2023-03-23 20:58:54] [INFO ] Deduced a trap composed of 320 places in 360 ms of which 1 ms to minimize.
[2023-03-23 20:58:55] [INFO ] Deduced a trap composed of 326 places in 366 ms of which 1 ms to minimize.
[2023-03-23 20:58:56] [INFO ] Deduced a trap composed of 308 places in 364 ms of which 1 ms to minimize.
[2023-03-23 20:58:56] [INFO ] Deduced a trap composed of 332 places in 359 ms of which 1 ms to minimize.
[2023-03-23 20:58:57] [INFO ] Deduced a trap composed of 329 places in 352 ms of which 1 ms to minimize.
[2023-03-23 20:58:57] [INFO ] Deduced a trap composed of 314 places in 355 ms of which 1 ms to minimize.
[2023-03-23 20:58:57] [INFO ] Deduced a trap composed of 305 places in 360 ms of which 1 ms to minimize.
[2023-03-23 20:58:58] [INFO ] Deduced a trap composed of 332 places in 367 ms of which 4 ms to minimize.
[2023-03-23 20:58:58] [INFO ] Deduced a trap composed of 320 places in 341 ms of which 1 ms to minimize.
[2023-03-23 20:58:59] [INFO ] Deduced a trap composed of 329 places in 352 ms of which 1 ms to minimize.
[2023-03-23 20:58:59] [INFO ] Deduced a trap composed of 326 places in 361 ms of which 1 ms to minimize.
[2023-03-23 20:59:00] [INFO ] Deduced a trap composed of 317 places in 359 ms of which 1 ms to minimize.
[2023-03-23 20:59:00] [INFO ] Deduced a trap composed of 335 places in 354 ms of which 1 ms to minimize.
[2023-03-23 20:59:01] [INFO ] Deduced a trap composed of 314 places in 366 ms of which 1 ms to minimize.
[2023-03-23 20:59:01] [INFO ] Deduced a trap composed of 335 places in 359 ms of which 1 ms to minimize.
[2023-03-23 20:59:02] [INFO ] Deduced a trap composed of 344 places in 364 ms of which 0 ms to minimize.
[2023-03-23 20:59:02] [INFO ] Deduced a trap composed of 317 places in 361 ms of which 1 ms to minimize.
[2023-03-23 20:59:03] [INFO ] Deduced a trap composed of 308 places in 357 ms of which 1 ms to minimize.
[2023-03-23 20:59:05] [INFO ] Deduced a trap composed of 314 places in 356 ms of which 1 ms to minimize.
[2023-03-23 20:59:07] [INFO ] Deduced a trap composed of 299 places in 364 ms of which 1 ms to minimize.
[2023-03-23 20:59:09] [INFO ] Deduced a trap composed of 347 places in 406 ms of which 1 ms to minimize.
[2023-03-23 20:59:12] [INFO ] Deduced a trap composed of 329 places in 356 ms of which 1 ms to minimize.
[2023-03-23 20:59:13] [INFO ] Deduced a trap composed of 323 places in 356 ms of which 1 ms to minimize.
[2023-03-23 20:59:16] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 33763 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[3, 3]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 46 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 20:59:17] [INFO ] Computed 177 place invariants in 27 ms
Incomplete random walk after 1000000 steps, including 47345 resets, run finished after 6845 ms. (steps per millisecond=146 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2600 resets, run finished after 1575 ms. (steps per millisecond=634 ) properties (out of 2) seen :6
Incomplete Best-First random walk after 1000001 steps, including 2633 resets, run finished after 1575 ms. (steps per millisecond=634 ) properties (out of 2) seen :6
[2023-03-23 20:59:27] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 20:59:27] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-23 20:59:27] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2023-03-23 20:59:27] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-23 20:59:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:59:27] [INFO ] [Real]Absence check using state equation in 439 ms returned sat
[2023-03-23 20:59:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:59:27] [INFO ] [Nat]Absence check using 170 positive place invariants in 40 ms returned sat
[2023-03-23 20:59:27] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 21 ms returned sat
[2023-03-23 20:59:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:59:28] [INFO ] [Nat]Absence check using state equation in 491 ms returned sat
[2023-03-23 20:59:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 20:59:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 553 ms returned sat
[2023-03-23 20:59:29] [INFO ] Deduced a trap composed of 320 places in 359 ms of which 1 ms to minimize.
[2023-03-23 20:59:29] [INFO ] Deduced a trap composed of 305 places in 336 ms of which 1 ms to minimize.
[2023-03-23 20:59:30] [INFO ] Deduced a trap composed of 326 places in 364 ms of which 0 ms to minimize.
[2023-03-23 20:59:30] [INFO ] Deduced a trap composed of 314 places in 345 ms of which 1 ms to minimize.
[2023-03-23 20:59:30] [INFO ] Deduced a trap composed of 314 places in 336 ms of which 0 ms to minimize.
[2023-03-23 20:59:31] [INFO ] Deduced a trap composed of 323 places in 360 ms of which 1 ms to minimize.
[2023-03-23 20:59:31] [INFO ] Deduced a trap composed of 317 places in 348 ms of which 1 ms to minimize.
[2023-03-23 20:59:32] [INFO ] Deduced a trap composed of 323 places in 355 ms of which 2 ms to minimize.
[2023-03-23 20:59:32] [INFO ] Deduced a trap composed of 345 places in 382 ms of which 1 ms to minimize.
[2023-03-23 20:59:33] [INFO ] Deduced a trap composed of 324 places in 396 ms of which 1 ms to minimize.
[2023-03-23 20:59:34] [INFO ] Deduced a trap composed of 320 places in 382 ms of which 1 ms to minimize.
[2023-03-23 20:59:34] [INFO ] Deduced a trap composed of 338 places in 379 ms of which 1 ms to minimize.
[2023-03-23 20:59:35] [INFO ] Deduced a trap composed of 335 places in 393 ms of which 1 ms to minimize.
[2023-03-23 20:59:35] [INFO ] Deduced a trap composed of 329 places in 363 ms of which 1 ms to minimize.
[2023-03-23 20:59:36] [INFO ] Deduced a trap composed of 326 places in 361 ms of which 1 ms to minimize.
[2023-03-23 20:59:36] [INFO ] Deduced a trap composed of 332 places in 365 ms of which 1 ms to minimize.
[2023-03-23 20:59:36] [INFO ] Deduced a trap composed of 317 places in 361 ms of which 1 ms to minimize.
[2023-03-23 20:59:37] [INFO ] Deduced a trap composed of 341 places in 336 ms of which 1 ms to minimize.
[2023-03-23 20:59:37] [INFO ] Deduced a trap composed of 317 places in 351 ms of which 1 ms to minimize.
[2023-03-23 20:59:38] [INFO ] Deduced a trap composed of 353 places in 356 ms of which 1 ms to minimize.
[2023-03-23 20:59:38] [INFO ] Deduced a trap composed of 323 places in 352 ms of which 1 ms to minimize.
[2023-03-23 20:59:40] [INFO ] Deduced a trap composed of 311 places in 347 ms of which 1 ms to minimize.
[2023-03-23 20:59:40] [INFO ] Deduced a trap composed of 326 places in 351 ms of which 1 ms to minimize.
[2023-03-23 20:59:41] [INFO ] Deduced a trap composed of 317 places in 357 ms of which 1 ms to minimize.
[2023-03-23 20:59:41] [INFO ] Deduced a trap composed of 314 places in 365 ms of which 1 ms to minimize.
[2023-03-23 20:59:42] [INFO ] Deduced a trap composed of 329 places in 340 ms of which 0 ms to minimize.
[2023-03-23 20:59:42] [INFO ] Deduced a trap composed of 317 places in 346 ms of which 1 ms to minimize.
[2023-03-23 20:59:43] [INFO ] Deduced a trap composed of 326 places in 355 ms of which 1 ms to minimize.
[2023-03-23 20:59:44] [INFO ] Deduced a trap composed of 329 places in 355 ms of which 1 ms to minimize.
[2023-03-23 20:59:45] [INFO ] Deduced a trap composed of 320 places in 352 ms of which 1 ms to minimize.
[2023-03-23 20:59:46] [INFO ] Deduced a trap composed of 317 places in 353 ms of which 1 ms to minimize.
[2023-03-23 20:59:49] [INFO ] Trap strengthening (SAT) tested/added 31/31 trap constraints in 20976 ms
[2023-03-23 20:59:50] [INFO ] [Real]Absence check using 170 positive place invariants in 41 ms returned sat
[2023-03-23 20:59:50] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2023-03-23 20:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 20:59:50] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2023-03-23 20:59:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 20:59:50] [INFO ] [Nat]Absence check using 170 positive place invariants in 40 ms returned sat
[2023-03-23 20:59:50] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 20:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 20:59:51] [INFO ] [Nat]Absence check using state equation in 612 ms returned sat
[2023-03-23 20:59:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 121 ms returned sat
[2023-03-23 20:59:51] [INFO ] Deduced a trap composed of 302 places in 359 ms of which 1 ms to minimize.
[2023-03-23 20:59:52] [INFO ] Deduced a trap composed of 317 places in 345 ms of which 0 ms to minimize.
[2023-03-23 20:59:52] [INFO ] Deduced a trap composed of 308 places in 351 ms of which 1 ms to minimize.
[2023-03-23 20:59:53] [INFO ] Deduced a trap composed of 302 places in 354 ms of which 1 ms to minimize.
[2023-03-23 20:59:53] [INFO ] Deduced a trap composed of 326 places in 342 ms of which 0 ms to minimize.
[2023-03-23 20:59:54] [INFO ] Deduced a trap composed of 344 places in 353 ms of which 1 ms to minimize.
[2023-03-23 20:59:54] [INFO ] Deduced a trap composed of 320 places in 363 ms of which 1 ms to minimize.
[2023-03-23 20:59:54] [INFO ] Deduced a trap composed of 320 places in 348 ms of which 1 ms to minimize.
[2023-03-23 20:59:55] [INFO ] Deduced a trap composed of 314 places in 350 ms of which 1 ms to minimize.
[2023-03-23 20:59:55] [INFO ] Deduced a trap composed of 329 places in 372 ms of which 1 ms to minimize.
[2023-03-23 20:59:56] [INFO ] Deduced a trap composed of 326 places in 347 ms of which 1 ms to minimize.
[2023-03-23 20:59:56] [INFO ] Deduced a trap composed of 308 places in 371 ms of which 1 ms to minimize.
[2023-03-23 20:59:57] [INFO ] Deduced a trap composed of 329 places in 366 ms of which 1 ms to minimize.
[2023-03-23 20:59:57] [INFO ] Deduced a trap composed of 323 places in 383 ms of which 1 ms to minimize.
[2023-03-23 20:59:58] [INFO ] Deduced a trap composed of 308 places in 359 ms of which 1 ms to minimize.
[2023-03-23 20:59:58] [INFO ] Deduced a trap composed of 323 places in 354 ms of which 2 ms to minimize.
[2023-03-23 20:59:59] [INFO ] Deduced a trap composed of 311 places in 366 ms of which 1 ms to minimize.
[2023-03-23 21:00:00] [INFO ] Deduced a trap composed of 314 places in 398 ms of which 1 ms to minimize.
[2023-03-23 21:00:00] [INFO ] Deduced a trap composed of 320 places in 390 ms of which 1 ms to minimize.
[2023-03-23 21:00:00] [INFO ] Deduced a trap composed of 332 places in 351 ms of which 0 ms to minimize.
[2023-03-23 21:00:01] [INFO ] Deduced a trap composed of 332 places in 360 ms of which 1 ms to minimize.
[2023-03-23 21:00:01] [INFO ] Deduced a trap composed of 305 places in 344 ms of which 1 ms to minimize.
[2023-03-23 21:00:02] [INFO ] Deduced a trap composed of 320 places in 354 ms of which 1 ms to minimize.
[2023-03-23 21:00:02] [INFO ] Deduced a trap composed of 329 places in 359 ms of which 1 ms to minimize.
[2023-03-23 21:00:02] [INFO ] Deduced a trap composed of 320 places in 335 ms of which 0 ms to minimize.
[2023-03-23 21:00:03] [INFO ] Deduced a trap composed of 326 places in 353 ms of which 1 ms to minimize.
[2023-03-23 21:00:04] [INFO ] Deduced a trap composed of 308 places in 361 ms of which 1 ms to minimize.
[2023-03-23 21:00:04] [INFO ] Deduced a trap composed of 332 places in 346 ms of which 1 ms to minimize.
[2023-03-23 21:00:05] [INFO ] Deduced a trap composed of 329 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:00:05] [INFO ] Deduced a trap composed of 314 places in 351 ms of which 1 ms to minimize.
[2023-03-23 21:00:06] [INFO ] Deduced a trap composed of 305 places in 360 ms of which 1 ms to minimize.
[2023-03-23 21:00:06] [INFO ] Deduced a trap composed of 332 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:00:07] [INFO ] Deduced a trap composed of 320 places in 354 ms of which 1 ms to minimize.
[2023-03-23 21:00:07] [INFO ] Deduced a trap composed of 329 places in 348 ms of which 1 ms to minimize.
[2023-03-23 21:00:07] [INFO ] Deduced a trap composed of 326 places in 351 ms of which 1 ms to minimize.
[2023-03-23 21:00:08] [INFO ] Deduced a trap composed of 317 places in 347 ms of which 1 ms to minimize.
[2023-03-23 21:00:08] [INFO ] Deduced a trap composed of 335 places in 350 ms of which 1 ms to minimize.
[2023-03-23 21:00:09] [INFO ] Deduced a trap composed of 314 places in 361 ms of which 4 ms to minimize.
[2023-03-23 21:00:09] [INFO ] Deduced a trap composed of 335 places in 344 ms of which 1 ms to minimize.
[2023-03-23 21:00:10] [INFO ] Deduced a trap composed of 344 places in 353 ms of which 1 ms to minimize.
[2023-03-23 21:00:11] [INFO ] Deduced a trap composed of 317 places in 348 ms of which 1 ms to minimize.
[2023-03-23 21:00:12] [INFO ] Deduced a trap composed of 308 places in 361 ms of which 1 ms to minimize.
[2023-03-23 21:00:13] [INFO ] Deduced a trap composed of 314 places in 347 ms of which 0 ms to minimize.
[2023-03-23 21:00:15] [INFO ] Deduced a trap composed of 299 places in 329 ms of which 1 ms to minimize.
[2023-03-23 21:00:17] [INFO ] Deduced a trap composed of 347 places in 374 ms of which 0 ms to minimize.
[2023-03-23 21:00:20] [INFO ] Deduced a trap composed of 329 places in 357 ms of which 1 ms to minimize.
[2023-03-23 21:00:21] [INFO ] Deduced a trap composed of 323 places in 354 ms of which 1 ms to minimize.
[2023-03-23 21:00:24] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 33349 ms
Current structural bounds on expressions (after SMT) : [4, 10] Max seen :[3, 3]
Support contains 2 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 39 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 37 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-23 21:00:25] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 21:00:25] [INFO ] Invariant cache hit.
[2023-03-23 21:00:26] [INFO ] Implicit Places using invariants in 1294 ms returned []
[2023-03-23 21:00:26] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 21:00:26] [INFO ] Invariant cache hit.
[2023-03-23 21:00:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:00:32] [INFO ] Implicit Places using invariants and state equation in 5955 ms returned []
Implicit Place search using SMT with State Equation took 7252 ms to find 0 implicit places.
[2023-03-23 21:00:32] [INFO ] Redundant transitions in 87 ms returned []
[2023-03-23 21:00:32] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 21:00:32] [INFO ] Invariant cache hit.
[2023-03-23 21:00:33] [INFO ] Dead Transitions using invariants and state equation in 1213 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8599 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-01
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 21:00:33] [INFO ] Computed 177 place invariants in 29 ms
Incomplete random walk after 10001 steps, including 485 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :3
[2023-03-23 21:00:33] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 21:00:33] [INFO ] Computed 177 place invariants in 30 ms
[2023-03-23 21:00:33] [INFO ] [Real]Absence check using 170 positive place invariants in 41 ms returned sat
[2023-03-23 21:00:33] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-23 21:00:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:34] [INFO ] [Real]Absence check using state equation in 463 ms returned sat
[2023-03-23 21:00:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:00:34] [INFO ] [Nat]Absence check using 170 positive place invariants in 41 ms returned sat
[2023-03-23 21:00:34] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 19 ms returned sat
[2023-03-23 21:00:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:35] [INFO ] [Nat]Absence check using state equation in 488 ms returned sat
[2023-03-23 21:00:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:00:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 571 ms returned sat
[2023-03-23 21:00:36] [INFO ] Deduced a trap composed of 320 places in 377 ms of which 1 ms to minimize.
[2023-03-23 21:00:36] [INFO ] Deduced a trap composed of 305 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:00:36] [INFO ] Deduced a trap composed of 326 places in 366 ms of which 1 ms to minimize.
[2023-03-23 21:00:37] [INFO ] Deduced a trap composed of 314 places in 373 ms of which 1 ms to minimize.
[2023-03-23 21:00:37] [INFO ] Deduced a trap composed of 314 places in 364 ms of which 1 ms to minimize.
[2023-03-23 21:00:38] [INFO ] Deduced a trap composed of 323 places in 372 ms of which 1 ms to minimize.
[2023-03-23 21:00:38] [INFO ] Deduced a trap composed of 317 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:00:39] [INFO ] Deduced a trap composed of 323 places in 358 ms of which 1 ms to minimize.
0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
[2023-03-23 21:00:40] [INFO ] Deduced a trap composed of 7 places in 549 ms of which 1 ms to minimize.
[2023-03-23 21:00:40] [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.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: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) : [4] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1011 transition count 1426
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1010 transition count 1426
Applied a total of 2 rules in 50 ms. Remains 1010 /1011 variables (removed 1) and now considering 1426/1427 (removed 1) transitions.
[2023-03-23 21:00:40] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-23 21:00:40] [INFO ] Computed 177 place invariants in 27 ms
[2023-03-23 21:00:41] [INFO ] Dead Transitions using invariants and state equation in 1092 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1144 ms. Remains : 1010/1011 places, 1426/1427 transitions.
Normalized transition count is 1422 out of 1426 initially.
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-23 21:00:41] [INFO ] Computed 177 place invariants in 29 ms
Incomplete random walk after 1000000 steps, including 52094 resets, run finished after 7315 ms. (steps per millisecond=136 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2765 resets, run finished after 1595 ms. (steps per millisecond=626 ) properties (out of 1) seen :3
[2023-03-23 21:00:50] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
// Phase 1: matrix 1422 rows 1010 cols
[2023-03-23 21:00:50] [INFO ] Computed 177 place invariants in 40 ms
[2023-03-23 21:00:50] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2023-03-23 21:00:50] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-23 21:00:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:50] [INFO ] [Real]Absence check using state equation in 460 ms returned sat
[2023-03-23 21:00:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:00:51] [INFO ] [Nat]Absence check using 170 positive place invariants in 41 ms returned sat
[2023-03-23 21:00:51] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 25 ms returned sat
[2023-03-23 21:00:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:00:51] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2023-03-23 21:00:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:00:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 295 ms returned sat
[2023-03-23 21:00:52] [INFO ] Deduced a trap composed of 326 places in 363 ms of which 1 ms to minimize.
[2023-03-23 21:00:52] [INFO ] Deduced a trap composed of 305 places in 364 ms of which 1 ms to minimize.
[2023-03-23 21:00:53] [INFO ] Deduced a trap composed of 329 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:00:53] [INFO ] Deduced a trap composed of 329 places in 362 ms of which 1 ms to minimize.
[2023-03-23 21:00:54] [INFO ] Deduced a trap composed of 326 places in 363 ms of which 1 ms to minimize.
[2023-03-23 21:00:54] [INFO ] Deduced a trap composed of 323 places in 332 ms of which 1 ms to minimize.
[2023-03-23 21:00:54] [INFO ] Deduced a trap composed of 332 places in 364 ms of which 0 ms to minimize.
[2023-03-23 21:00:55] [INFO ] Deduced a trap composed of 293 places in 363 ms of which 1 ms to minimize.
[2023-03-23 21:00:55] [INFO ] Deduced a trap composed of 326 places in 358 ms of which 1 ms to minimize.
[2023-03-23 21:00:56] [INFO ] Deduced a trap composed of 338 places in 369 ms of which 1 ms to minimize.
[2023-03-23 21:00:56] [INFO ] Deduced a trap composed of 326 places in 375 ms of which 1 ms to minimize.
[2023-03-23 21:00:57] [INFO ] Deduced a trap composed of 314 places in 379 ms of which 1 ms to minimize.
[2023-03-23 21:00:58] [INFO ] Deduced a trap composed of 332 places in 339 ms of which 1 ms to minimize.
[2023-03-23 21:00:58] [INFO ] Deduced a trap composed of 305 places in 355 ms of which 1 ms to minimize.
[2023-03-23 21:00:59] [INFO ] Deduced a trap composed of 320 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:00:59] [INFO ] Deduced a trap composed of 323 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:01:00] [INFO ] Deduced a trap composed of 329 places in 370 ms of which 1 ms to minimize.
[2023-03-23 21:01:00] [INFO ] Deduced a trap composed of 329 places in 363 ms of which 1 ms to minimize.
[2023-03-23 21:01:01] [INFO ] Deduced a trap composed of 326 places in 354 ms of which 0 ms to minimize.
[2023-03-23 21:01:01] [INFO ] Deduced a trap composed of 308 places in 355 ms of which 1 ms to minimize.
[2023-03-23 21:01:02] [INFO ] Deduced a trap composed of 317 places in 353 ms of which 1 ms to minimize.
[2023-03-23 21:01:02] [INFO ] Deduced a trap composed of 329 places in 357 ms of which 1 ms to minimize.
[2023-03-23 21:01:02] [INFO ] Deduced a trap composed of 329 places in 359 ms of which 1 ms to minimize.
[2023-03-23 21:01:03] [INFO ] Deduced a trap composed of 314 places in 364 ms of which 1 ms to minimize.
[2023-03-23 21:01:04] [INFO ] Deduced a trap composed of 317 places in 353 ms of which 1 ms to minimize.
[2023-03-23 21:01:04] [INFO ] Deduced a trap composed of 323 places in 361 ms of which 1 ms to minimize.
[2023-03-23 21:01:05] [INFO ] Deduced a trap composed of 356 places in 362 ms of which 1 ms to minimize.
[2023-03-23 21:01:05] [INFO ] Deduced a trap composed of 326 places in 358 ms of which 1 ms to minimize.
[2023-03-23 21:01:06] [INFO ] Deduced a trap composed of 335 places in 374 ms of which 0 ms to minimize.
[2023-03-23 21:01:06] [INFO ] Deduced a trap composed of 324 places in 386 ms of which 1 ms to minimize.
[2023-03-23 21:01:07] [INFO ] Deduced a trap composed of 323 places in 363 ms of which 1 ms to minimize.
[2023-03-23 21:01:08] [INFO ] Deduced a trap composed of 314 places in 360 ms of which 1 ms to minimize.
[2023-03-23 21:01:09] [INFO ] Deduced a trap composed of 329 places in 363 ms of which 1 ms to minimize.
[2023-03-23 21:01:09] [INFO ] Deduced a trap composed of 332 places in 350 ms of which 1 ms to minimize.
[2023-03-23 21:01:10] [INFO ] Deduced a trap composed of 305 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:01:10] [INFO ] Deduced a trap composed of 299 places in 370 ms of which 1 ms to minimize.
[2023-03-23 21:01:11] [INFO ] Deduced a trap composed of 314 places in 361 ms of which 0 ms to minimize.
[2023-03-23 21:01:12] [INFO ] Deduced a trap composed of 305 places in 362 ms of which 1 ms to minimize.
[2023-03-23 21:01:12] [INFO ] Deduced a trap composed of 329 places in 356 ms of which 0 ms to minimize.
[2023-03-23 21:01:13] [INFO ] Deduced a trap composed of 314 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:01:13] [INFO ] Deduced a trap composed of 332 places in 361 ms of which 1 ms to minimize.
[2023-03-23 21:01:15] [INFO ] Deduced a trap composed of 320 places in 398 ms of which 1 ms to minimize.
[2023-03-23 21:01:16] [INFO ] Deduced a trap composed of 302 places in 357 ms of which 1 ms to minimize.
[2023-03-23 21:01:20] [INFO ] Deduced a trap composed of 338 places in 372 ms of which 1 ms to minimize.
[2023-03-23 21:01:21] [INFO ] Deduced a trap composed of 311 places in 366 ms of which 1 ms to minimize.
[2023-03-23 21:01:21] [INFO ] Deduced a trap composed of 311 places in 350 ms of which 1 ms to minimize.
[2023-03-23 21:01:24] [INFO ] Trap strengthening (SAT) tested/added 46/46 trap constraints in 32885 ms
Current structural bounds on expressions (after SMT) : [4] Max seen :[3]
Support contains 1 out of 1010 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 35 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1010/1010 places, 1426/1426 transitions.
Applied a total of 0 rules in 34 ms. Remains 1010 /1010 variables (removed 0) and now considering 1426/1426 (removed 0) transitions.
[2023-03-23 21:01:24] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 21:01:24] [INFO ] Invariant cache hit.
[2023-03-23 21:01:26] [INFO ] Implicit Places using invariants in 1436 ms returned []
[2023-03-23 21:01:26] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 21:01:26] [INFO ] Invariant cache hit.
[2023-03-23 21:01:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:01:31] [INFO ] Implicit Places using invariants and state equation in 5584 ms returned []
Implicit Place search using SMT with State Equation took 7026 ms to find 0 implicit places.
[2023-03-23 21:01:31] [INFO ] Redundant transitions in 71 ms returned []
[2023-03-23 21:01:31] [INFO ] Flow matrix only has 1422 transitions (discarded 4 similar events)
[2023-03-23 21:01:31] [INFO ] Invariant cache hit.
[2023-03-23 21:01:33] [INFO ] Dead Transitions using invariants and state equation in 1166 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8305 ms. Remains : 1010/1010 places, 1426/1426 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-01 in 59462 ms.
Starting property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-07
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 21:01:33] [INFO ] Computed 177 place invariants in 27 ms
Incomplete random walk after 10000 steps, including 477 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :3
[2023-03-23 21:01:33] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 21:01:33] [INFO ] Computed 177 place invariants in 26 ms
[2023-03-23 21:01:33] [INFO ] [Real]Absence check using 170 positive place invariants in 41 ms returned sat
[2023-03-23 21:01:33] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2023-03-23 21:01:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:01:33] [INFO ] [Real]Absence check using state equation in 480 ms returned sat
[2023-03-23 21:01:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:01:34] [INFO ] [Nat]Absence check using 170 positive place invariants in 37 ms returned sat
[2023-03-23 21:01:34] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 21:01:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:01:34] [INFO ] [Nat]Absence check using state equation in 637 ms returned sat
[2023-03-23 21:01:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:01:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 121 ms returned sat
[2023-03-23 21:01:35] [INFO ] Deduced a trap composed of 302 places in 374 ms of which 1 ms to minimize.
[2023-03-23 21:01:35] [INFO ] Deduced a trap composed of 317 places in 361 ms of which 1 ms to minimize.
[2023-03-23 21:01:36] [INFO ] Deduced a trap composed of 308 places in 353 ms of which 1 ms to minimize.
[2023-03-23 21:01:36] [INFO ] Deduced a trap composed of 302 places in 358 ms of which 1 ms to minimize.
[2023-03-23 21:01:36] [INFO ] Deduced a trap composed of 326 places in 344 ms of which 1 ms to minimize.
[2023-03-23 21:01:37] [INFO ] Deduced a trap composed of 344 places in 345 ms of which 0 ms to minimize.
[2023-03-23 21:01:37] [INFO ] Deduced a trap composed of 320 places in 335 ms of which 1 ms to minimize.
[2023-03-23 21:01:38] [INFO ] Deduced a trap composed of 320 places in 347 ms of which 1 ms to minimize.
[2023-03-23 21:01:38] [INFO ] Deduced a trap composed of 314 places in 353 ms of which 1 ms to minimize.
[2023-03-23 21:01:39] [INFO ] Deduced a trap composed of 329 places in 358 ms of which 1 ms to minimize.
[2023-03-23 21:01: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 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.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: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) : [10] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 39 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-23 21:01:39] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 21:01:39] [INFO ] Invariant cache hit.
[2023-03-23 21:01:40] [INFO ] Dead Transitions using invariants and state equation in 1007 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1047 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Normalized transition count is 1423 out of 1427 initially.
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 21:01:40] [INFO ] Computed 177 place invariants in 26 ms
Incomplete random walk after 1000000 steps, including 47348 resets, run finished after 6806 ms. (steps per millisecond=146 ) properties (out of 1) seen :3
Incomplete Best-First random walk after 1000001 steps, including 2768 resets, run finished after 1571 ms. (steps per millisecond=636 ) properties (out of 1) seen :3
[2023-03-23 21:01:48] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
// Phase 1: matrix 1423 rows 1011 cols
[2023-03-23 21:01:48] [INFO ] Computed 177 place invariants in 35 ms
[2023-03-23 21:01:48] [INFO ] [Real]Absence check using 170 positive place invariants in 39 ms returned sat
[2023-03-23 21:01:48] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 23 ms returned sat
[2023-03-23 21:01:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 21:01:49] [INFO ] [Real]Absence check using state equation in 472 ms returned sat
[2023-03-23 21:01:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 21:01:49] [INFO ] [Nat]Absence check using 170 positive place invariants in 39 ms returned sat
[2023-03-23 21:01:49] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 22 ms returned sat
[2023-03-23 21:01:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 21:01:50] [INFO ] [Nat]Absence check using state equation in 608 ms returned sat
[2023-03-23 21:01:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:01:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 121 ms returned sat
[2023-03-23 21:01:50] [INFO ] Deduced a trap composed of 302 places in 364 ms of which 1 ms to minimize.
[2023-03-23 21:01:51] [INFO ] Deduced a trap composed of 317 places in 362 ms of which 1 ms to minimize.
[2023-03-23 21:01:51] [INFO ] Deduced a trap composed of 308 places in 362 ms of which 1 ms to minimize.
[2023-03-23 21:01:51] [INFO ] Deduced a trap composed of 302 places in 361 ms of which 1 ms to minimize.
[2023-03-23 21:01:52] [INFO ] Deduced a trap composed of 326 places in 372 ms of which 1 ms to minimize.
[2023-03-23 21:01:52] [INFO ] Deduced a trap composed of 344 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:01:53] [INFO ] Deduced a trap composed of 320 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:01:53] [INFO ] Deduced a trap composed of 320 places in 355 ms of which 1 ms to minimize.
[2023-03-23 21:01:54] [INFO ] Deduced a trap composed of 314 places in 366 ms of which 1 ms to minimize.
[2023-03-23 21:01:54] [INFO ] Deduced a trap composed of 329 places in 362 ms of which 2 ms to minimize.
[2023-03-23 21:01:55] [INFO ] Deduced a trap composed of 326 places in 358 ms of which 1 ms to minimize.
[2023-03-23 21:01:55] [INFO ] Deduced a trap composed of 308 places in 367 ms of which 0 ms to minimize.
[2023-03-23 21:01:56] [INFO ] Deduced a trap composed of 329 places in 355 ms of which 1 ms to minimize.
[2023-03-23 21:01:56] [INFO ] Deduced a trap composed of 323 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:01:57] [INFO ] Deduced a trap composed of 308 places in 367 ms of which 1 ms to minimize.
[2023-03-23 21:01:57] [INFO ] Deduced a trap composed of 323 places in 355 ms of which 1 ms to minimize.
[2023-03-23 21:01:58] [INFO ] Deduced a trap composed of 311 places in 359 ms of which 3 ms to minimize.
[2023-03-23 21:01:58] [INFO ] Deduced a trap composed of 314 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:01:59] [INFO ] Deduced a trap composed of 320 places in 362 ms of which 1 ms to minimize.
[2023-03-23 21:01:59] [INFO ] Deduced a trap composed of 332 places in 367 ms of which 1 ms to minimize.
[2023-03-23 21:02:00] [INFO ] Deduced a trap composed of 332 places in 361 ms of which 1 ms to minimize.
[2023-03-23 21:02:00] [INFO ] Deduced a trap composed of 305 places in 365 ms of which 0 ms to minimize.
[2023-03-23 21:02:00] [INFO ] Deduced a trap composed of 320 places in 359 ms of which 1 ms to minimize.
[2023-03-23 21:02:01] [INFO ] Deduced a trap composed of 329 places in 359 ms of which 1 ms to minimize.
[2023-03-23 21:02:01] [INFO ] Deduced a trap composed of 320 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:02:02] [INFO ] Deduced a trap composed of 326 places in 372 ms of which 1 ms to minimize.
[2023-03-23 21:02:03] [INFO ] Deduced a trap composed of 308 places in 373 ms of which 1 ms to minimize.
[2023-03-23 21:02:03] [INFO ] Deduced a trap composed of 332 places in 373 ms of which 1 ms to minimize.
[2023-03-23 21:02:04] [INFO ] Deduced a trap composed of 329 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:02:04] [INFO ] Deduced a trap composed of 314 places in 352 ms of which 1 ms to minimize.
[2023-03-23 21:02:05] [INFO ] Deduced a trap composed of 305 places in 356 ms of which 1 ms to minimize.
[2023-03-23 21:02:05] [INFO ] Deduced a trap composed of 332 places in 362 ms of which 0 ms to minimize.
[2023-03-23 21:02:05] [INFO ] Deduced a trap composed of 320 places in 355 ms of which 1 ms to minimize.
[2023-03-23 21:02:06] [INFO ] Deduced a trap composed of 329 places in 354 ms of which 1 ms to minimize.
[2023-03-23 21:02:06] [INFO ] Deduced a trap composed of 326 places in 394 ms of which 1 ms to minimize.
[2023-03-23 21:02:07] [INFO ] Deduced a trap composed of 317 places in 392 ms of which 1 ms to minimize.
[2023-03-23 21:02:07] [INFO ] Deduced a trap composed of 335 places in 394 ms of which 1 ms to minimize.
[2023-03-23 21:02:08] [INFO ] Deduced a trap composed of 314 places in 397 ms of which 1 ms to minimize.
[2023-03-23 21:02:09] [INFO ] Deduced a trap composed of 335 places in 360 ms of which 1 ms to minimize.
[2023-03-23 21:02:09] [INFO ] Deduced a trap composed of 344 places in 364 ms of which 1 ms to minimize.
[2023-03-23 21:02:10] [INFO ] Deduced a trap composed of 317 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:02:11] [INFO ] Deduced a trap composed of 308 places in 388 ms of which 1 ms to minimize.
[2023-03-23 21:02:12] [INFO ] Deduced a trap composed of 314 places in 415 ms of which 1 ms to minimize.
[2023-03-23 21:02:14] [INFO ] Deduced a trap composed of 299 places in 417 ms of which 1 ms to minimize.
[2023-03-23 21:02:17] [INFO ] Deduced a trap composed of 347 places in 392 ms of which 1 ms to minimize.
[2023-03-23 21:02:20] [INFO ] Deduced a trap composed of 329 places in 373 ms of which 1 ms to minimize.
[2023-03-23 21:02:21] [INFO ] Deduced a trap composed of 323 places in 368 ms of which 1 ms to minimize.
[2023-03-23 21:02:24] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 34181 ms
Current structural bounds on expressions (after SMT) : [10] Max seen :[3]
Support contains 1 out of 1011 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 50 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1011/1011 places, 1427/1427 transitions.
Applied a total of 0 rules in 34 ms. Remains 1011 /1011 variables (removed 0) and now considering 1427/1427 (removed 0) transitions.
[2023-03-23 21:02:24] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 21:02:24] [INFO ] Invariant cache hit.
[2023-03-23 21:02:25] [INFO ] Implicit Places using invariants in 1404 ms returned []
[2023-03-23 21:02:25] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 21:02:25] [INFO ] Invariant cache hit.
[2023-03-23 21:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-23 21:02:31] [INFO ] Implicit Places using invariants and state equation in 6012 ms returned []
Implicit Place search using SMT with State Equation took 7422 ms to find 0 implicit places.
[2023-03-23 21:02:31] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-23 21:02:31] [INFO ] Flow matrix only has 1423 transitions (discarded 4 similar events)
[2023-03-23 21:02:31] [INFO ] Invariant cache hit.
[2023-03-23 21:02:33] [INFO ] Dead Transitions using invariants and state equation in 1119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8606 ms. Remains : 1011/1011 places, 1427/1427 transitions.
Ending property specific reduction for PolyORBNT-COL-S05J80-UpperBounds-07 in 60030 ms.
[2023-03-23 21:02:33] [INFO ] Flatten gal took : 176 ms
[2023-03-23 21:02:33] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-23 21:02:33] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1011 places, 1427 transitions and 7211 arcs took 9 ms.
Total runtime 296157 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --maxsum=/tmp/1551/ub_0_ --maxsum=/tmp/1551/ub_1_
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 15125956 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16095204 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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
mcc2023
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="PolyORBNT-COL-S05J80"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is PolyORBNT-COL-S05J80, 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 r297-tall-167873950800669"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 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 '
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 ;