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.r245-tall-171654349600317.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is Murphy-PT-D3N050, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349600317
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 6.9K Apr 11 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 11 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 23:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 11 23:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 6 10:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 23:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Apr 11 23:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 23:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 138K Apr 11 23:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 6 10:02 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 6 10:02 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 15K 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-PT-D3N050-UpperBounds-00
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-01
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-02
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-03
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-04
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-05
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-06
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-07
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-08
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-09
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-10
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-11
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-12
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-13
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-14
FORMULA_NAME Murphy-PT-D3N050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716655195110

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Murphy-PT-D3N050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:39:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-25 16:39:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:39:56] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2024-05-25 16:39:56] [INFO ] Transformed 24 places.
[2024-05-25 16:39:56] [INFO ] Transformed 28 transitions.
[2024-05-25 16:39:56] [INFO ] Parsed PT model containing 24 places and 28 transitions and 108 arcs in 131 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Current structural bounds on expressions (Initially) : Max Seen:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 28 rows 24 cols
[2024-05-25 16:39:56] [INFO ] Computed 5 invariants in 12 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 3, 3, 0, 50, 1, 1, 0, 1, 3, 50, 3, 50, 1, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
RANDOM walk for 10000 steps (2 resets) in 25 ms. (384 steps per ms)
BEST_FIRST walk for 160014 steps (32 resets) in 128 ms. (1240 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 65, 77, 77, 1, 81, 3, 75, 3, 104, 77, 1, 109] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-05-25 16:39:56] [INFO ] Invariant cache hit.
[2024-05-25 16:39:56] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 16:39:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:39:56] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 16:39:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:56] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2024-05-25 16:39:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:39:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:39:56] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 9 ms to minimize.
[2024-05-25 16:39:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2024-05-25 16:39:56] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:39:56] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:39:56] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:56] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:56] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:39:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:56] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:39:57] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 16:39:57] [INFO ] Added : 3 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:39:57] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 26 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 25 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 28 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:39:57] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 25 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 16:39:57] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:39:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:39:57] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 21 ms.
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:39:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:39:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:39:58] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:39:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-25 16:39:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:39:58] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 43 ms.
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-25 16:39:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:39:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:39:58] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 28 ms.
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:39:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:39:58] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:39:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:39:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:39:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:39:58] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 65, 77, 77, 1, 81, 3, 75, 3, 104, 77, 1, 109] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 193, 201, 201, 1, 199, 3, 199, 3, 197, 201, 1, 199] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
Support contains 16 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 16:39:59] [INFO ] Invariant cache hit.
[2024-05-25 16:39:59] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 0/52 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 37 constraints, problems are : Problem set: 0 solved, 16 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (OVERLAPS) 4/20 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 28/48 variables, 20/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 8/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 4/52 variables, 4/37 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/52 variables, 16/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/52 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 53 constraints, problems are : Problem set: 0 solved, 16 unsolved in 207 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 24/24 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 476ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 485ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 505 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 16) seen :[2, 3, 3, 2, 53, 115, 115, 1, 71, 3, 55, 3, 53, 72, 1, 88]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 193, 201, 201, 1, 199, 3, 199, 3, 197, 201, 1, 199] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-05-25 16:39:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 193, 201, 201, 1, 199, 3, 199, 3, 197, 201, 1, 199] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
RANDOM walk for 1000034 steps (2 resets) in 501 ms. (1992 steps per ms)
BEST_FIRST walk for 16000013 steps (32 resets) in 6496 ms. (2462 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 193, 201, 201, 1, 201, 3, 199, 3, 197, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 204, 204, +inf, 204, +inf, 204, +inf, 204, 204, +inf, 204]
[2024-05-25 16:40:06] [INFO ] Invariant cache hit.
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:40:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
[2024-05-25 16:40:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-25 16:40:06] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:06] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:06] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:06] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:06] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:06] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:06] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:40:07] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:07] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 6 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned unsat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned unsat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:40:07] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:07] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:07] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:07] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:40:07] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:40:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-25 16:40:07] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:40:07] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 19 ms.
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 9 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 13 ms returned unsat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:40:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:07] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:08] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:08] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:08] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:08] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:08] [INFO ] [Nat]Absence check using state equation in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 193, 201, 201, 1, 201, 3, 199, 3, 197, 201, 1, 201] Max Struct:[+inf, +inf, +inf, +inf, 204, 201, 201, +inf, 201, +inf, 204, +inf, 204, 201, +inf, 201]
FORMULA Murphy-PT-D3N050-UpperBounds-15 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-13 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-08 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-06 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Murphy-PT-D3N050-UpperBounds-05 201 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 7 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 24/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {13=1, 17=1, 25=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 11) seen :[2, 3, 3, 2, 53, 1, 3, 58, 3, 58, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 16:40:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000029 steps (2 resets) in 453 ms. (2202 steps per ms)
BEST_FIRST walk for 11000008 steps (22 resets) in 4453 ms. (2469 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 16:40:13] [INFO ] Invariant cache hit.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:40:13] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
[2024-05-25 16:40:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:40:13] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:13] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:13] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:13] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:13] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:13] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:13] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 9 ms returned sat
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:40:13] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 12 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:13] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:13] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:14] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2024-05-25 16:40:14] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 8 ms returned sat
[2024-05-25 16:40:14] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:40:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-25 16:40:14] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:14] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 18 ms.
[2024-05-25 16:40:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:14] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:14] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 0 ms returned sat
[2024-05-25 16:40:14] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:14] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:14] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:14] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 197, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 24 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 24/24 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 24/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:40:14] [INFO ] Invariant cache hit.
[2024-05-25 16:40:14] [INFO ] Implicit Places using invariants in 38 ms returned [8, 9, 10, 11]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 20/24 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 43 ms. Remains : 20/24 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :[2, 3, 3, 2, 53, 1, 3, 62, 3, 52, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:40:14] [INFO ] Computed 1 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 1000018 steps (2 resets) in 405 ms. (2463 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 4000 ms. (2749 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
[2024-05-25 16:40:18] [INFO ] Invariant cache hit.
[2024-05-25 16:40:18] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:18] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:18] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:18] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:18] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:18] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:18] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:18] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 5 ms.
[2024-05-25 16:40:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:18] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:19] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:40:19] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:19] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:19] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:19] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:19] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 19 ms.
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:19] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:19] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:19] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:19] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:19] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:40:19] [INFO ] Invariant cache hit.
[2024-05-25 16:40:19] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-25 16:40:19] [INFO ] Invariant cache hit.
[2024-05-25 16:40:19] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:19] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-25 16:40:19] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:19] [INFO ] Invariant cache hit.
[2024-05-25 16:40:19] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 194 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 362ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 362ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. Remains : 20/20 places, 28/28 transitions.
Found an invariant !
This invariant on transitions {14=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {13=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 11) seen :[2, 3, 3, 2, 62, 1, 3, 55, 3, 53, 1]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
RANDOM walk for 40053 steps (8 resets) in 793 ms. (50 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 192494 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :0 out of 14
Probabilistic random walk after 192494 steps, saw 129909 distinct states, run finished after 3008 ms. (steps per millisecond=63 ) properties seen :0
[2024-05-25 16:40:24] [INFO ] Invariant cache hit.
[2024-05-25 16:40:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-05-25 16:40:24] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
Problem MAX4 is UNSAT
Problem MAX7 is UNSAT
Problem MAX9 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 5/48 variables, 4/28 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 2/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 3 solved, 11 unsolved in 195 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 3 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 5/29 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/29 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 5/48 variables, 4/33 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 2/35 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 6/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/41 constraints. Problems are: Problem set: 3 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 41 constraints, problems are : Problem set: 3 solved, 11 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/14 constraints, Known Traps: 1/1 constraints]
After SMT, in 388ms problems are : Problem set: 3 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6420 ms.
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:30] [INFO ] Invariant cache hit.
[2024-05-25 16:40:30] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 162 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 322ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 322ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 328 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40069 steps (8 resets) in 71 ms. (556 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 229705 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 11
Probabilistic random walk after 229705 steps, saw 155462 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-05-25 16:40:34] [INFO ] Invariant cache hit.
[2024-05-25 16:40:34] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-05-25 16:40:34] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 5/48 variables, 4/28 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 2/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 11 unsolved in 161 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 5/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 27/43 variables, 16/18 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 6/24 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 5/48 variables, 4/33 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/48 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 6/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 41 constraints, problems are : Problem set: 0 solved, 11 unsolved in 172 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 1/1 constraints]
After SMT, in 338ms problems are : Problem set: 0 solved, 11 unsolved
Fused 11 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6510 ms.
Support contains 11 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:40:41] [INFO ] Invariant cache hit.
[2024-05-25 16:40:41] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-25 16:40:41] [INFO ] Invariant cache hit.
[2024-05-25 16:40:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:41] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
[2024-05-25 16:40:41] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:41] [INFO ] Invariant cache hit.
[2024-05-25 16:40:41] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 311ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 311ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 395 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running SMT prover for 11 properties.
[2024-05-25 16:40:41] [INFO ] Invariant cache hit.
[2024-05-25 16:40:41] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:41] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2024-05-25 16:40:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:41] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :11
[2024-05-25 16:40:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:41] [INFO ] After 28ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :11
TRAPS : Iteration 0
[2024-05-25 16:40:41] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-25 16:40:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-25 16:40:41] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-25 16:40:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
TRAPS : Iteration 1
[2024-05-25 16:40:41] [INFO ] After 139ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :11
[2024-05-25 16:40:41] [INFO ] After 229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :11
Over-approximation ignoring read arcs solved 0 properties in 290 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 3, 3, 2, 199, 1, 3, 199, 3, 197, 1] Max Struct:[+inf, +inf, +inf, +inf, 204, +inf, +inf, 204, +inf, 204, +inf]
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-25 16:40:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10030 steps (2 resets) in 5 ms. (1671 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:40:41] [INFO ] Invariant cache hit.
[2024-05-25 16:40:41] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:41] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:41] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:41] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:41] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:41] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:41] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 6 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:40:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 37 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 78ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 78ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:40:42] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 239 ms. (4166 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 247 ms. (4032 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:40:42] [INFO ] Invariant cache hit.
[2024-05-25 16:40:42] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:42] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:40:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:42] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:40:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:40:42] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:40:42] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:40:42] [INFO ] Invariant cache hit.
[2024-05-25 16:40:42] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 16:40:42] [INFO ] Invariant cache hit.
[2024-05-25 16:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:42] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-25 16:40:42] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:40:42] [INFO ] Invariant cache hit.
[2024-05-25 16:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 6 ms. (steps per millisecond=2 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-00 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-00 in 938 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-01
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:40:42] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10020 steps (2 resets) in 4 ms. (2004 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:42] [INFO ] Invariant cache hit.
[2024-05-25 16:40:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:42] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:42] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:42] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:42] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:40:42] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:42] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 0 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:40:42] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:40:42] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 241 ms. (4132 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 192 ms. (5181 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:43] [INFO ] Invariant cache hit.
[2024-05-25 16:40:43] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:43] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:40:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:43] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:40:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:40:43] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:43] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:40:43] [INFO ] Invariant cache hit.
[2024-05-25 16:40:43] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-25 16:40:43] [INFO ] Invariant cache hit.
[2024-05-25 16:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:43] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-25 16:40:43] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:40:43] [INFO ] Invariant cache hit.
[2024-05-25 16:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 71ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 71ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 17 ms. (2222 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-01 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-01 in 864 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:40:43] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10027 steps (2 resets) in 4 ms. (2005 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:43] [INFO ] Invariant cache hit.
[2024-05-25 16:40:43] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 16:40:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:40:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:40:43] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:43] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:43] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:43] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:40:43] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:40:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 35 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 67ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 67ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:43] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 237 ms. (4201 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 193 ms. (5154 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:44] [INFO ] Invariant cache hit.
[2024-05-25 16:40:44] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:44] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:44] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:40:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:44] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:40:44] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:40:44] [INFO ] Invariant cache hit.
[2024-05-25 16:40:44] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 16:40:44] [INFO ] Invariant cache hit.
[2024-05-25 16:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:44] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-25 16:40:44] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:40:44] [INFO ] Invariant cache hit.
[2024-05-25 16:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 39 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-02 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-02 in 856 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:40:44] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10038 steps (2 resets) in 4 ms. (2007 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:40:44] [INFO ] Invariant cache hit.
[2024-05-25 16:40:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:40:44] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:40:44] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:44] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:44] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:44] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:40:44] [INFO ] Computed 0 invariants in 2 ms
[2024-05-25 16:40:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:40:44] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 236 ms. (4219 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 191 ms. (5208 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:40:45] [INFO ] Invariant cache hit.
[2024-05-25 16:40:45] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:45] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:45] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:40:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:45] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:40:45] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 4 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:40:45] [INFO ] Invariant cache hit.
[2024-05-25 16:40:45] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 16:40:45] [INFO ] Invariant cache hit.
[2024-05-25 16:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:45] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-25 16:40:45] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:40:45] [INFO ] Invariant cache hit.
[2024-05-25 16:40:45] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 74ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-03 2 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-03 in 866 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-04
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:40:45] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[69] Max Struct:[204]
[2024-05-25 16:40:45] [INFO ] Invariant cache hit.
[2024-05-25 16:40:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:45] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:45] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:45] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:45] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:45] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:45] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 32 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[69] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[189] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:45] [INFO ] Invariant cache hit.
[2024-05-25 16:40:45] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 156 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 305ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 305ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 306 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 16:40:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[189] Max Struct:[204]
RANDOM walk for 1000000 steps (2 resets) in 353 ms. (2824 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 333 ms. (2994 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[189] Max Struct:[204]
[2024-05-25 16:40:46] [INFO ] Invariant cache hit.
[2024-05-25 16:40:46] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:46] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:46] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:46] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 16:40:46] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:46] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[189] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:40:46] [INFO ] Invariant cache hit.
[2024-05-25 16:40:46] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 16:40:46] [INFO ] Invariant cache hit.
[2024-05-25 16:40:46] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:46] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2024-05-25 16:40:46] [INFO ] Redundant transitions in 1 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:46] [INFO ] Invariant cache hit.
[2024-05-25 16:40:46] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 132 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 277ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 279ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 351 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 16:40:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[199] Max Struct:[204]
RANDOM walk for 1000001 steps (2 resets) in 366 ms. (2724 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 340 ms. (2932 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[199] Max Struct:[204]
[2024-05-25 16:40:47] [INFO ] Invariant cache hit.
[2024-05-25 16:40:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:47] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:47] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:47] [INFO ] [Nat]Added 8 Read/Feed constraints in 6 ms returned sat
[2024-05-25 16:40:47] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:47] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[199] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[199] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:40:47] [INFO ] Invariant cache hit.
[2024-05-25 16:40:47] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 16:40:47] [INFO ] Invariant cache hit.
[2024-05-25 16:40:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:47] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-25 16:40:47] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:47] [INFO ] Invariant cache hit.
[2024-05-25 16:40:47] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 295ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 296ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 360 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40159 steps (8 resets) in 29 ms. (1338 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 588215 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 2
Probabilistic random walk after 588215 steps, saw 399111 distinct states, run finished after 3003 ms. (steps per millisecond=195 ) properties seen :0
[2024-05-25 16:40:51] [INFO ] Invariant cache hit.
[2024-05-25 16:40:51] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 16:40:51] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 72 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 139ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 31 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:51] [INFO ] Invariant cache hit.
[2024-05-25 16:40:51] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 148 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 157 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 311ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 313 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40071 steps (8 resets) in 34 ms. (1144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2292612 steps, run timeout after 3001 ms. (steps per millisecond=763 ) properties seen :0 out of 1
Probabilistic random walk after 2292612 steps, saw 1559518 distinct states, run finished after 3001 ms. (steps per millisecond=763 ) properties seen :0
[2024-05-25 16:40:54] [INFO ] Invariant cache hit.
[2024-05-25 16:40:54] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 16:40:54] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 70 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 125ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 33 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:40:54] [INFO ] Invariant cache hit.
[2024-05-25 16:40:54] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 16:40:54] [INFO ] Invariant cache hit.
[2024-05-25 16:40:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:55] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-25 16:40:55] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:55] [INFO ] Invariant cache hit.
[2024-05-25 16:40:55] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 139 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 152 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 371 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2024-05-25 16:40:55] [INFO ] Computed 1 invariants in 4 ms
[2024-05-25 16:40:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:55] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:40:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:55] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:40:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 16:40:55] [INFO ] After 3ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 16:40:55] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:40:55] [INFO ] After 30ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 60 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[199] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-04 in 9941 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:40:55] [INFO ] Computed 1 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10032 steps (2 resets) in 5 ms. (1672 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:40:55] [INFO ] Invariant cache hit.
[2024-05-25 16:40:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:40:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:55] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:55] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:55] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:55] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:55] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.1 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 2 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:40:55] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 16:40:55] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 45 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 76ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 76ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:40:55] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 262 ms. (3802 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 199 ms. (5000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:40:56] [INFO ] Invariant cache hit.
[2024-05-25 16:40:56] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:56] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:56] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:40:56] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:56] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:56] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:40:56] [INFO ] Invariant cache hit.
[2024-05-25 16:40:56] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 16:40:56] [INFO ] Invariant cache hit.
[2024-05-25 16:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:56] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2024-05-25 16:40:56] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:40:56] [INFO ] Invariant cache hit.
[2024-05-25 16:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 64 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 46 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 113ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-07 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-07 in 1055 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:40:56] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10019 steps (2 resets) in 5 ms. (1669 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:56] [INFO ] Invariant cache hit.
[2024-05-25 16:40:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:40:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:56] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:56] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:56] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:56] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:56] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:40:56] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:40:56] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 232 ms. (4291 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 187 ms. (5319 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:40:57] [INFO ] Invariant cache hit.
[2024-05-25 16:40:57] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:40:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:57] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:57] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:40:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:57] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:57] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:40:57] [INFO ] Invariant cache hit.
[2024-05-25 16:40:57] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 16:40:57] [INFO ] Invariant cache hit.
[2024-05-25 16:40:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:40:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-25 16:40:57] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:40:57] [INFO ] Invariant cache hit.
[2024-05-25 16:40:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 65ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 65ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-09 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-09 in 859 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:40:57] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10024 steps (2 resets) in 6 ms. (1432 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[73] Max Struct:[204]
[2024-05-25 16:40:57] [INFO ] Invariant cache hit.
[2024-05-25 16:40:57] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:57] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:57] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:57] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:57] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:57] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:40:57] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 28 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[73] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[170] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:57] [INFO ] Invariant cache hit.
[2024-05-25 16:40:57] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 146 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 285ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 285ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 286 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 16:40:57] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[170] Max Struct:[204]
RANDOM walk for 1000014 steps (2 resets) in 361 ms. (2762 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 341 ms. (2923 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[170] Max Struct:[204]
[2024-05-25 16:40:58] [INFO ] Invariant cache hit.
[2024-05-25 16:40:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:58] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:40:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:58] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:40:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:58] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:40:58] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:58] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[170] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[189] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:40:58] [INFO ] Invariant cache hit.
[2024-05-25 16:40:58] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 16:40:58] [INFO ] Invariant cache hit.
[2024-05-25 16:40:58] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:58] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-05-25 16:40:58] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:58] [INFO ] Invariant cache hit.
[2024-05-25 16:40:58] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 164 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 302ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 16:40:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[189] Max Struct:[204]
RANDOM walk for 1000002 steps (2 resets) in 367 ms. (2717 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 333 ms. (2994 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[189] Max Struct:[204]
[2024-05-25 16:40:59] [INFO ] Invariant cache hit.
[2024-05-25 16:40:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:40:59] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:59] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:40:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:40:59] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:40:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:59] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:40:59] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:40:59] [INFO ] Added : 2 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[189] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[189] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:40:59] [INFO ] Invariant cache hit.
[2024-05-25 16:40:59] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-25 16:40:59] [INFO ] Invariant cache hit.
[2024-05-25 16:40:59] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:40:59] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-25 16:40:59] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:40:59] [INFO ] Invariant cache hit.
[2024-05-25 16:40:59] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 153 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 296ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 297ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 377 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40085 steps (8 resets) in 59 ms. (668 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 633576 steps, run timeout after 3001 ms. (steps per millisecond=211 ) properties seen :0 out of 2
Probabilistic random walk after 633576 steps, saw 429486 distinct states, run finished after 3001 ms. (steps per millisecond=211 ) properties seen :0
[2024-05-25 16:41:03] [INFO ] Invariant cache hit.
[2024-05-25 16:41:03] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 16:41:03] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 66 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 122ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 27 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 16:41:03] [INFO ] Invariant cache hit.
[2024-05-25 16:41:03] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 154 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 294ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 294ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 295 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40060 steps (8 resets) in 27 ms. (1430 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2296325 steps, run timeout after 3001 ms. (steps per millisecond=765 ) properties seen :0 out of 1
Probabilistic random walk after 2296325 steps, saw 1562206 distinct states, run finished after 3001 ms. (steps per millisecond=765 ) properties seen :0
[2024-05-25 16:41:06] [INFO ] Invariant cache hit.
[2024-05-25 16:41:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 16:41:06] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 0 solved, 1 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 122ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 29 ms.
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:41:06] [INFO ] Invariant cache hit.
[2024-05-25 16:41:06] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 16:41:06] [INFO ] Invariant cache hit.
[2024-05-25 16:41:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:41:06] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
[2024-05-25 16:41:06] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:41:06] [INFO ] Invariant cache hit.
[2024-05-25 16:41:06] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 138 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 150 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 292ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 292ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 20/20 places, 28/28 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 48 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 16 output transitions
Drop transitions (Output transitions of discarded places.) removed 16 transitions
Applied a total of 1 rules in 0 ms. Remains 8 /20 variables (removed 12) and now considering 12/28 (removed 16) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 8 cols
[2024-05-25 16:41:07] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 16:41:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:41:07] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:41:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:41:07] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:41:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-25 16:41:07] [INFO ] After 2ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 16:41:07] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:41:07] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 54 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[189] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-10 in 9897 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[3] Max Struct:[+inf]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:41:07] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:41:07] [INFO ] Invariant cache hit.
[2024-05-25 16:41:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:41:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:41:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:41:07] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:41:07] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:41:07] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:41:07] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:41:07] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:41:07] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 16:41:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:41:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 257 ms. (3875 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 231 ms. (4310 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:41:07] [INFO ] Invariant cache hit.
[2024-05-25 16:41:07] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:41:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:41:07] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:41:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:41:07] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:41:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:41:07] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:41:07] [INFO ] Added : 3 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:41:07] [INFO ] Invariant cache hit.
[2024-05-25 16:41:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 16:41:07] [INFO ] Invariant cache hit.
[2024-05-25 16:41:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:41:07] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-25 16:41:07] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:41:07] [INFO ] Invariant cache hit.
[2024-05-25 16:41:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 72ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 73ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 25 ms. (1538 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-11 3 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-11 in 916 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[204]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[204]
// Phase 1: matrix 28 rows 20 cols
[2024-05-25 16:41:08] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[204]
RANDOM walk for 10047 steps (2 resets) in 5 ms. (1674 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[89] Max Struct:[204]
[2024-05-25 16:41:08] [INFO ] Invariant cache hit.
[2024-05-25 16:41:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:41:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:41:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:41:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:41:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:41:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:41:08] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:41:08] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:41:08] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[89] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Running 16 sub problems to find dead transitions.
[2024-05-25 16:41:08] [INFO ] Invariant cache hit.
[2024-05-25 16:41:08] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 155 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 302ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 303ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 304 ms. Remains : 20/20 places, 28/28 transitions.
[2024-05-25 16:41:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[197] Max Struct:[204]
RANDOM walk for 1000032 steps (2 resets) in 349 ms. (2857 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 337 ms. (2958 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[197] Max Struct:[204]
[2024-05-25 16:41:09] [INFO ] Invariant cache hit.
[2024-05-25 16:41:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:41:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:41:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:41:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:41:09] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:41:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:41:09] [INFO ] [Nat]Added 8 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:41:09] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:41:09] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[197] Max Struct:[204]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[197] Max Struct:[204]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 20/20 places, 28/28 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 28/28 (removed 0) transitions.
[2024-05-25 16:41:09] [INFO ] Invariant cache hit.
[2024-05-25 16:41:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-05-25 16:41:09] [INFO ] Invariant cache hit.
[2024-05-25 16:41:09] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:41:09] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2024-05-25 16:41:09] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2024-05-25 16:41:09] [INFO ] Invariant cache hit.
[2024-05-25 16:41:09] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/48 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 29 constraints, problems are : Problem set: 0 solved, 16 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 4/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 28/44 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/44 variables, 8/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/44 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 4/48 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/48 variables, 16/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/48 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 45 constraints, problems are : Problem set: 0 solved, 16 unsolved in 144 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints]
After SMT, in 290ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 291ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 20/20 places, 28/28 transitions.
RANDOM walk for 40061 steps (8 resets) in 50 ms. (785 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 612620 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 2
Probabilistic random walk after 612620 steps, saw 415247 distinct states, run finished after 3002 ms. (steps per millisecond=204 ) properties seen :0
[2024-05-25 16:41:12] [INFO ] Invariant cache hit.
[2024-05-25 16:41:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 16:41:12] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/48 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 30 constraints, problems are : Problem set: 1 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 7/8 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 12/20 variables, 8/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/28 variables, 4/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 4/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/28 variables, 0/18 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 20/48 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/48 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/48 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 31 constraints, problems are : Problem set: 1 solved, 1 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 20/20 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 107ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 300 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=150 )
Parikh walk visited 1 properties in 6 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[197] Max Struct:[204]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-12 in 4758 ms.
Starting property specific reduction for Murphy-PT-D3N050-UpperBounds-14
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
[2024-05-25 16:41:12] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10040 steps (2 resets) in 5 ms. (1673 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 5 ms. (1666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:41:12] [INFO ] Invariant cache hit.
[2024-05-25 16:41:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:41:12] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:41:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:41:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:41:12] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:41:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-25 16:41:12] [INFO ] [Nat]Added 8 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:41:12] [INFO ] Computed and/alt/rep : 16/40/16 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:41:12] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 20 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20/20 places, 28/28 transitions.
Graph (complete) has 56 edges and 20 vertex of which 3 are kept as prefixes of interest. Removing 17 places using SCC suffix rule.0 ms
Discarding 17 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 3 transition count 4
Applied a total of 2 rules in 1 ms. Remains 3 /20 variables (removed 17) and now considering 4/28 (removed 24) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:41:12] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:41:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 3/20 places, 4/28 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:41:13] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 229 ms. (4347 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 189 ms. (5263 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:41:13] [INFO ] Invariant cache hit.
[2024-05-25 16:41:13] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:41:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:41:13] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:41:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:41:13] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:41:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:41:13] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:41:13] [INFO ] Added : 3 causal constraints over 2 iterations in 7 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:41:13] [INFO ] Invariant cache hit.
[2024-05-25 16:41:13] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 16:41:13] [INFO ] Invariant cache hit.
[2024-05-25 16:41:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:41:13] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
[2024-05-25 16:41:13] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:41:13] [INFO ] Invariant cache hit.
[2024-05-25 16:41:13] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 68ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 2 ms. (steps per millisecond=7 ) properties seen :0
FORMULA Murphy-PT-D3N050-UpperBounds-14 1 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for Murphy-PT-D3N050-UpperBounds-14 in 845 ms.
[2024-05-25 16:41:13] [INFO ] Flatten gal took : 19 ms
[2024-05-25 16:41:13] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-05-25 16:41:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 28 transitions and 92 arcs took 5 ms.
Total runtime 77624 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Murphy-PT-D3N050

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1643
MODEL NAME: /home/mcc/execution/412/model
20 places, 28 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716655618419

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

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

ERROR: std::bad_alloc

Error in allocating array of size 33554432 at unique_table.cc, line 313
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is Murphy-PT-D3N050, 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 r245-tall-171654349600317"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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