About the Execution of GreatSPN+red for PolyORBNT-COL-S10J60
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15153.972 | 3600000.00 | 9080898.00 | 586.60 | 4 4 1 1 4 1 3 10 1 4 ? 1 4 4 1 ? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r289-tajo-171654445900429.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is PolyORBNT-COL-S10J60, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r289-tajo-171654445900429
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 604K
-rw-r--r-- 1 mcc users 7.6K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 12 10:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 10:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 94K May 18 16:43 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-S10J60-UpperBounds-00
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-01
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-02
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-03
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-04
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-05
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-06
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-07
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-08
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-09
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-10
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-11
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-12
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-13
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-14
FORMULA_NAME PolyORBNT-COL-S10J60-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1716882787237
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J60
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:53:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-28 07:53:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:53:09] [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.
[2024-05-28 07:53:09] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 07:53:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 783 ms
[2024-05-28 07:53:09] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1294 PT places and 13102.0 transition bindings in 38 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
[2024-05-28 07:53:10] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 19 ms.
[2024-05-28 07:53:10] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 38 rows 48 cols
[2024-05-28 07:53:10] [INFO ] Computed 13 invariants in 15 ms
Current structural bounds on expressions (after Invariants on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 10, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[10, 10, +inf, +inf, 4, 1, 3, 10, +inf, 10, 10, +inf, 10, 10, +inf, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-07 10 TECHNIQUES TOPOLOGICAL CPN_APPROX INITIAL_STATE
[2024-05-28 07:53:10] [INFO ] Invariant cache hit.
[2024-05-28 07:53:10] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-28 07:53:10] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-28 07:53:10] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-28 07:53:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:53:10] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:53:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:10] [INFO ] [Nat]Absence check using 6 positive place invariants in 4 ms returned sat
[2024-05-28 07:53:10] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-28 07:53:10] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-28 07:53:10] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:10] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 11 ms to minimize.
[2024-05-28 07:53:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2024-05-28 07:53:10] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 07:53:11] [INFO ] Added : 21 causal constraints over 5 iterations in 333 ms. Result :sat
Minimization took 113 ms.
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:11] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:53:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-28 07:53:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:11] [INFO ] Deduced a trap composed of 25 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:53:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-28 07:53:11] [INFO ] Added : 36 causal constraints over 8 iterations in 93 ms. Result :sat
Minimization took 100 ms.
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-28 07:53:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:11] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
[2024-05-28 07:53:11] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2024-05-28 07:53:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 81 ms
[2024-05-28 07:53:11] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-28 07:53:11] [INFO ] Deduced a trap composed of 25 places in 39 ms of which 1 ms to minimize.
[2024-05-28 07:53:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
[2024-05-28 07:53:11] [INFO ] Added : 36 causal constraints over 8 iterations in 103 ms. Result :sat
Minimization took 29 ms.
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 07:53:11] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:53:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:12] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 19 ms.
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:12] [INFO ] Deduced a trap composed of 14 places in 30 ms of which 1 ms to minimize.
[2024-05-28 07:53:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-28 07:53:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:53:12] [INFO ] Added : 20 causal constraints over 4 iterations in 197 ms. Result :sat
Minimization took 57 ms.
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:12] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:12] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-05-28 07:53:12] [INFO ] Deduced a trap composed of 25 places in 26 ms of which 0 ms to minimize.
[2024-05-28 07:53:12] [INFO ] Deduced a trap composed of 11 places in 25 ms of which 0 ms to minimize.
[2024-05-28 07:53:12] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 107 ms
[2024-05-28 07:53:12] [INFO ] Added : 36 causal constraints over 8 iterations in 157 ms. Result :sat
Minimization took 37 ms.
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 07:53:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 07:53:12] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:53:12] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2024-05-28 07:53:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-28 07:53:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:13] [INFO ] Added : 22 causal constraints over 5 iterations in 221 ms. Result :sat
Minimization took 62 ms.
[2024-05-28 07:53:13] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-28 07:53:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:13] [INFO ] Added : 4 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 15 ms.
[2024-05-28 07:53:13] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-28 07:53:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:13] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-28 07:53:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-28 07:53:13] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 1 ms to minimize.
[2024-05-28 07:53:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 35 ms
[2024-05-28 07:53:13] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:14] [INFO ] Added : 15 causal constraints over 3 iterations in 541 ms. Result :sat
Minimization took 133 ms.
[2024-05-28 07:53:14] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:14] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:53:14] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-28 07:53:14] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:14] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:53:14] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-28 07:53:14] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-28 07:53:14] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:14] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:53:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 41 ms
[2024-05-28 07:53:14] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-28 07:53:14] [INFO ] Added : 23 causal constraints over 5 iterations in 321 ms. Result :sat
Minimization took 238 ms.
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-28 07:53:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 3 ms returned sat
[2024-05-28 07:53:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:53:15] [INFO ] Added : 36 causal constraints over 8 iterations in 41 ms. Result :sat
Minimization took 43 ms.
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 3 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:15] [INFO ] Added : 21 causal constraints over 5 iterations in 310 ms. Result :sat
Minimization took 86 ms.
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-28 07:53:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:15] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-28 07:53:15] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
[2024-05-28 07:53:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-28 07:53:15] [INFO ] Added : 36 causal constraints over 8 iterations in 95 ms. Result :sat
Minimization took 149 ms.
[2024-05-28 07:53:16] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-28 07:53:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned unsat
[2024-05-28 07:53:16] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:16] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:16] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-28 07:53:16] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:16] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-28 07:53:16] [INFO ] [Nat]Absence check using 6 positive and 7 generalized place invariants in 2 ms returned sat
[2024-05-28 07:53:16] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-28 07:53:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-28 07:53:16] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 1 ms to minimize.
[2024-05-28 07:53:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 304 ms
[2024-05-28 07:53:16] [INFO ] Computed and/alt/rep : 36/66/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-28 07:53:16] [INFO ] Added : 11 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 84 ms.
Current structural bounds on expressions (after SMT on skeleton) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 0] Max Struct:[10, 10, +inf, +inf, 4, 1, 3, +inf, 10, 10, +inf, 10, 10, 1, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-14 1 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.
[2024-05-28 07:53:16] [INFO ] Unfolded HLPN to a Petri net with 1294 places and 12980 transitions 116999 arcs in 293 ms.
[2024-05-28 07:53:16] [INFO ] Unfolded 14 HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 33 ms
Reduce places removed 60 places and 60 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, +inf, +inf, 4, 1, 3, +inf, 10, 10, +inf, 10, 10, 10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, +inf, +inf, 4, 1, 3, +inf, 10, 10, +inf, 10, 10, 10]
[2024-05-28 07:53:17] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
// Phase 1: matrix 2801 rows 1234 cols
[2024-05-28 07:53:17] [INFO ] Computed 152 invariants in 233 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 62, 61, 4, 1, 3, 11, 10, 10, 244, 10, 10, 10]
RANDOM walk for 10000 steps (560 resets) in 426 ms. (23 steps per ms)
FORMULA PolyORBNT-COL-S10J60-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 130011 steps (1367 resets) in 807 ms. (160 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 62, 61, 4, 3, 11, 10, 10, 244, 10, 10, 10]
[2024-05-28 07:53:18] [INFO ] Flow matrix only has 2801 transitions (discarded 9 similar events)
[2024-05-28 07:53:18] [INFO ] Invariant cache hit.
[2024-05-28 07:53:18] [INFO ] [Real]Absence check using 145 positive place invariants in 49 ms returned sat
[2024-05-28 07:53:18] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned sat
[2024-05-28 07:53:20] [INFO ] [Real]Absence check using state equation in 1225 ms returned sat
[2024-05-28 07:53:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:20] [INFO ] [Nat]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-28 07:53:20] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-28 07:53:21] [INFO ] [Nat]Absence check using state equation in 1233 ms returned sat
[2024-05-28 07:53:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:53:22] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:53:22] [INFO ] [Nat]Added 1 Read/Feed constraints in 713 ms returned sat
[2024-05-28 07:53:23] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 505 ms.
[2024-05-28 07:53:23] [INFO ] Added : 6 causal constraints over 2 iterations in 1069 ms. Result :sat
Minimization took 737 ms.
[2024-05-28 07:53:24] [INFO ] [Real]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 07:53:24] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 35 ms returned sat
[2024-05-28 07:53:25] [INFO ] [Real]Absence check using state equation in 880 ms returned sat
[2024-05-28 07:53:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:25] [INFO ] [Nat]Absence check using 145 positive place invariants in 56 ms returned sat
[2024-05-28 07:53:25] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
[2024-05-28 07:53:27] [INFO ] [Nat]Absence check using state equation in 1337 ms returned sat
[2024-05-28 07:53:27] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:53:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1010 ms returned unknown
[2024-05-28 07:53:28] [INFO ] [Real]Absence check using 145 positive place invariants in 52 ms returned sat
[2024-05-28 07:53:28] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 42 ms returned sat
[2024-05-28 07:53:29] [INFO ] [Real]Absence check using state equation in 886 ms returned sat
[2024-05-28 07:53:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:29] [INFO ] [Nat]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-28 07:53:29] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-28 07:53:30] [INFO ] [Nat]Absence check using state equation in 1147 ms returned sat
[2024-05-28 07:53:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:53:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 777 ms returned sat
[2024-05-28 07:53:32] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 755 ms.
[2024-05-28 07:53:34] [INFO ] Deduced a trap composed of 19 places in 1007 ms of which 10 ms to minimize.
[2024-05-28 07:53:34] [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 2
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:299)
at fr.lip6.move.gal.structural.smt.SMTTrapUtils.refineWithTraps(SMTTrapUtils.java:177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1128)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:875)
at fr.lip6.move.gal.structural.smt.DeadlockTester.findStructuralMaxWithSMT(DeadlockTester.java:2251)
at fr.lip6.move.gal.application.solver.UpperBoundsSolver.applyReductions(UpperBoundsSolver.java:219)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:910)
at fr.lip6.move.gal.application.Application.start(Application.java:189)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
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:651)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:588)
at org.eclipse.equinox.launcher.Main.run(Main.java:1459)
at org.eclipse.equinox.launcher.Main.main(Main.java:1432)
[2024-05-28 07:53:35] [INFO ] [Real]Absence check using 145 positive place invariants in 52 ms returned sat
[2024-05-28 07:53:35] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 07:53:36] [INFO ] [Real]Absence check using state equation in 1139 ms returned sat
[2024-05-28 07:53:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:36] [INFO ] [Nat]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-28 07:53:36] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 34 ms returned sat
[2024-05-28 07:53:37] [INFO ] [Nat]Absence check using state equation in 1066 ms returned sat
[2024-05-28 07:53:38] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:53:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 1009 ms returned unknown
[2024-05-28 07:53:38] [INFO ] [Real]Absence check using 145 positive place invariants in 55 ms returned sat
[2024-05-28 07:53:38] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 39 ms returned sat
[2024-05-28 07:53:39] [INFO ] [Real]Absence check using state equation in 947 ms returned sat
[2024-05-28 07:53:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:40] [INFO ] [Nat]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 07:53:40] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned sat
[2024-05-28 07:53:41] [INFO ] [Nat]Absence check using state equation in 1440 ms returned sat
[2024-05-28 07:53:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-05-28 07:53:42] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 278 ms.
[2024-05-28 07:53:42] [INFO ] Added : 7 causal constraints over 3 iterations in 1001 ms. Result :sat
Minimization took 835 ms.
[2024-05-28 07:53:43] [INFO ] [Real]Absence check using 145 positive place invariants in 58 ms returned sat
[2024-05-28 07:53:43] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 43 ms returned sat
[2024-05-28 07:53:44] [INFO ] [Real]Absence check using state equation in 893 ms returned sat
[2024-05-28 07:53:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:45] [INFO ] [Nat]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 07:53:45] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned sat
[2024-05-28 07:53:47] [INFO ] [Nat]Absence check using state equation in 1853 ms returned unknown
[2024-05-28 07:53:47] [INFO ] [Real]Absence check using 145 positive place invariants in 56 ms returned sat
[2024-05-28 07:53:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 26 ms returned unsat
[2024-05-28 07:53:47] [INFO ] [Real]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 07:53:47] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 41 ms returned sat
[2024-05-28 07:53:48] [INFO ] [Real]Absence check using state equation in 1157 ms returned sat
[2024-05-28 07:53:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:49] [INFO ] [Nat]Absence check using 145 positive place invariants in 61 ms returned sat
[2024-05-28 07:53:49] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-28 07:53:51] [INFO ] [Nat]Absence check using state equation in 2288 ms returned unknown
[2024-05-28 07:53:51] [INFO ] [Real]Absence check using 145 positive place invariants in 55 ms returned sat
[2024-05-28 07:53:51] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 40 ms returned sat
[2024-05-28 07:53:52] [INFO ] [Real]Absence check using state equation in 1016 ms returned sat
[2024-05-28 07:53:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:53] [INFO ] [Nat]Absence check using 145 positive place invariants in 79 ms returned sat
[2024-05-28 07:53:53] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 44 ms returned sat
[2024-05-28 07:53:55] [INFO ] [Nat]Absence check using state equation in 1772 ms returned unknown
[2024-05-28 07:53:55] [INFO ] [Real]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 07:53:55] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 43 ms returned sat
[2024-05-28 07:53:56] [INFO ] [Real]Absence check using state equation in 1159 ms returned sat
[2024-05-28 07:53:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:53:56] [INFO ] [Nat]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 07:53:56] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 43 ms returned sat
[2024-05-28 07:53:57] [INFO ] [Nat]Absence check using state equation in 821 ms returned sat
[2024-05-28 07:53:58] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:53:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 973 ms returned sat
[2024-05-28 07:53:59] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 302 ms.
[2024-05-28 07:54:01] [INFO ] Deduced a trap composed of 19 places in 555 ms of which 3 ms to minimize.
[2024-05-28 07:54:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 824 ms
[2024-05-28 07:54:01] [INFO ] Added : 28 causal constraints over 6 iterations in 2614 ms. Result :sat
Minimization took 191 ms.
[2024-05-28 07:54:01] [INFO ] [Real]Absence check using 145 positive place invariants in 51 ms returned sat
[2024-05-28 07:54:02] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 07:54:03] [INFO ] [Real]Absence check using state equation in 1018 ms returned sat
[2024-05-28 07:54:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:54:03] [INFO ] [Nat]Absence check using 145 positive place invariants in 46 ms returned sat
[2024-05-28 07:54:03] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 22 ms returned sat
[2024-05-28 07:54:04] [INFO ] [Nat]Absence check using state equation in 1355 ms returned sat
[2024-05-28 07:54:05] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:54:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1008 ms returned unknown
[2024-05-28 07:54:06] [INFO ] [Real]Absence check using 145 positive place invariants in 54 ms returned sat
[2024-05-28 07:54:06] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 33 ms returned sat
[2024-05-28 07:54:07] [INFO ] [Real]Absence check using state equation in 1095 ms returned sat
[2024-05-28 07:54:07] [INFO ] [Real]Added 1 Read/Feed constraints in 143 ms returned sat
[2024-05-28 07:54:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:54:07] [INFO ] [Nat]Absence check using 145 positive place invariants in 53 ms returned sat
[2024-05-28 07:54:07] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 36 ms returned sat
[2024-05-28 07:54:08] [INFO ] [Nat]Absence check using state equation in 1100 ms returned sat
[2024-05-28 07:54:09] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 07:54:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 626 ms returned sat
[2024-05-28 07:54:10] [INFO ] Computed and/alt/rep : 1867/5523/1867 causal constraints (skipped 923 transitions) in 333 ms.
[2024-05-28 07:54:10] [INFO ] Added : 7 causal constraints over 2 iterations in 948 ms. Result :sat
Minimization took 938 ms.
[2024-05-28 07:54:11] [INFO ] [Real]Absence check using 145 positive place invariants in 48 ms returned sat
[2024-05-28 07:54:11] [INFO ] [Real]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2024-05-28 07:54:12] [INFO ] [Real]Absence check using state equation in 998 ms returned sat
[2024-05-28 07:54:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:54:13] [INFO ] [Nat]Absence check using 145 positive place invariants in 48 ms returned sat
[2024-05-28 07:54:13] [INFO ] [Nat]Absence check using 145 positive and 7 generalized place invariants in 32 ms returned sat
[2024-05-28 07:54:15] [INFO ] [Nat]Absence check using state equation in 1806 ms returned unknown
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 62, 61, 4, 3, 1, 10, 10, 244, 10, 10, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 62, 61, 4, 3, 10, 10, 244, 10, 10, 10]
Support contains 810 out of 1234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1234/1234 places, 2810/2810 transitions.
Ensure Unique test removed 10 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 1224 transition count 2806
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 19 place count 1220 transition count 2805
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 1219 transition count 2805
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 20 place count 1219 transition count 2741
Deduced a syphon composed of 64 places in 3 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 148 place count 1155 transition count 2741
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 1154 transition count 2740
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 1154 transition count 2740
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 3 with 4 rules applied. Total rules applied 154 place count 1152 transition count 2738
Applied a total of 154 rules in 586 ms. Remains 1152 /1234 variables (removed 82) and now considering 2738/2810 (removed 72) transitions.
Running 2727 sub problems to find dead transitions.
[2024-05-28 07:54:15] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
// Phase 1: matrix 2729 rows 1152 cols
[2024-05-28 07:54:15] [INFO ] Computed 142 invariants in 193 ms
[2024-05-28 07:54:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1142 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 2727 unsolved
SMT process timed out in 41965ms, After SMT, problems are : Problem set: 0 solved, 2727 unsolved
Search for dead transitions found 0 dead transitions in 42035ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42669 ms. Remains : 1152/1234 places, 2738/2810 transitions.
[2024-05-28 07:54:57] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
[2024-05-28 07:54:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[10, 10, 62, 61, 4, 3, 10, 10, 244, 10, 10, 10]
RANDOM walk for 1000000 steps (69095 resets) in 24416 ms. (40 steps per ms)
FORMULA PolyORBNT-COL-S10J60-UpperBounds-06 3 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 9431016 steps (62704 resets) in 38567 ms. (244 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[4, 4, 1, 1, 4, 3, 1, 4, 4, 3] Max Struct:[10, 10, 62, 61, 10, 10, 244, 10, 10, 10]
[2024-05-28 07:56:00] [INFO ] Flow matrix only has 2729 transitions (discarded 9 similar events)
[2024-05-28 07:56:00] [INFO ] Invariant cache hit.
[2024-05-28 07:56:00] [INFO ] [Real]Absence check using 136 positive place invariants in 37 ms returned sat
[2024-05-28 07:56:00] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 20 ms returned unsat
[2024-05-28 07:56:01] [INFO ] [Real]Absence check using 136 positive place invariants in 41 ms returned sat
[2024-05-28 07:56:01] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 23 ms returned sat
[2024-05-28 07:56:02] [INFO ] [Real]Absence check using state equation in 902 ms returned sat
[2024-05-28 07:56:02] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:56:02] [INFO ] [Nat]Absence check using 136 positive place invariants in 38 ms returned sat
[2024-05-28 07:56:02] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 22 ms returned sat
[2024-05-28 07:56:05] [INFO ] [Nat]Absence check using state equation in 2903 ms returned unsat
[2024-05-28 07:56:05] [INFO ] [Real]Absence check using 136 positive place invariants in 37 ms returned sat
[2024-05-28 07:56:05] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 22 ms returned unsat
[2024-05-28 07:56:05] [INFO ] [Real]Absence check using 136 positive place invariants in 39 ms returned sat
[2024-05-28 07:56:05] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 28 ms returned unsat
[2024-05-28 07:56:05] [INFO ] [Real]Absence check using 136 positive place invariants in 44 ms returned sat
[2024-05-28 07:56:05] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 25 ms returned unsat
[2024-05-28 07:56:06] [INFO ] [Real]Absence check using 136 positive place invariants in 37 ms returned sat
[2024-05-28 07:56:06] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 28 ms returned sat
[2024-05-28 07:56:06] [INFO ] [Real]Absence check using state equation in 744 ms returned sat
[2024-05-28 07:56:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:56:07] [INFO ] [Nat]Absence check using 136 positive place invariants in 38 ms returned sat
[2024-05-28 07:56:07] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 35 ms returned sat
[2024-05-28 07:56:08] [INFO ] [Nat]Absence check using state equation in 840 ms returned sat
[2024-05-28 07:56:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:56:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 655 ms returned sat
[2024-05-28 07:56:09] [INFO ] Computed and/alt/rep : 1796/5449/1796 causal constraints (skipped 922 transitions) in 261 ms.
[2024-05-28 07:56:10] [INFO ] Deduced a trap composed of 548 places in 782 ms of which 7 ms to minimize.
[2024-05-28 07:56:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1098 ms
[2024-05-28 07:56:11] [INFO ] Added : 10 causal constraints over 2 iterations in 2354 ms. Result :sat
Minimization took 3205 ms.
[2024-05-28 07:56:14] [INFO ] [Real]Absence check using 136 positive place invariants in 46 ms returned sat
[2024-05-28 07:56:14] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 26 ms returned unsat
[2024-05-28 07:56:14] [INFO ] [Real]Absence check using 136 positive place invariants in 36 ms returned sat
[2024-05-28 07:56:15] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 54 ms returned unsat
[2024-05-28 07:56:15] [INFO ] [Real]Absence check using 136 positive place invariants in 50 ms returned sat
[2024-05-28 07:56:15] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 18 ms returned sat
[2024-05-28 07:56:16] [INFO ] [Real]Absence check using state equation in 765 ms returned sat
[2024-05-28 07:56:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:56:16] [INFO ] [Nat]Absence check using 136 positive place invariants in 47 ms returned sat
[2024-05-28 07:56:16] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 17 ms returned sat
[2024-05-28 07:56:24] [INFO ] [Nat]Absence check using state equation in 8417 ms returned unsat
[2024-05-28 07:56:24] [INFO ] [Real]Absence check using 136 positive place invariants in 43 ms returned sat
[2024-05-28 07:56:24] [INFO ] [Real]Absence check using 136 positive and 6 generalized place invariants in 33 ms returned sat
[2024-05-28 07:56:25] [INFO ] [Real]Absence check using state equation in 810 ms returned sat
[2024-05-28 07:56:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:56:26] [INFO ] [Nat]Absence check using 136 positive place invariants in 37 ms returned sat
[2024-05-28 07:56:26] [INFO ] [Nat]Absence check using 136 positive and 6 generalized place invariants in 25 ms returned sat
[2024-05-28 07:56:27] [INFO ] [Nat]Absence check using state equation in 1201 ms returned sat
[2024-05-28 07:56:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 1016 ms returned sat
[2024-05-28 07:56:28] [INFO ] Computed and/alt/rep : 1796/5449/1796 causal constraints (skipped 922 transitions) in 244 ms.
[2024-05-28 07:56:29] [INFO ] Added : 6 causal constraints over 2 iterations in 1031 ms. Result :sat
Minimization took 3747 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[4, 4, 1, 1, 4, 3, 1, 4, 4, 3] Max Struct:[4, 4, 1, 1, 4, 10, 1, 4, 4, 10]
FORMULA PolyORBNT-COL-S10J60-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA PolyORBNT-COL-S10J60-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[10, 10]
Support contains 2 out of 1152 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1152/1152 places, 2738/2738 transitions.
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 61 Pre rules applied. Total rules applied 0 place count 1152 transition count 2677
Deduced a syphon composed of 61 places in 2 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 0 with 122 rules applied. Total rules applied 122 place count 1091 transition count 2677
Applied a total of 122 rules in 201 ms. Remains 1091 /1152 variables (removed 61) and now considering 2677/2738 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 201 ms. Remains : 1091/1152 places, 2677/2738 transitions.
[2024-05-28 07:56:33] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
// Phase 1: matrix 2668 rows 1091 cols
[2024-05-28 07:56:33] [INFO ] Computed 142 invariants in 118 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3, 3] Max Struct:[10, 10]
RANDOM walk for 1000000 steps (70485 resets) in 15013 ms. (66 steps per ms)
BEST_FIRST walk for 2000002 steps (14474 resets) in 5112 ms. (391 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3, 3] Max Struct:[10, 10]
[2024-05-28 07:56:53] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:56:53] [INFO ] Invariant cache hit.
[2024-05-28 07:56:54] [INFO ] [Real]Absence check using 135 positive place invariants in 36 ms returned sat
[2024-05-28 07:56:54] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 07:56:54] [INFO ] [Real]Absence check using state equation in 736 ms returned sat
[2024-05-28 07:56:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:56:55] [INFO ] [Nat]Absence check using 135 positive place invariants in 40 ms returned sat
[2024-05-28 07:56:55] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-28 07:56:56] [INFO ] [Nat]Absence check using state equation in 891 ms returned sat
[2024-05-28 07:56:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:56:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 701 ms returned sat
[2024-05-28 07:56:57] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 301 ms.
[2024-05-28 07:56:58] [INFO ] Added : 11 causal constraints over 3 iterations in 1744 ms. Result :sat
Minimization took 4560 ms.
[2024-05-28 07:57:03] [INFO ] [Real]Absence check using 135 positive place invariants in 40 ms returned sat
[2024-05-28 07:57:03] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-28 07:57:04] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2024-05-28 07:57:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 07:57:04] [INFO ] [Nat]Absence check using 135 positive place invariants in 41 ms returned sat
[2024-05-28 07:57:04] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 31 ms returned sat
[2024-05-28 07:57:05] [INFO ] [Nat]Absence check using state equation in 930 ms returned sat
[2024-05-28 07:57:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 812 ms returned sat
[2024-05-28 07:57:06] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 207 ms.
[2024-05-28 07:57:07] [INFO ] Added : 14 causal constraints over 4 iterations in 1152 ms. Result :sat
Minimization took 4509 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3, 3] Max Struct:[10, 10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3, 3] Max Struct:[10, 10]
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 95 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 81 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 07:57:12] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:57:12] [INFO ] Invariant cache hit.
[2024-05-28 07:57:13] [INFO ] Implicit Places using invariants in 1253 ms returned []
[2024-05-28 07:57:13] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:57:13] [INFO ] Invariant cache hit.
[2024-05-28 07:57:14] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:57:24] [INFO ] Implicit Places using invariants and state equation in 10806 ms returned []
Implicit Place search using SMT with State Equation took 12060 ms to find 0 implicit places.
[2024-05-28 07:57:24] [INFO ] Redundant transitions in 140 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 07:57:24] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:57:24] [INFO ] Invariant cache hit.
[2024-05-28 07:57:24] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 4.0)
(s380 4.0)
(s381 4.0)
(s382 4.0)
(s383 4.0)
(s384 4.0)
(s385 4.0)
(s386 4.0)
(s387 4.0)
(s388 4.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 1.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 1.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 1.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 1.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 1.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 1.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 1.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 1.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 1.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 1.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 1.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 1.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 1.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 1.0)
(s529 0.0)
(s530 1.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 1.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 1.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 1.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 1.0)
(s580 1.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 50380ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 50405ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62719 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2859 resets) in 1495 ms. (26 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (271 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (282 resets) in 293 ms. (136 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (280 resets) in 278 ms. (143 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (289 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 172840 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :0 out of 4
Probabilistic random walk after 172840 steps, saw 29513 distinct states, run finished after 3004 ms. (steps per millisecond=57 ) properties seen :0
[2024-05-28 07:58:18] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:58:18] [INFO ] Invariant cache hit.
[2024-05-28 07:58:18] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1357 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 2 solved, 2 unsolved in 3737 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 5125ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 83 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 84 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 07:58:24] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:58:24] [INFO ] Invariant cache hit.
[2024-05-28 07:58:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 40695ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 40729ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40826 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2818 resets) in 1229 ms. (32 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (335 resets) in 276 ms. (144 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (305 resets) in 200 ms. (199 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 195153 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :0 out of 2
Probabilistic random walk after 195153 steps, saw 32920 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
[2024-05-28 07:59:08] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:59:08] [INFO ] Invariant cache hit.
[2024-05-28 07:59:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1377 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 136/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/3759 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 1/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3759 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3759 variables, 0/1236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1236 constraints, problems are : Problem set: 0 solved, 2 unsolved in 15237 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 16633ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 151 ms.
Support contains 2 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 75 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 74 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 07:59:25] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:59:25] [INFO ] Invariant cache hit.
[2024-05-28 07:59:26] [INFO ] Implicit Places using invariants in 1198 ms returned []
[2024-05-28 07:59:26] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:59:26] [INFO ] Invariant cache hit.
[2024-05-28 07:59:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 07:59:37] [INFO ] Implicit Places using invariants and state equation in 10836 ms returned []
Implicit Place search using SMT with State Equation took 12035 ms to find 0 implicit places.
[2024-05-28 07:59:37] [INFO ] Redundant transitions in 99 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 07:59:37] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 07:59:37] [INFO ] Invariant cache hit.
[2024-05-28 07:59:37] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 50932ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 50964ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63189 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3, 3] Max Struct:[10, 10]
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2024-05-28 08:00:28] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:00:28] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (660 resets) in 152 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (70 resets) in 27 ms. (357 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 08:00:28] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:00:28] [INFO ] Invariant cache hit.
[2024-05-28 08:00:28] [INFO ] [Real]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-28 08:00:28] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 08:00:29] [INFO ] [Real]Absence check using state equation in 842 ms returned sat
[2024-05-28 08:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:00:30] [INFO ] [Nat]Absence check using 135 positive place invariants in 41 ms returned sat
[2024-05-28 08:00:30] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 08:00:31] [INFO ] [Nat]Absence check using state equation in 972 ms returned sat
[2024-05-28 08:00:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:00:31] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 08:00:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 615 ms returned sat
[2024-05-28 08:00:32] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 238 ms.
[2024-05-28 08:00:33] [INFO ] Added : 11 causal constraints over 3 iterations in 1488 ms. Result :sat
Minimization took 701 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 110 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 08:00:34] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:00:34] [INFO ] Invariant cache hit.
[2024-05-28 08:00:34] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 43184ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 43216ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43334 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 08:01:17] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:01:17] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70472 resets) in 15494 ms. (64 steps per ms)
BEST_FIRST walk for 1000001 steps (7069 resets) in 2402 ms. (416 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 08:01:35] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:01:35] [INFO ] Invariant cache hit.
[2024-05-28 08:01:35] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-05-28 08:01:35] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 32 ms returned sat
[2024-05-28 08:01:36] [INFO ] [Real]Absence check using state equation in 700 ms returned sat
[2024-05-28 08:01:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:01:36] [INFO ] [Nat]Absence check using 135 positive place invariants in 38 ms returned sat
[2024-05-28 08:01:36] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned sat
[2024-05-28 08:01:37] [INFO ] [Nat]Absence check using state equation in 926 ms returned sat
[2024-05-28 08:01:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:01:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 543 ms returned sat
[2024-05-28 08:01:38] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 225 ms.
[2024-05-28 08:01:39] [INFO ] Added : 11 causal constraints over 3 iterations in 1427 ms. Result :sat
Minimization took 4827 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 111 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 75 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 08:01:44] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:01:44] [INFO ] Invariant cache hit.
[2024-05-28 08:01:45] [INFO ] Implicit Places using invariants in 1102 ms returned []
[2024-05-28 08:01:45] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:01:45] [INFO ] Invariant cache hit.
[2024-05-28 08:01:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:01:54] [INFO ] Implicit Places using invariants and state equation in 9362 ms returned []
Implicit Place search using SMT with State Equation took 10465 ms to find 0 implicit places.
[2024-05-28 08:01:55] [INFO ] Redundant transitions in 202 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 08:01:55] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:01:55] [INFO ] Invariant cache hit.
[2024-05-28 08:01:55] [INFO ] State equation strengthened by 1 read => feed constraints.
(s307 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 50986ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 51018ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61781 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2795 resets) in 848 ms. (47 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (322 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (273 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 198399 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 2
Probabilistic random walk after 198399 steps, saw 33466 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2024-05-28 08:02:49] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:02:49] [INFO ] Invariant cache hit.
[2024-05-28 08:02:49] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1544 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3758/3759 variables, and 1233 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1730 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1090/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 3302ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 121 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 80 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 08:02:53] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:02:53] [INFO ] Invariant cache hit.
[2024-05-28 08:02:53] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 41593ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 41620ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41706 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2798 resets) in 1150 ms. (34 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (260 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 238663 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 238663 steps, saw 39689 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-28 08:03:38] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:03:38] [INFO ] Invariant cache hit.
[2024-05-28 08:03:38] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1169 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3758 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 11122 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 12346ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 72 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 83 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 08:03:50] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:03:50] [INFO ] Invariant cache hit.
[2024-05-28 08:03:51] [INFO ] Implicit Places using invariants in 1173 ms returned []
[2024-05-28 08:03:51] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:03:51] [INFO ] Invariant cache hit.
[2024-05-28 08:03:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:04:02] [INFO ] Implicit Places using invariants and state equation in 10351 ms returned []
Implicit Place search using SMT with State Equation took 11543 ms to find 0 implicit places.
[2024-05-28 08:04:02] [INFO ] Redundant transitions in 97 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 08:04:02] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:04:02] [INFO ] Invariant cache hit.
[2024-05-28 08:04:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 51151ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 51183ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62926 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-10 in 264999 ms.
Starting property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[10]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[10]
[2024-05-28 08:04:53] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:04:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[10]
RANDOM walk for 10000 steps (721 resets) in 152 ms. (65 steps per ms)
BEST_FIRST walk for 10001 steps (66 resets) in 24 ms. (400 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 08:04:53] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:04:53] [INFO ] Invariant cache hit.
[2024-05-28 08:04:53] [INFO ] [Real]Absence check using 135 positive place invariants in 35 ms returned sat
[2024-05-28 08:04:53] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 28 ms returned sat
[2024-05-28 08:04:54] [INFO ] [Real]Absence check using state equation in 830 ms returned sat
[2024-05-28 08:04:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:04:55] [INFO ] [Nat]Absence check using 135 positive place invariants in 35 ms returned sat
[2024-05-28 08:04:55] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 25 ms returned sat
[2024-05-28 08:04:55] [INFO ] [Nat]Absence check using state equation in 952 ms returned sat
[2024-05-28 08:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:04:56] [INFO ] SMT solver returned unknown. Retrying;
[2024-05-28 08:04:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 848 ms returned sat
[2024-05-28 08:04:57] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 257 ms.
[2024-05-28 08:04:58] [INFO ] Added : 12 causal constraints over 3 iterations in 1419 ms. Result :sat
Minimization took 737 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 108 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 08:04:59] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:04:59] [INFO ] Invariant cache hit.
[2024-05-28 08:04:59] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 1.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 4.0)
(s380 4.0)
(s381 4.0)
(s382 4.0)
(s383 4.0)
(s384 4.0)
(s385 4.0)
(s386 4.0)
(s387 4.0)
(s388 4.0)
(s389 9.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s480 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s566 0.0)
(s567 0.0)
(s568 0.0)
(s569 0.0)
(s570 0.0)
(s571 0.0)
(s572 0.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 0.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 0.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 0.0)
(s612 0.0)
(s613 0.0)
(s614 0.0)
(s615 0.0)
(s616 0.0)
(s617 0.0)
(s618 0.0)
(s619 0.0)
(s620 0.0)
(s621 0.0)
(s622 0.0)
(s623 0.0)
(s624 0.0)
(s625 0.0)
(s626 0.0)
(s627 0.0)
(s628 0.0)
(s629 0.0)
(s630 0.0)
(s631 0.0)
(s632 0.0)
(s633 0.0)
(s634 0.0)
(s635 0.0)
(s636 0.0)
(s637 0.0)
(s638 0.0)
(s639 0.0)
(s640 0.0)
(s641 0.0)
(s642 0.0)
(s643 0.0)
(s644 0.0)
(s645 0.0)
(s646 0.0)
(s647 0.0)
(s648 0.0)
(s649 0.0)
(s650 0.0)
(s651 0.0)
(s652 0.0)
(s653 0.0)
(s654 0.0)
(s655 0.0)
(s656 0.0)
(s657 0.0)
(s658 0.0)
(s659 0.0)
(s660 0.0)
(s661 0.0)
(s662 0.0)
(s663 0.0)
(s664 0.0)
(s665 0.0)
(s666 0.0)
(s667 0.0)
(s668 0.0)
(s669 0.0)
(s670 0.0)
(s671 0.0)
(s672 0.0)
(s673 0.0)
(s674 0.0)
(s675 0.0)
(s676 0.0)
(s677 0.0)
(s678 0.0)
(s679 0.0)
(s680 0.0)
(s681 0.0)
(s682 0.0)
(s683 0.0)
(s684 0.0)
(s685 0.0)
(s686 timeout
0.0)
(s687 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 41253ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 41286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41402 ms. Remains : 1091/1091 places, 2677/2677 transitions.
[2024-05-28 08:05:40] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:05:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[10]
RANDOM walk for 1000000 steps (70360 resets) in 15835 ms. (63 steps per ms)
BEST_FIRST walk for 1000001 steps (7061 resets) in 2670 ms. (374 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[10]
[2024-05-28 08:05:59] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:05:59] [INFO ] Invariant cache hit.
[2024-05-28 08:05:59] [INFO ] [Real]Absence check using 135 positive place invariants in 39 ms returned sat
[2024-05-28 08:05:59] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 30 ms returned sat
[2024-05-28 08:06:00] [INFO ] [Real]Absence check using state equation in 845 ms returned sat
[2024-05-28 08:06:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 08:06:00] [INFO ] [Nat]Absence check using 135 positive place invariants in 59 ms returned sat
[2024-05-28 08:06:00] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 44 ms returned sat
[2024-05-28 08:06:01] [INFO ] [Nat]Absence check using state equation in 895 ms returned sat
[2024-05-28 08:06:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:06:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 785 ms returned sat
[2024-05-28 08:06:02] [INFO ] Computed and/alt/rep : 1735/6486/1735 causal constraints (skipped 922 transitions) in 297 ms.
[2024-05-28 08:06:03] [INFO ] Added : 14 causal constraints over 4 iterations in 1657 ms. Result :sat
Minimization took 5379 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[10]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[10]
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 81 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 65 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 08:06:09] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:06:09] [INFO ] Invariant cache hit.
[2024-05-28 08:06:10] [INFO ] Implicit Places using invariants in 1048 ms returned []
[2024-05-28 08:06:10] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:06:10] [INFO ] Invariant cache hit.
[2024-05-28 08:06:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:06:21] [INFO ] Implicit Places using invariants and state equation in 10557 ms returned []
Implicit Place search using SMT with State Equation took 11610 ms to find 0 implicit places.
[2024-05-28 08:06:21] [INFO ] Redundant transitions in 61 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 08:06:21] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:06:21] [INFO ] Invariant cache hit.
[2024-05-28 08:06:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 54226ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 54267ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66045 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2852 resets) in 1031 ms. (38 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (317 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (241 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 204293 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :0 out of 2
Probabilistic random walk after 204293 steps, saw 34346 distinct states, run finished after 3002 ms. (steps per millisecond=68 ) properties seen :0
[2024-05-28 08:07:19] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:07:19] [INFO ] Invariant cache hit.
[2024-05-28 08:07:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem MAX0 is UNSAT
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1149 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 1/1235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1726 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 2887ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 77 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Running 2666 sub problems to find dead transitions.
[2024-05-28 08:07:22] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:07:22] [INFO ] Invariant cache hit.
[2024-05-28 08:07:22] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 41089ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 41118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41202 ms. Remains : 1091/1091 places, 2677/2677 transitions.
RANDOM walk for 40000 steps (2822 resets) in 1081 ms. (36 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (295 resets) in 165 ms. (240 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 239260 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :0 out of 1
Probabilistic random walk after 239260 steps, saw 39783 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
[2024-05-28 08:08:06] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:08:06] [INFO ] Invariant cache hit.
[2024-05-28 08:08:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/3759 variables, 0/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3759/3759 variables, and 1234 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1197 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 137/138 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/138 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 877/1015 variables, 71/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1015 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 62/1077 variables, 62/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1077 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 11/1088 variables, 6/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1088 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/1090 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1090 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2668/3758 variables, 1090/1232 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3758 variables, 1/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3758 variables, 0/1233 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/3759 variables, 1/1234 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3759 variables, 1/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/3759 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3759/3759 variables, and 1235 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1591 ms.
Refiners :[Positive P Invariants (semi-flows): 135/135 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 1091/1091 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2804ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 1091 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1091/1091 places, 2677/2677 transitions.
Applied a total of 0 rules in 56 ms. Remains 1091 /1091 variables (removed 0) and now considering 2677/2677 (removed 0) transitions.
[2024-05-28 08:08:09] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:08:09] [INFO ] Invariant cache hit.
[2024-05-28 08:08:10] [INFO ] Implicit Places using invariants in 1233 ms returned []
[2024-05-28 08:08:10] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:08:10] [INFO ] Invariant cache hit.
[2024-05-28 08:08:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 08:08:20] [INFO ] Implicit Places using invariants and state equation in 10146 ms returned []
Implicit Place search using SMT with State Equation took 11382 ms to find 0 implicit places.
[2024-05-28 08:08:21] [INFO ] Redundant transitions in 96 ms returned []
Running 2666 sub problems to find dead transitions.
[2024-05-28 08:08:21] [INFO ] Flow matrix only has 2668 transitions (discarded 9 similar events)
[2024-05-28 08:08:21] [INFO ] Invariant cache hit.
[2024-05-28 08:08:21] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1081 variables, 126/126 constraints. Problems are: Problem set: 0 solved, 2666 unsolved
SMT process timed out in 51659ms, After SMT, problems are : Problem set: 0 solved, 2666 unsolved
Search for dead transitions found 0 dead transitions in 51692ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63245 ms. Remains : 1091/1091 places, 2677/2677 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[3] Max Struct:[10]
Ending property specific reduction for PolyORBNT-COL-S10J60-UpperBounds-15 in 259213 ms.
[2024-05-28 08:09:13] [INFO ] Flatten gal took : 348 ms
[2024-05-28 08:09:13] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-28 08:09:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1091 places, 2677 transitions and 16786 arcs took 23 ms.
Total runtime 964295 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running PolyORBNT-COL-S10J60
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/416/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1091
TRANSITIONS: 2677
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.075s, Sys 0.015s]
SAVING FILE /home/mcc/execution/416/model (.net / .def) ...
EXPORT TIME: [User 0.007s, Sys 0.003s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1117
MODEL NAME: /home/mcc/execution/416/model
1091 places, 2677 transitions.
No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
Error in allocating array of size 2097152 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 524288 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 524288 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory
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-S10J60"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is PolyORBNT-COL-S10J60, 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 r289-tajo-171654445900429"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J60.tgz
mv PolyORBNT-COL-S10J60 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 ;