MCC'2024- Execution of r245-tall-171654349700325

About the Execution of GreatSPN+red for Murphy-PT-D4N025

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15143.932	313447.00	1066395.00	209.90	130 2 3 130 130 1 2 2 ? 130 ? 130 130 1 1 2	normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r245-tall-171654349700325.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-D4N025, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654349700325
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.2K Apr 11 22:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 22:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Apr 11 22:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 22:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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.0K May 6 10:02 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 6 10:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 11 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 11 22:52 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 19K 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-D4N025-UpperBounds-00
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-01
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-02
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-03
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-04
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-05
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-06
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-07
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-08
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-09
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-10
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-11
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-12
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-13
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-14
FORMULA_NAME Murphy-PT-D4N025-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716655502130

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-D4N025
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 16:45:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-25 16:45:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 16:45:03] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-25 16:45:03] [INFO ] Transformed 30 places.
[2024-05-25 16:45:03] [INFO ] Transformed 35 transitions.
[2024-05-25 16:45:03] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 165 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 ms.
Current structural bounds on expressions (Initially) : Max Seen:[1, 0, 3, 1, 1, 0, 0, 0, 25, 1, 25, 1, 1, 0, 0, 0] 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:[1, 0, 3, 1, 1, 0, 0, 0, 25, 1, 25, 1, 1, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 35 rows 30 cols
[2024-05-25 16:45:03] [INFO ] Computed 6 invariants in 13 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 0, 3, 1, 1, 0, 0, 0, 25, 1, 25, 1, 1, 0, 0, 0] Max Struct:[130, +inf, +inf, 130, 130, +inf, +inf, +inf, 130, 130, 130, 130, 130, +inf, +inf, +inf]
RANDOM walk for 10011 steps (2 resets) in 32 ms. (303 steps per ms)
BEST_FIRST walk for 160015 steps (32 resets) in 140 ms. (1134 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[72, 2, 3, 66, 72, 1, 2, 2, 58, 59, 62, 66, 62, 1, 1, 2] Max Struct:[130, +inf, +inf, 130, 130, +inf, +inf, +inf, 130, 130, 130, 130, 130, +inf, +inf, +inf]
[2024-05-25 16:45:03] [INFO ] Invariant cache hit.
[2024-05-25 16:45:03] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-25 16:45:03] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-25 16:45:03] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-25 16:45:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:03] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:03] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 16:45:03] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-25 16:45:03] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:03] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 16:45:04] [INFO ] Added : 0 causal constraints over 0 iterations in 18 ms. Result :sat
Minimization took 16 ms.
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:04] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive place invariants in 30 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Added 10 Read/Feed constraints in 17 ms returned sat
[2024-05-25 16:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:04] [INFO ] Added : 3 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:04] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 18 ms.
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive place invariants in 24 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 24 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-25 16:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 11 ms returned sat
[2024-05-25 16:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 16:45:04] [INFO ] Added : 0 causal constraints over 0 iterations in 20 ms. Result :sat
Minimization took 11 ms.
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:04] [INFO ] Added : 1 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 16:45:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:04] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 13 ms to minimize.
[2024-05-25 16:45:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-25 16:45:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 11 ms.
[2024-05-25 16:45:04] [INFO ] Added : 3 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
[2024-05-25 16:45:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-25 16:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 16:45:05] [INFO ] Added : 3 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:45:05] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 16:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-05-25 16:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:45:05] [INFO ] Added : 0 causal constraints over 0 iterations in 7 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-25 16:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 16:45:05] [INFO ] Added : 0 causal constraints over 0 iterations in 21 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 16:45:05] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 10 ms.
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 16:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:45:05] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-05-25 16:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:05] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:05] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:06] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:06] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:06] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:06] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:06] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:45:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:06] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-25 16:45:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-25 16:45:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:45:06] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[72, 2, 3, 66, 72, 1, 2, 2, 58, 59, 62, 66, 62, 1, 1, 2] Max Struct:[130, +inf, +inf, 130, 130, +inf, +inf, +inf, 130, 130, 130, 130, 130, +inf, +inf, +inf]
FORMULA Murphy-PT-D4N025-UpperBounds-12 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-11 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-03 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-09 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-04 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA Murphy-PT-D4N025-UpperBounds-00 130 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 2, 2, 82, 80, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 13 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:06] [INFO ] Invariant cache hit.
[2024-05-25 16:45:06] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/65 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/65 variables, and 46 constraints, problems are : Problem set: 0 solved, 20 unsolved in 444 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (OVERLAPS) 5/25 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 35/60 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/60 variables, 10/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/60 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (OVERLAPS) 5/65 variables, 5/46 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/65 variables, and 66 constraints, problems are : Problem set: 0 solved, 20 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 30/30 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 800ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 808ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 834 ms. Remains : 30/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1, 24=1, 34=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 1 ms.
This minimized invariant on transitions {17=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 33, 36, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 82, 80, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-05-25 16:45:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 82, 80, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 648 ms. (1540 steps per ms)
BEST_FIRST walk for 10000006 steps (20 resets) in 4739 ms. (2109 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 2, 2, 82, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-05-25 16:45:12] [INFO ] Invariant cache hit.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:13] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:13] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:13] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 ms.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 16:45:13] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
[2024-05-25 16:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 27 ms
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 16:45:13] [INFO ] Added : 3 causal constraints over 1 iterations in 13 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 0 ms to minimize.
[2024-05-25 16:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:45:13] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-25 16:45:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:45:13] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:45:13] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:13] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:13] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:13] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:13] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 16:45:13] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:14] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:14] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:14] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 16:45:14] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:45:14] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:14] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:45:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-05-25 16:45:14] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:14] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1, 2, 2, 82, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 2, 2, 128, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Support contains 10 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 5 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:14] [INFO ] Invariant cache hit.
[2024-05-25 16:45:14] [INFO ] Implicit Places using invariants in 40 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 43 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51 ms. Remains : 25/30 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 26, 26, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 128, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 16:45:14] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 128, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 1000008 steps (2 resets) in 630 ms. (1584 steps per ms)
BEST_FIRST walk for 10000010 steps (20 resets) in 4084 ms. (2447 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 2, 2, 128, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-05-25 16:45:19] [INFO ] Invariant cache hit.
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-25 16:45:19] [INFO ] Added : 2 causal constraints over 1 iterations in 14 ms. Result :sat
Minimization took 13 ms.
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:19] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:19] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 16:45:19] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:45:19] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 11 ms.
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 16:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:19] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-25 16:45:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-05-25 16:45:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:19] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-25 16:45:19] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 9 ms.
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:19] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:19] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:20] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-05-25 16:45:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:20] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2024-05-25 16:45:20] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:20] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:20] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:20] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:20] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1, 2, 2, 128, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2, 3, 1, 2, 2, 128, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Support contains 10 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:20] [INFO ] Invariant cache hit.
[2024-05-25 16:45:20] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-25 16:45:20] [INFO ] Invariant cache hit.
[2024-05-25 16:45:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:20] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-25 16:45:20] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:20] [INFO ] Invariant cache hit.
[2024-05-25 16:45:20] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 269 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 524ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 525ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 632 ms. Remains : 25/25 places, 35/35 transitions.
Found an invariant !
This invariant on transitions {19=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {19=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 10) seen :[2, 3, 1, 2, 2, 40, 27, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 128, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 40036 steps (8 resets) in 983 ms. (40 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 68 ms. (579 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 107 ms. (370 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 458273 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 12
Probabilistic random walk after 458273 steps, saw 317660 distinct states, run finished after 3007 ms. (steps per millisecond=152 ) properties seen :0
[2024-05-25 16:45:25] [INFO ] Invariant cache hit.
[2024-05-25 16:45:25] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-25 16:45:25] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 2 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 10/60 variables, 7/37 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 2 solved, 10 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 2 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 4/34 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 7/41 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 6/47 constraints. Problems are: Problem set: 2 solved, 10 unsolved
[2024-05-25 16:45:25] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/48 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/48 constraints. Problems are: Problem set: 2 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 48 constraints, problems are : Problem set: 2 solved, 10 unsolved in 205 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/12 constraints, Known Traps: 2/2 constraints]
After SMT, in 425ms problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 1420 ms.
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:27] [INFO ] Invariant cache hit.
[2024-05-25 16:45:27] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 259 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 222 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 502ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 502ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 504 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40028 steps (8 resets) in 114 ms. (348 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 25 ms. (1538 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 27 ms. (1428 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 351486 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 9
Probabilistic random walk after 351486 steps, saw 243541 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) properties seen :0
[2024-05-25 16:45:30] [INFO ] Invariant cache hit.
[2024-05-25 16:45:30] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 32/50 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 10/60 variables, 7/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 9 unsolved in 110 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 9/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-25 16:45:30] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 6/46 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-05-25 16:45:31] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-25 16:45:31] [INFO ] Deduced a trap composed of 2 places in 13 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 48 constraints, problems are : Problem set: 0 solved, 9 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 3/3 constraints]
After SMT, in 405ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 159 ms.
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 4 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:31] [INFO ] Invariant cache hit.
[2024-05-25 16:45:31] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 16:45:31] [INFO ] Invariant cache hit.
[2024-05-25 16:45:31] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:31] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
[2024-05-25 16:45:31] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:31] [INFO ] Invariant cache hit.
[2024-05-25 16:45:31] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 355 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 812ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 812ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 887 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running SMT prover for 9 properties.
[2024-05-25 16:45:32] [INFO ] Invariant cache hit.
[2024-05-25 16:45:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:32] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2024-05-25 16:45:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:32] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2024-05-25 16:45:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:32] [INFO ] After 16ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :9
TRAPS : Iteration 0
[2024-05-25 16:45:32] [INFO ] After 41ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
[2024-05-25 16:45:32] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Over-approximation ignoring read arcs solved 0 properties in 227 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 3, 1, 2, 2, 128, 88, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-01
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:45:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 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:[2] Max Struct:[+inf]
[2024-05-25 16:45:32] [INFO ] Invariant cache hit.
[2024-05-25 16:45:32] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:32] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:32] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-25 16:45:32] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:32] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:32] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 22 ms.
[2024-05-25 16:45:32] [INFO ] Added : 2 causal constraints over 1 iterations in 28 ms. Result :sat
Minimization took 17 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 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 5 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:45:32] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:45:32] [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 39 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 93ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 3/25 places, 4/35 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 52 ms. (steps per millisecond=192 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:45:32] [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 346 ms. (2881 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 274 ms. (3636 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:45:33] [INFO ] Invariant cache hit.
[2024-05-25 16:45:33] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:45:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:33] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:45:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:33] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:45:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:45:33] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:45:33] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 16 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 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:45:33] [INFO ] Invariant cache hit.
[2024-05-25 16:45:33] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 16:45:33] [INFO ] Invariant cache hit.
[2024-05-25 16:45:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:33] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-05-25 16:45:33] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:45:33] [INFO ] Invariant cache hit.
[2024-05-25 16:45:33] [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 27 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 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 146 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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 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 11 ms. (steps per millisecond=1 ) 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-D4N025-UpperBounds-01 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-D4N025-UpperBounds-01 in 1344 ms.
Starting property specific reduction for Murphy-PT-D4N025-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 35 rows 25 cols
[2024-05-25 16:45:33] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 10006 steps (2 resets) in 6 ms. (1429 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:45:33] [INFO ] Invariant cache hit.
[2024-05-25 16:45:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:33] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-25 16:45:33] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:33] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-05-25 16:45:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 12 ms returned sat
[2024-05-25 16:45:33] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:45:33] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:33] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:33] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 30 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:45:34] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:45:34] [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 36 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 63 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 117ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 3/25 places, 4/35 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:45:34] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 220 ms. (4524 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 176 ms. (5649 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-05-25 16:45:34] [INFO ] Invariant cache hit.
[2024-05-25 16:45:34] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:34] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:34] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:34] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:45:34] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:45:34] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:45:34] [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 2 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 2 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:45:34] [INFO ] Invariant cache hit.
[2024-05-25 16:45:34] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-25 16:45:34] [INFO ] Invariant cache hit.
[2024-05-25 16:45:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:34] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-25 16:45:34] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:45:34] [INFO ] Invariant cache hit.
[2024-05-25 16:45:34] [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 58 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 64 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 140ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 144ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 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 7 ms. (steps per millisecond=1428 ) 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 18 ms. (2105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 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 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-D4N025-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-D4N025-UpperBounds-02 in 1114 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-05
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 35 rows 25 cols
[2024-05-25 16:45:34] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10018 steps (2 resets) in 6 ms. (1431 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:45:34] [INFO ] Invariant cache hit.
[2024-05-25 16:45:34] [INFO ] [Real]Absence check using 1 positive place invariants in 6 ms returned sat
[2024-05-25 16:45:35] [INFO ] [Real]Absence check using state equation in 320 ms returned sat
[2024-05-25 16:45:35] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:35] [INFO ] [Real]Added 10 Read/Feed constraints in 34 ms returned sat
[2024-05-25 16:45:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:35] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:45:35] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:35] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:45:35] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 16 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:45:35] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:45:35] [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 60 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 45 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 118 ms. Remains : 3/25 places, 4/35 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:45:35] [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 183 ms. (5434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:45:35] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 16:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:36] [INFO ] [Real]Added 1 Read/Feed constraints in 12 ms returned sat
[2024-05-25 16:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:36] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:45:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:36] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:45:36] [INFO ] Added : 3 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 1 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:45:36] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 16:45:36] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:36] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-05-25 16:45:36] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:45:36] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [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 26 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 72ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 72ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 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 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 19 ms. (2000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 14 ms. (2666 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-D4N025-UpperBounds-05 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-D4N025-UpperBounds-05 in 1355 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-06
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 35 rows 25 cols
[2024-05-25 16:45:36] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10028 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:[2] Max Struct:[+inf]
[2024-05-25 16:45:36] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:36] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:36] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:36] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:36] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:45:36] [INFO ] Added : 2 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:45:36] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:45:36] [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 84ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 84ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 3/25 places, 4/35 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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:45:36] [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 231 ms. (4310 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 171 ms. (5813 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:45:36] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:36] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:36] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:45:36] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:45:36] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:45:36] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 1 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:45:36] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-05-25 16:45:36] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:36] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-25 16:45:36] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:45:36] [INFO ] Invariant cache hit.
[2024-05-25 16:45:36] [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 27 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 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 77ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 77ms
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 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 19 ms. (2000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 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 5 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 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-D4N025-UpperBounds-06 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-D4N025-UpperBounds-06 in 894 ms.
Starting property specific reduction for Murphy-PT-D4N025-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 35 rows 25 cols
[2024-05-25 16:45:37] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10001 steps (2 resets) in 6 ms. (1428 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:45:37] [INFO ] Invariant cache hit.
[2024-05-25 16:45:37] [INFO ] [Real]Absence check using 1 positive place invariants in 11 ms returned sat
[2024-05-25 16:45:37] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-25 16:45:37] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:37] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:37] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-05-25 16:45:37] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:37] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:37] [INFO ] Added : 2 causal constraints over 1 iterations in 23 ms. Result :sat
Minimization took 8 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:45:37] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:45:37] [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 60 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 119ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 120ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 120 ms. Remains : 3/25 places, 4/35 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]
[2024-05-25 16:45:37] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 254 ms. (3921 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 169 ms. (5882 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:45:37] [INFO ] Invariant cache hit.
[2024-05-25 16:45:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2024-05-25 16:45:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:37] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:45:37] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:38] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:45:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:45:38] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:45:38] [INFO ] Added : 2 causal constraints over 1 iterations in 14 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 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:45:38] [INFO ] Invariant cache hit.
[2024-05-25 16:45:38] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 16:45:38] [INFO ] Invariant cache hit.
[2024-05-25 16:45:38] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:45:38] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-25 16:45:38] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:45:38] [INFO ] Invariant cache hit.
[2024-05-25 16:45:38] [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 47 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 109 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 178ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 178ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 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 4 ms. (steps per millisecond=2500 ) 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 26 ms. (1481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 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-D4N025-UpperBounds-07 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-D4N025-UpperBounds-07 in 1276 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-08
Current structural bounds on expressions (Initially) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[25] Max Struct:[130]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[130]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 16:45:38] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
RANDOM walk for 10007 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[65] Max Struct:[130]
[2024-05-25 16:45:38] [INFO ] Invariant cache hit.
[2024-05-25 16:45:38] [INFO ] [Real]Absence check using 1 positive place invariants in 33 ms returned sat
[2024-05-25 16:45:38] [INFO ] [Real]Absence check using state equation in 225 ms returned sat
[2024-05-25 16:45:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:38] [INFO ] [Real]Added 10 Read/Feed constraints in 22 ms returned sat
[2024-05-25 16:45:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:38] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 16:45:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:38] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:45:38] [INFO ] Added : 0 causal constraints over 0 iterations in 4 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[65] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[79] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:38] [INFO ] Invariant cache hit.
[2024-05-25 16:45:38] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 842 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 1129ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 1129ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1130 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 16:45:39] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[79] Max Struct:[130]
RANDOM walk for 1000000 steps (2 resets) in 510 ms. (1956 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 366 ms. (2724 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[79] Max Struct:[130]
[2024-05-25 16:45:40] [INFO ] Invariant cache hit.
[2024-05-25 16:45:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:40] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:40] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:40] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:40] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:40] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:40] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:40] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:40] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[79] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:41] [INFO ] Invariant cache hit.
[2024-05-25 16:45:41] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 16:45:41] [INFO ] Invariant cache hit.
[2024-05-25 16:45:41] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:41] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
[2024-05-25 16:45:41] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:41] [INFO ] Invariant cache hit.
[2024-05-25 16:45:41] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 500ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 500ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 596 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 16:45:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[128] Max Struct:[130]
RANDOM walk for 1000000 steps (2 resets) in 484 ms. (2061 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 384 ms. (2597 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2024-05-25 16:45:42] [INFO ] Invariant cache hit.
[2024-05-25 16:45:42] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:42] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:42] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:42] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-05-25 16:45:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:42] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:42] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-25 16:45:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-25 16:45:42] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:45:42] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[128] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[128] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:42] [INFO ] Invariant cache hit.
[2024-05-25 16:45:42] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-25 16:45:42] [INFO ] Invariant cache hit.
[2024-05-25 16:45:42] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:42] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
[2024-05-25 16:45:42] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:42] [INFO ] Invariant cache hit.
[2024-05-25 16:45:42] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 450ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 451ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 540 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40016 steps (8 resets) in 44 ms. (889 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 44 ms. (888 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1318710 steps, run timeout after 3001 ms. (steps per millisecond=439 ) properties seen :0 out of 2
Probabilistic random walk after 1318710 steps, saw 920668 distinct states, run finished after 3001 ms. (steps per millisecond=439 ) properties seen :0
[2024-05-25 16:45:46] [INFO ] Invariant cache hit.
[2024-05-25 16:45:46] [INFO ] State equation strengthened by 10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 16:45:46] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 1 solved, 1 unsolved in 80 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 145ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:46] [INFO ] Invariant cache hit.
[2024-05-25 16:45:46] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 212 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 456ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 457ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40039 steps (8 resets) in 28 ms. (1380 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2322893 steps, run timeout after 3001 ms. (steps per millisecond=774 ) properties seen :0 out of 1
Probabilistic random walk after 2322893 steps, saw 1620570 distinct states, run finished after 3001 ms. (steps per millisecond=774 ) properties seen :0
[2024-05-25 16:45:49] [INFO ] Invariant cache hit.
[2024-05-25 16:45:49] [INFO ] State equation strengthened by 10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 16:45:49] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 86 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 147ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 30 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:50] [INFO ] Invariant cache hit.
[2024-05-25 16:45:50] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-25 16:45:50] [INFO ] Invariant cache hit.
[2024-05-25 16:45:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:50] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
[2024-05-25 16:45:50] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:50] [INFO ] Invariant cache hit.
[2024-05-25 16:45:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 198 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 433ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 434ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 518 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 60 edges and 25 vertex of which 10 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Applied a total of 1 rules in 0 ms. Remains 10 /25 variables (removed 15) and now considering 15/35 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-25 16:45:50] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 16:45:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:50] [INFO ] After 25ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:45:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-25 16:45:50] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:45:50] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 16:45:50] [INFO ] After 1ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 16:45:50] [INFO ] After 3ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:45:50] [INFO ] After 38ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 76 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[128] Max Struct:[130]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-08 in 12248 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[25] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[25] Max Struct:[130]
Current structural bounds on expressions (Before main loop) : Max Seen:[25] Max Struct:[130]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 16:45:50] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
RANDOM walk for 10006 steps (2 resets) in 6 ms. (1429 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 9 ms. (1000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[56] Max Struct:[130]
[2024-05-25 16:45:50] [INFO ] Invariant cache hit.
[2024-05-25 16:45:50] [INFO ] [Real]Absence check using 1 positive place invariants in 15 ms returned sat
[2024-05-25 16:45:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:50] [INFO ] Added : 0 causal constraints over 0 iterations in 5 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[56] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[79] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:50] [INFO ] Invariant cache hit.
[2024-05-25 16:45:50] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 265 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 608ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 608ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 16:45:51] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[79] Max Struct:[130]
RANDOM walk for 1000000 steps (2 resets) in 480 ms. (2079 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 415 ms. (2403 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[79] Max Struct:[130]
[2024-05-25 16:45:52] [INFO ] Invariant cache hit.
[2024-05-25 16:45:52] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:52] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:52] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:52] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-25 16:45:52] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:52] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:52] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[79] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[80] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:52] [INFO ] Invariant cache hit.
[2024-05-25 16:45:52] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-25 16:45:52] [INFO ] Invariant cache hit.
[2024-05-25 16:45:52] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:52] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2024-05-25 16:45:52] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:52] [INFO ] Invariant cache hit.
[2024-05-25 16:45:52] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 209 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 431ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 528 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 16:45:53] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[80] Max Struct:[130]
RANDOM walk for 1000029 steps (2 resets) in 485 ms. (2057 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 373 ms. (2673 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[98] Max Struct:[130]
[2024-05-25 16:45:53] [INFO ] Invariant cache hit.
[2024-05-25 16:45:53] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:45:53] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-25 16:45:53] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:53] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:53] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:53] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[98] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[98] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:53] [INFO ] Invariant cache hit.
[2024-05-25 16:45:54] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-25 16:45:54] [INFO ] Invariant cache hit.
[2024-05-25 16:45:54] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:54] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2024-05-25 16:45:54] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:54] [INFO ] Invariant cache hit.
[2024-05-25 16:45:54] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 227 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 507ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 508ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 594 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 16:45:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[98] Max Struct:[130]
RANDOM walk for 1000000 steps (2 resets) in 485 ms. (2057 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 369 ms. (2702 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[98] Max Struct:[130]
[2024-05-25 16:45:55] [INFO ] Invariant cache hit.
[2024-05-25 16:45:55] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:55] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:55] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:55] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:45:55] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:45:55] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 8 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[98] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[104] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:55] [INFO ] Invariant cache hit.
[2024-05-25 16:45:55] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 16:45:55] [INFO ] Invariant cache hit.
[2024-05-25 16:45:55] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:55] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-05-25 16:45:55] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:55] [INFO ] Invariant cache hit.
[2024-05-25 16:45:55] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 177 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 432ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 518 ms. Remains : 25/25 places, 35/35 transitions.
[2024-05-25 16:45:56] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[104] Max Struct:[130]
RANDOM walk for 1000020 steps (2 resets) in 499 ms. (2000 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 367 ms. (2717 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[104] Max Struct:[130]
[2024-05-25 16:45:56] [INFO ] Invariant cache hit.
[2024-05-25 16:45:56] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:56] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:45:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:45:57] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:45:57] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:45:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:57] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:45:57] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:45:57] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[104] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[104] Max Struct:[130]
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:45:57] [INFO ] Invariant cache hit.
[2024-05-25 16:45:57] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 16:45:57] [INFO ] Invariant cache hit.
[2024-05-25 16:45:57] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:45:57] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
[2024-05-25 16:45:57] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:45:57] [INFO ] Invariant cache hit.
[2024-05-25 16:45:57] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 473ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 474ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 555 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40013 steps (8 resets) in 34 ms. (1143 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1474354 steps, run timeout after 3001 ms. (steps per millisecond=491 ) properties seen :0 out of 2
Probabilistic random walk after 1474354 steps, saw 1029521 distinct states, run finished after 3001 ms. (steps per millisecond=491 ) properties seen :0
[2024-05-25 16:46:00] [INFO ] Invariant cache hit.
[2024-05-25 16:46:00] [INFO ] State equation strengthened by 10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-25 16:46:00] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 1 solved, 1 unsolved in 112 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 1 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 177ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-05-25 16:46:00] [INFO ] Invariant cache hit.
[2024-05-25 16:46:00] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 606ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 612ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 614 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40045 steps (8 resets) in 31 ms. (1251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2412867 steps, run timeout after 3001 ms. (steps per millisecond=804 ) properties seen :0 out of 1
Probabilistic random walk after 2412867 steps, saw 1683989 distinct states, run finished after 3001 ms. (steps per millisecond=804 ) properties seen :0
[2024-05-25 16:46:04] [INFO ] Invariant cache hit.
[2024-05-25 16:46:04] [INFO ] State equation strengthened by 10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-25 16:46:04] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 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) 9/10 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/10 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 15/25 variables, 10/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 10/35 variables, 5/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/35 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/35 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 25/60 variables, 15/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 38 constraints, problems are : Problem set: 0 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 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 17 ms.
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-05-25 16:46:04] [INFO ] Invariant cache hit.
[2024-05-25 16:46:04] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-25 16:46:04] [INFO ] Invariant cache hit.
[2024-05-25 16:46:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:46:04] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
[2024-05-25 16:46:04] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-05-25 16:46:04] [INFO ] Invariant cache hit.
[2024-05-25 16:46:04] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 0/60 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 36 constraints, problems are : Problem set: 0 solved, 20 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 5/20 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 35/55 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/55 variables, 10/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/55 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 5/60 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/60 variables, 20/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 56 constraints, problems are : Problem set: 0 solved, 20 unsolved in 213 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 430ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 430ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 494 ms. Remains : 25/25 places, 35/35 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 60 edges and 25 vertex of which 10 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 20 output transitions
Drop transitions (Output transitions of discarded places.) removed 20 transitions
Applied a total of 1 rules in 6 ms. Remains 10 /25 variables (removed 15) and now considering 15/35 (removed 20) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 15 rows 10 cols
[2024-05-25 16:46:05] [INFO ] Computed 1 invariants in 1 ms
[2024-05-25 16:46:05] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:46:05] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-25 16:46:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:46:05] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-25 16:46:05] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-25 16:46:05] [INFO ] After 3ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-25 16:46:05] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-25 16:46:05] [INFO ] After 47ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 90 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[104] Max Struct:[130]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-10 in 14604 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-13
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 35 rows 25 cols
[2024-05-25 16:46:05] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10023 steps (2 resets) in 6 ms. (1431 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:46:05] [INFO ] Invariant cache hit.
[2024-05-25 16:46:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:46:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 16:46:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:46:05] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:46:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:46:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:46:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:46:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:46:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 16:46:05] [INFO ] Added : 1 causal constraints over 1 iterations in 7 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.4 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 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 8 ms. Remains 3 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:46:05] [INFO ] Computed 0 invariants in 1 ms
[2024-05-25 16:46:05] [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 25 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 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 86 ms. Remains : 3/25 places, 4/35 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 :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:46:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[+inf]
RANDOM walk for 1000001 steps (2 resets) in 469 ms. (2127 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 175 ms. (5681 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:46:06] [INFO ] Invariant cache hit.
[2024-05-25 16:46:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:46:06] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:46:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:46:06] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:46:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-05-25 16:46:06] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:46:06] [INFO ] Added : 3 causal constraints over 2 iterations in 11 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 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:46:06] [INFO ] Invariant cache hit.
[2024-05-25 16:46:06] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-25 16:46:06] [INFO ] Invariant cache hit.
[2024-05-25 16:46:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:46:06] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-05-25 16:46:06] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:46:06] [INFO ] Invariant cache hit.
[2024-05-25 16:46:06] [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 32 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 107 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 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 31 ms. (1250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 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-D4N025-UpperBounds-13 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-D4N025-UpperBounds-13 in 1084 ms.
Starting property specific reduction for Murphy-PT-D4N025-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]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 16:46:06] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 6 ms. (1428 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:46:06] [INFO ] Invariant cache hit.
[2024-05-25 16:46:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:46:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-25 16:46:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:46:06] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:46:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:46:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-25 16:46:06] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-25 16:46:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:46:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 16:46:06] [INFO ] Added : 1 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 17 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:46:06] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:46:06] [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 31 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 75 ms. Remains : 3/25 places, 4/35 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 :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:46:06] [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 222 ms. (4484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 255 ms. (3906 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-05-25 16:46:07] [INFO ] Invariant cache hit.
[2024-05-25 16:46:07] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-05-25 16:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:46:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:46:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:46:07] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:46:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2024-05-25 16:46:07] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 16:46:07] [INFO ] Added : 3 causal constraints over 2 iterations in 3 ms. Result :sat
Minimization took 1 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 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 16:46:07] [INFO ] Invariant cache hit.
[2024-05-25 16:46:07] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-25 16:46:07] [INFO ] Invariant cache hit.
[2024-05-25 16:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:46:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-05-25 16:46:07] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:46:07] [INFO ] Invariant cache hit.
[2024-05-25 16:46: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 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 87ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 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 3 ms. (steps per millisecond=3333 ) 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 26 ms. (1481 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 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-D4N025-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-D4N025-UpperBounds-14 in 981 ms.
Starting property specific reduction for Murphy-PT-D4N025-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[+inf]
// Phase 1: matrix 35 rows 25 cols
[2024-05-25 16:46:07] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
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:[2] Max Struct:[+inf]
[2024-05-25 16:46:07] [INFO ] Invariant cache hit.
[2024-05-25 16:46:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:46:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:46:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:46:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-25 16:46:07] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-25 16:46:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-25 16:46:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:46:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:46:07] [INFO ] Added : 2 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 8 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 25 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Graph (complete) has 70 edges and 25 vertex of which 3 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 30 output transitions
Drop transitions (Output transitions of discarded places.) removed 30 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 /25 variables (removed 22) and now considering 4/35 (removed 31) transitions.
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 3 cols
[2024-05-25 16:46:07] [INFO ] Computed 0 invariants in 0 ms
[2024-05-25 16:46: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 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 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 3/25 places, 4/35 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 :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:46:07] [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 226 ms. (4405 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 170 ms. (5847 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-05-25 16:46:07] [INFO ] Invariant cache hit.
[2024-05-25 16:46:07] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:46:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:46:07] [INFO ] [Real]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-05-25 16:46:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 16:46:08] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-05-25 16:46:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-05-25 16:46:08] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 16:46:08] [INFO ] Added : 2 causal constraints over 1 iterations in 10 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 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:46:08] [INFO ] Invariant cache hit.
[2024-05-25 16:46:08] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-25 16:46:08] [INFO ] Invariant cache hit.
[2024-05-25 16:46:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-25 16:46:08] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-25 16:46:08] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 16:46:08] [INFO ] Invariant cache hit.
[2024-05-25 16:46:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 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 27 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 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 90ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 92ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 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 4 ms. (steps per millisecond=2500 ) 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 19 ms. (2000 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 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-D4N025-UpperBounds-15 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-D4N025-UpperBounds-15 in 910 ms.
[2024-05-25 16:46:08] [INFO ] Flatten gal took : 38 ms
[2024-05-25 16:46:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 16 ms.
[2024-05-25 16:46:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 35 transitions and 115 arcs took 4 ms.
Total runtime 65147 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Murphy-PT-D4N025

IS_COLORED=
IS_NUPN=

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

SAVING FILE /home/mcc/execution/413/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: 1544
MODEL NAME: /home/mcc/execution/413/model
25 places, 35 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 1716655815577

--------------------
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

MEDDLY ERROR: Insufficient memory

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-D4N025"
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-D4N025, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r245-tall-171654349700325"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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