MCC'2024- Execution of r263-tall-171654372200171

About the Execution of 2023-gold for Murphy-COL-D4N025

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
774.724	53044.00	60266.00	412.80	130 130 5 15 15 5 130 130 5 130 130 130 128 5 130 5	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r263-tall-171654372200171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Murphy-COL-D4N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-tall-171654372200171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.9K Apr 11 22:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Apr 11 22:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 22:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K Apr 11 22:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 6 10:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 6 10:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 22:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 22:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Apr 11 22:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Apr 11 22:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:01 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 20K 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 Murphy-COL-D4N025-UpperBounds-00
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-01
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-02
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-03
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-04
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-05
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-06
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-07
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-08
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-09
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-10
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-11
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-12
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-13
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-14
FORMULA_NAME Murphy-COL-D4N025-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716673490831

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-COL-D4N025
Not applying reductions.
Model is COL
UpperBounds COL
Running Version 202304061127
[2024-05-25 21:44:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:44:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:44:52] [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-25 21:44:52] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 21:44:52] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 585 ms
[2024-05-25 21:44:52] [INFO ] Imported 6 HL places and 7 HL transitions for a total of 30 PT places and 35.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
[2024-05-25 21:44:52] [INFO ] Built PT skeleton of HLPN with 6 places and 7 transitions 27 arcs in 3 ms.
[2024-05-25 21:44:52] [INFO ] Skeletonized 16 HLPN properties in 0 ms.
// Phase 1: matrix 7 rows 6 cols
[2024-05-25 21:44:52] [INFO ] Computed 2 invariants in 5 ms
[2024-05-25 21:44:52] [INFO ] Invariant cache hit.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 21:44:53] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-25 21:44:53] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 21:44:53] [INFO ] Added : 1 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 2 ms.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 21:44:53] [INFO ] Added : 0 causal constraints over 0 iterations in 2 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [130, 130, -1, -1, -1, -1, 130, 130, -1, 130, 130, 130, 130, -1, 130, -1]
Arc [2:1*[(MOD (ADD $x 1) 5)]] contains successor/predecessor on variables of sort CD
[2024-05-25 21:44:53] [INFO ] Unfolded HLPN to a Petri net with 30 places and 35 transitions 135 arcs in 9 ms.
[2024-05-25 21:44:53] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Incomplete random walk after 10014 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 16) seen :855
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 16) seen :1220
FORMULA Murphy-COL-D4N025-UpperBounds-14 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-11 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-10 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-09 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-07 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-06 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-01 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Murphy-COL-D4N025-UpperBounds-00 130 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 8) seen :155
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 8) seen :160
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 8) seen :183
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 8) seen :180
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 21:44:53] [INFO ] Computed 6 invariants in 3 ms
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:44:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:53] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 21:44:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:44:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:53] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 21:44:53] [INFO ] Added : 2 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:44:54] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:44:54] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 21:44:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:44:54] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 21:44:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 21:44:54] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:44:54] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 4 ms to minimize.
[2024-05-25 21:44:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-05-25 21:44:54] [INFO ] Added : 3 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:44:54] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-25 21:44:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:54] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 21:44:54] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:54] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:44:54] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 130, 2147483647, 2147483647] Max seen :[5, 15, 15, 5, 5, 128, 5, 5]
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 11 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 21:44:54] [INFO ] Invariant cache hit.
[2024-05-25 21:44:54] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 30/30 places, 35/35 transitions.
[2024-05-25 21:44:54] [INFO ] Invariant cache hit.
Incomplete random walk after 1000025 steps, including 2 resets, run finished after 798 ms. (steps per millisecond=1253 ) properties (out of 8) seen :183
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 548 ms. (steps per millisecond=1824 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 499 ms. (steps per millisecond=2004 ) properties (out of 8) seen :160
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 510 ms. (steps per millisecond=1960 ) properties (out of 8) seen :160
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 513 ms. (steps per millisecond=1949 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=1945 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 502 ms. (steps per millisecond=1992 ) properties (out of 8) seen :183
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 509 ms. (steps per millisecond=1964 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000000 steps, including 2 resets, run finished after 507 ms. (steps per millisecond=1972 ) properties (out of 8) seen :180
[2024-05-25 21:44:59] [INFO ] Invariant cache hit.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:44:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:44:59] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:44:59] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:59] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:44:59] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:59] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:44:59] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:44:59] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:44:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:44:59] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:44:59] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:44:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:44:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:44:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:45:00] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:00] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-25 21:45:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 18 ms
[2024-05-25 21:45:00] [INFO ] Added : 3 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:00] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:00] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:00] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 21:45:00] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:00] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:00] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 130, 2147483647, 2147483647] Max seen :[5, 15, 15, 5, 5, 128, 5, 5]
Support contains 15 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 21:45:00] [INFO ] Invariant cache hit.
[2024-05-25 21:45:00] [INFO ] Implicit Places using invariants in 31 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 32 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 35 ms. Remains : 25/30 places, 35/35 transitions.
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 21:45:00] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 1000032 steps, including 2 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 8) seen :183
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=2463 ) properties (out of 8) seen :160
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 402 ms. (steps per millisecond=2487 ) properties (out of 8) seen :160
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 8) seen :181
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 445 ms. (steps per millisecond=2247 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=2169 ) properties (out of 8) seen :183
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=2222 ) properties (out of 8) seen :180
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 431 ms. (steps per millisecond=2320 ) properties (out of 8) seen :180
[2024-05-25 21:45:04] [INFO ] Invariant cache hit.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 21:45:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:45:04] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-05-25 21:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:04] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:45:04] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:04] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 21:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:45:04] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-25 21:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:04] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:04] [INFO ] Added : 4 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 21:45:04] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:05] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
[2024-05-25 21:45:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:05] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [2147483647, 2147483647, 2147483647, 2147483647, 2147483647, 130, 2147483647, 2147483647] Max seen :[5, 15, 15, 5, 5, 128, 5, 5]
Support contains 15 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 7 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 21:45:05] [INFO ] Invariant cache hit.
[2024-05-25 21:45:05] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 21:45:05] [INFO ] Invariant cache hit.
[2024-05-25 21:45:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:05] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-05-25 21:45:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:45:05] [INFO ] Invariant cache hit.
[2024-05-25 21:45:05] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 25/25 places, 35/35 transitions.
Starting property specific reduction for Murphy-COL-D4N025-UpperBounds-02
[2024-05-25 21:45:05] [INFO ] Invariant cache hit.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1667 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :5
[2024-05-25 21:45:05] [INFO ] Invariant cache hit.
[2024-05-25 21:45:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 21:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:05] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:05] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 3 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-25 21:45:05] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 21:45:05] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 15/25 places, 20/35 transitions.
[2024-05-25 21:45:05] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 633 ms. (steps per millisecond=1579 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 277 ms. (steps per millisecond=3610 ) properties (out of 1) seen :5
[2024-05-25 21:45:06] [INFO ] Invariant cache hit.
[2024-05-25 21:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 21:45:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:06] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 21:45:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:06] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:45:06] [INFO ] Computed and/alt/rep : 15/30/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:06] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 15/15 places, 20/20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 2 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-25 21:45:06] [INFO ] Invariant cache hit.
[2024-05-25 21:45:06] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 21:45:06] [INFO ] Invariant cache hit.
[2024-05-25 21:45:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:06] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-25 21:45:06] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:45:06] [INFO ] Invariant cache hit.
[2024-05-25 21:45:06] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 15/15 places, 20/20 transitions.
Ending property specific reduction for Murphy-COL-D4N025-UpperBounds-02 in 1163 ms.
Starting property specific reduction for Murphy-COL-D4N025-UpperBounds-03
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 21:45:06] [INFO ] Computed 1 invariants in 3 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :15
[2024-05-25 21:45:06] [INFO ] Invariant cache hit.
[2024-05-25 21:45:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 21:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:06] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:06] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 21:45:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:06] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[15]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 2 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-25 21:45:06] [INFO ] Computed 0 invariants in 3 ms
[2024-05-25 21:45:06] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 15/25 places, 20/35 transitions.
[2024-05-25 21:45:06] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 618 ms. (steps per millisecond=1618 ) properties (out of 1) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 267 ms. (steps per millisecond=3745 ) properties (out of 1) seen :15
[2024-05-25 21:45:07] [INFO ] Invariant cache hit.
[2024-05-25 21:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:07] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:07] [INFO ] [Real]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:07] [INFO ] [Nat]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:45:07] [INFO ] Computed and/alt/rep : 15/30/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:07] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[15]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 20/20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-25 21:45:07] [INFO ] Invariant cache hit.
[2024-05-25 21:45:07] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-25 21:45:07] [INFO ] Invariant cache hit.
[2024-05-25 21:45:07] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:07] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-05-25 21:45:07] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 21:45:07] [INFO ] Invariant cache hit.
[2024-05-25 21:45:07] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 15/15 places, 20/20 transitions.
Ending property specific reduction for Murphy-COL-D4N025-UpperBounds-03 in 1170 ms.
Starting property specific reduction for Murphy-COL-D4N025-UpperBounds-04
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 21:45:07] [INFO ] Computed 1 invariants in 3 ms
Incomplete random walk after 10009 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1668 ) properties (out of 1) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :15
[2024-05-25 21:45:07] [INFO ] Invariant cache hit.
[2024-05-25 21:45:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:07] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 21:45:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 21:45:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:07] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[15]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 2 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-25 21:45:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 21:45:07] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 15/25 places, 20/35 transitions.
[2024-05-25 21:45:07] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 621 ms. (steps per millisecond=1610 ) properties (out of 1) seen :15
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=3759 ) properties (out of 1) seen :15
[2024-05-25 21:45:08] [INFO ] Invariant cache hit.
[2024-05-25 21:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 21:45:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:08] [INFO ] [Real]Added 5 Read/Feed constraints in 0 ms returned sat
[2024-05-25 21:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:08] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:08] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:08] [INFO ] Computed and/alt/rep : 15/30/15 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 21:45:08] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[15]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 20/20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-25 21:45:08] [INFO ] Invariant cache hit.
[2024-05-25 21:45:08] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 21:45:08] [INFO ] Invariant cache hit.
[2024-05-25 21:45:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:08] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-25 21:45:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:45:08] [INFO ] Invariant cache hit.
[2024-05-25 21:45:08] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 15/15 places, 20/20 transitions.
Ending property specific reduction for Murphy-COL-D4N025-UpperBounds-04 in 1150 ms.
Starting property specific reduction for Murphy-COL-D4N025-UpperBounds-05
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 21:45:08] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :5
[2024-05-25 21:45:08] [INFO ] Invariant cache hit.
[2024-05-25 21:45:08] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 21:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:08] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:08] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:08] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 1 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-25 21:45:08] [INFO ] Computed 0 invariants in 2 ms
[2024-05-25 21:45:08] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 15/25 places, 20/35 transitions.
[2024-05-25 21:45:08] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 627 ms. (steps per millisecond=1594 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=3584 ) properties (out of 1) seen :5
[2024-05-25 21:45:09] [INFO ] Invariant cache hit.
[2024-05-25 21:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:09] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:09] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:09] [INFO ] Computed and/alt/rep : 15/30/15 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:45:09] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 15/15 places, 20/20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-25 21:45:09] [INFO ] Invariant cache hit.
[2024-05-25 21:45:09] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 21:45:09] [INFO ] Invariant cache hit.
[2024-05-25 21:45:09] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:09] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-25 21:45:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 21:45:09] [INFO ] Invariant cache hit.
[2024-05-25 21:45:09] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 15/15 places, 20/20 transitions.
Ending property specific reduction for Murphy-COL-D4N025-UpperBounds-05 in 1167 ms.
Starting property specific reduction for Murphy-COL-D4N025-UpperBounds-08
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 21:45:09] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :5
[2024-05-25 21:45:09] [INFO ] Invariant cache hit.
[2024-05-25 21:45:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:09] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 21:45:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:09] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:09] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:09] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:09] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 1 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-25 21:45:09] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 21:45:10] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 15/25 places, 20/35 transitions.
[2024-05-25 21:45:10] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 280 ms. (steps per millisecond=3571 ) properties (out of 1) seen :5
[2024-05-25 21:45:10] [INFO ] Invariant cache hit.
[2024-05-25 21:45:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:10] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:10] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:10] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:10] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:10] [INFO ] Computed and/alt/rep : 15/30/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:10] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 20/20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-25 21:45:10] [INFO ] Invariant cache hit.
[2024-05-25 21:45:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 21:45:11] [INFO ] Invariant cache hit.
[2024-05-25 21:45:11] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:11] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-25 21:45:11] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-25 21:45:11] [INFO ] Invariant cache hit.
[2024-05-25 21:45:11] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 15/15 places, 20/20 transitions.
Ending property specific reduction for Murphy-COL-D4N025-UpperBounds-08 in 1160 ms.
Starting property specific reduction for Murphy-COL-D4N025-UpperBounds-12
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 21:45:11] [INFO ] Computed 1 invariants in 0 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :128
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :128
[2024-05-25 21:45:11] [INFO ] Invariant cache hit.
[2024-05-25 21:45:11] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:11] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 21:45:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:11] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:11] [INFO ] Added : 4 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : [650] Max seen :[128]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 21:45:11] [INFO ] Invariant cache hit.
[2024-05-25 21:45:11] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 21:45:11] [INFO ] Invariant cache hit.
Incomplete random walk after 1000011 steps, including 2 resets, run finished after 477 ms. (steps per millisecond=2096 ) properties (out of 1) seen :128
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 405 ms. (steps per millisecond=2469 ) properties (out of 1) seen :128
[2024-05-25 21:45:12] [INFO ] Invariant cache hit.
[2024-05-25 21:45:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:45:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 21:45:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:12] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:12] [INFO ] Added : 4 causal constraints over 3 iterations in 10 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [650] Max seen :[128]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 21:45:12] [INFO ] Invariant cache hit.
[2024-05-25 21:45:12] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 21:45:12] [INFO ] Invariant cache hit.
[2024-05-25 21:45:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:12] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2024-05-25 21:45:12] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:45:12] [INFO ] Invariant cache hit.
[2024-05-25 21:45:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 25/25 places, 35/35 transitions.
Ending property specific reduction for Murphy-COL-D4N025-UpperBounds-12 in 1197 ms.
Starting property specific reduction for Murphy-COL-D4N025-UpperBounds-13
[2024-05-25 21:45:12] [INFO ] Invariant cache hit.
Incomplete random walk after 10025 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1670 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :5
[2024-05-25 21:45:12] [INFO ] Invariant cache hit.
[2024-05-25 21:45:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 21:45:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:12] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:45:12] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 2 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-25 21:45:12] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 21:45:12] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 15/25 places, 20/35 transitions.
[2024-05-25 21:45:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 622 ms. (steps per millisecond=1607 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=3584 ) properties (out of 1) seen :5
[2024-05-25 21:45:13] [INFO ] Invariant cache hit.
[2024-05-25 21:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:13] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 21:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:13] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:13] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:13] [INFO ] Computed and/alt/rep : 15/30/15 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:45:13] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 0 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 20/20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-25 21:45:13] [INFO ] Invariant cache hit.
[2024-05-25 21:45:13] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 21:45:13] [INFO ] Invariant cache hit.
[2024-05-25 21:45:13] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:13] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-25 21:45:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:45:13] [INFO ] Invariant cache hit.
[2024-05-25 21:45:13] [INFO ] Dead Transitions using invariants and state equation in 18 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 15/15 places, 20/20 transitions.
Ending property specific reduction for Murphy-COL-D4N025-UpperBounds-13 in 1149 ms.
Starting property specific reduction for Murphy-COL-D4N025-UpperBounds-15
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 21:45:13] [INFO ] Computed 1 invariants in 1 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :5
[2024-05-25 21:45:13] [INFO ] Invariant cache hit.
[2024-05-25 21:45:13] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 21:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:13] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 21:45:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 21:45:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 21:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 21:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:45:13] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 15 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 15 transition count 20
Applied a total of 6 rules in 2 ms. Remains 15 /25 variables (removed 10) and now considering 20/35 (removed 15) transitions.
// Phase 1: matrix 20 rows 15 cols
[2024-05-25 21:45:13] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 21:45:13] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 15/25 places, 20/35 transitions.
[2024-05-25 21:45:13] [INFO ] Invariant cache hit.
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 625 ms. (steps per millisecond=1600 ) properties (out of 1) seen :5
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 279 ms. (steps per millisecond=3584 ) properties (out of 1) seen :5
[2024-05-25 21:45:14] [INFO ] Invariant cache hit.
[2024-05-25 21:45:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:14] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:45:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-25 21:45:14] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 21:45:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:14] [INFO ] [Nat]Added 5 Read/Feed constraints in 1 ms returned sat
[2024-05-25 21:45:14] [INFO ] Computed and/alt/rep : 15/30/15 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:45:14] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[5]
Support contains 5 out of 15 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 15/15 places, 20/20 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 15/15 places, 20/20 transitions.
Applied a total of 0 rules in 1 ms. Remains 15 /15 variables (removed 0) and now considering 20/20 (removed 0) transitions.
[2024-05-25 21:45:14] [INFO ] Invariant cache hit.
[2024-05-25 21:45:14] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 21:45:14] [INFO ] Invariant cache hit.
[2024-05-25 21:45:14] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 21:45:14] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-25 21:45:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-25 21:45:14] [INFO ] Invariant cache hit.
[2024-05-25 21:45:14] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 15/15 places, 20/20 transitions.
Ending property specific reduction for Murphy-COL-D4N025-UpperBounds-15 in 1159 ms.
[2024-05-25 21:45:14] [INFO ] Flatten gal took : 17 ms
[2024-05-25 21:45:14] [INFO ] Applying decomposition
[2024-05-25 21:45:14] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7944020689715687646.txt' '-o' '/tmp/graph7944020689715687646.bin' '-w' '/tmp/graph7944020689715687646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7944020689715687646.bin' '-l' '-1' '-v' '-w' '/tmp/graph7944020689715687646.weights' '-q' '0' '-e' '0.001'
[2024-05-25 21:45:14] [INFO ] Decomposing Gal with order
[2024-05-25 21:45:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-25 21:45:14] [INFO ] Flatten gal took : 11 ms
[2024-05-25 21:45:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2024-05-25 21:45:14] [INFO ] Time to serialize gal into /tmp/UpperBounds16931435397961813925.gal : 2 ms
[2024-05-25 21:45:14] [INFO ] Time to serialize properties into /tmp/UpperBounds15132109292412569417.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16931435397961813925.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds15132109292412569417.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...306
Loading property file /tmp/UpperBounds15132109292412569417.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flatf,2.00126e+16,27.5983,448720,2,8332,5,1.74659e+06,6,0,173,2.00176e+06,0
Total reachable state count : 20012606308670976

Verifying 8 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property Murphy-COL-D4N025-UpperBounds-02 :0 <= gu5.p3_0+gu6.p3_1+gu9.p3_2+gu7.p3_3+gu8.p3_4 <= 5
FORMULA Murphy-COL-D4N025-UpperBounds-02 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-COL-D4N025-UpperBounds-02,0,27.6397,448720,1,0,7,1.74659e+06,9,1,251,2.00176e+06,4
Min sum of variable value : 0
Maximum sum along a path : 15
Bounds property Murphy-COL-D4N025-UpperBounds-03 :0 <= gu5.p5_0+gu6.p5_1+gu9.p5_2+gu7.p5_3+gu8.p5_4 <= 15
FORMULA Murphy-COL-D4N025-UpperBounds-03 15 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-COL-D4N025-UpperBounds-03,0,27.6738,448720,1,0,8,1.74659e+06,10,1,310,2.00176e+06,5
Min sum of variable value : 0
Maximum sum along a path : 15
Bounds property Murphy-COL-D4N025-UpperBounds-04 :0 <= gu5.p5_0+gu6.p5_1+gu9.p5_2+gu7.p5_3+gu8.p5_4 <= 15
FORMULA Murphy-COL-D4N025-UpperBounds-04 15 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-COL-D4N025-UpperBounds-04,0,27.6739,448720,1,0,8,1.74659e+06,10,1,310,2.00176e+06,5
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property Murphy-COL-D4N025-UpperBounds-05 :0 <= gu5.p3_0+gu6.p3_1+gu9.p3_2+gu7.p3_3+gu8.p3_4 <= 5
FORMULA Murphy-COL-D4N025-UpperBounds-05 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-COL-D4N025-UpperBounds-05,0,27.6739,448720,1,0,8,1.74659e+06,10,1,310,2.00176e+06,5
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property Murphy-COL-D4N025-UpperBounds-08 :0 <= gu5.p3_0+gu6.p3_1+gu9.p3_2+gu7.p3_3+gu8.p3_4 <= 5
FORMULA Murphy-COL-D4N025-UpperBounds-08 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-COL-D4N025-UpperBounds-08,0,27.674,448720,1,0,8,1.74659e+06,10,1,310,2.00176e+06,5
Min sum of variable value : 0
Maximum sum along a path : 128
Bounds property Murphy-COL-D4N025-UpperBounds-12 :0 <= gi0.gi0.gu0.p1_0+gi0.gi0.gu1.p1_1+gi0.gi1.gu2.p1_2+gi0.gi1.gu3.p1_3+gi0.gi0.gu4.p1_4 <= 128
FORMULA Murphy-COL-D4N025-UpperBounds-12 128 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-COL-D4N025-UpperBounds-12,0,28.0142,448720,1,0,9,1.74659e+06,11,1,1001,2.00176e+06,6
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property Murphy-COL-D4N025-UpperBounds-13 :0 <= gu5.p3_0+gu6.p3_1+gu9.p3_2+gu7.p3_3+gu8.p3_4 <= 5
FORMULA Murphy-COL-D4N025-UpperBounds-13 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-COL-D4N025-UpperBounds-13,0,28.0143,448720,1,0,9,1.74659e+06,11,1,1001,2.00176e+06,6
Min sum of variable value : 0
Maximum sum along a path : 5
Bounds property Murphy-COL-D4N025-UpperBounds-15 :0 <= gu5.p3_0+gu6.p3_1+gu9.p3_2+gu7.p3_3+gu8.p3_4 <= 5
FORMULA Murphy-COL-D4N025-UpperBounds-15 5 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Murphy-COL-D4N025-UpperBounds-15,0,28.0143,448720,1,0,9,1.74659e+06,11,1,1001,2.00176e+06,6
Total runtime 50634 ms.

BK_STOP 1716673543875

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Murphy-COL-D4N025"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is Murphy-COL-D4N025, 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 r263-tall-171654372200171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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