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.r508-tall-171654351400325.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 ltsminxred
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 r508-tall-171654351400325
=====================================================================

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

Invoking MCC driver with
BK_TOOL=ltsminxred
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 ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 10:01:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 10:01:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 10:01:29] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2024-06-01 10:01:29] [INFO ] Transformed 30 places.
[2024-06-01 10:01:29] [INFO ] Transformed 35 transitions.
[2024-06-01 10:01:29] [INFO ] Parsed PT model containing 30 places and 35 transitions and 135 arcs in 160 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 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-06-01 10:01:29] [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 10000 steps (2 resets) in 27 ms. (357 steps per ms)
BEST_FIRST walk for 160015 steps (32 resets) in 156 ms. (1019 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[62, 2, 3, 60, 62, 1, 2, 2, 46, 64, 58, 60, 52, 1, 1, 2] Max Struct:[130, +inf, +inf, 130, 130, +inf, +inf, +inf, 130, 130, 130, 130, 130, +inf, +inf, +inf]
[2024-06-01 10:01:29] [INFO ] Invariant cache hit.
[2024-06-01 10:01:29] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 10:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 10:01:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:01:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:01:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:01:30] [INFO ] Added : 0 causal constraints over 0 iterations in 16 ms. Result :sat
Minimization took 13 ms.
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:01:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:30] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:30] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:30] [INFO ] Added : 0 causal constraints over 0 iterations in 9 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 10:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:30] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 10:01:30] [INFO ] Added : 1 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 34 ms to minimize.
[2024-06-01 10:01:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-01 10:01:30] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:30] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:01:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:01:31] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 10:01:31] [INFO ] Added : 3 causal constraints over 1 iterations in 16 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:01:31] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 5 ms returned sat
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:01:31] [INFO ] Added : 0 causal constraints over 0 iterations in 10 ms. Result :sat
Minimization took 12 ms.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 10:01:31] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:31] [INFO ] Added : 0 causal constraints over 0 iterations in 13 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:31] [INFO ] Added : 0 causal constraints over 0 iterations in 8 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:31] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:31] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:31] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-06-01 10:01:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 23 ms
[2024-06-01 10:01:31] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:31] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[62, 2, 3, 60, 62, 1, 2, 2, 46, 64, 58, 60, 52, 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, 81, 78, 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 9 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-06-01 10:01:32] [INFO ] Invariant cache hit.
[2024-06-01 10:01:32] [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 300 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 253 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 581ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 592ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 611 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 57 ms. (steps per millisecond=175 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 28, 29, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 81, 78, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-06-01 10:01:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 81, 78, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 1000004 steps (2 resets) in 625 ms. (1597 steps per ms)
BEST_FIRST walk for 10000008 steps (20 resets) in 4408 ms. (2268 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 2, 2, 81, 78, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-06-01 10:01:38] [INFO ] Invariant cache hit.
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:38] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:01:38] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:38] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:38] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:38] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:01:38] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-06-01 10:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-06-01 10:01:38] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:01:38] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-06-01 10:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 24 ms
[2024-06-01 10:01:38] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:38] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:38] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:38] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 0 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:38] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
[2024-06-01 10:01:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-06-01 10:01:38] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:38] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:38] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:39] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:39] [INFO ] Added : 1 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:39] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:39] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-06-01 10:01:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 25 ms
[2024-06-01 10:01:39] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:39] [INFO ] Added : 3 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2, 3, 1, 2, 2, 81, 78, 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, 124, 104, 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 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:01:39] [INFO ] Invariant cache hit.
[2024-06-01 10:01:39] [INFO ] Implicit Places using invariants in 33 ms returned [10, 11, 12, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 36 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 25/30 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 39 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 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 26, 33, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 124, 104, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
// Phase 1: matrix 35 rows 25 cols
[2024-06-01 10:01:39] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 124, 104, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 1000000 steps (2 resets) in 569 ms. (1754 steps per ms)
BEST_FIRST walk for 10000009 steps (20 resets) in 3981 ms. (2511 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 2, 2, 124, 104, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-06-01 10:01:43] [INFO ] Invariant cache hit.
[2024-06-01 10:01:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:44] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:44] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:44] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:44] [INFO ] Added : 2 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:44] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-06-01 10:01:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 21 ms
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:44] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:01:44] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 9 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:44] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:44] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:44] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:44] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:44] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:44] [INFO ] Added : 2 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, 124, 104, 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, 104, 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 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:01:44] [INFO ] Invariant cache hit.
[2024-06-01 10:01:44] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 10:01:44] [INFO ] Invariant cache hit.
[2024-06-01 10:01:44] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:01:44] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-06-01 10:01:44] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:01:44] [INFO ] Invariant cache hit.
[2024-06-01 10:01:44] [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 187 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 232 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 425ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 427ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 489 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 26 ms. (steps per millisecond=384 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 30, 30, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 128, 104, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-06-01 10:01:45] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[2, 3, 1, 2, 2, 128, 104, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 1000013 steps (2 resets) in 573 ms. (1742 steps per ms)
BEST_FIRST walk for 10000010 steps (20 resets) in 4026 ms. (2483 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 3, 1, 2, 2, 128, 104, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
[2024-06-01 10:01:50] [INFO ] Invariant cache hit.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:01:50] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 3 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:01:50] [INFO ] Added : 2 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:50] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:50] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:50] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:50] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:50] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-06-01 10:01:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 10:01:50] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 7 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:50] [INFO ] Added : 1 causal constraints over 1 iterations in 12 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:50] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 5 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:50] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:01:50] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:01:50] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:01:50] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:01:50] [INFO ] Added : 2 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, 128, 104, 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, 104, 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 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 5 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 3 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:01:51] [INFO ] Invariant cache hit.
[2024-06-01 10:01:51] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-06-01 10:01:51] [INFO ] Invariant cache hit.
[2024-06-01 10:01:51] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:01:51] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 10:01:51] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:01:51] [INFO ] Invariant cache hit.
[2024-06-01 10:01:51] [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 192 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 200 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 399ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 400ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 472 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 22 ms. (steps per millisecond=454 ) properties (out of 10) seen :[2, 3, 1, 2, 2, 32, 30, 1, 1, 2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2, 3, 1, 2, 2, 128, 104, 1, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, 130, 130, +inf, +inf, +inf]
RANDOM walk for 40030 steps (8 resets) in 908 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 89 ms. (444 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 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 47 ms. (833 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 62 ms. (634 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 213309 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :0 out of 12
Probabilistic random walk after 213309 steps, saw 146337 distinct states, run finished after 3006 ms. (steps per millisecond=70 ) properties seen :0
[2024-06-01 10:01:55] [INFO ] Invariant cache hit.
[2024-06-01 10:01:55] [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-06-01 10:01:55] [INFO ] Deduced a trap composed of 5 places in 20 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 170 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-06-01 10:01:55] [INFO ] Deduced a trap composed of 2 places in 23 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 216 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 392ms problems are : Problem set: 2 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 1182 ms.
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 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-06-01 10:01:56] [INFO ] Invariant cache hit.
[2024-06-01 10:01:56] [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 182 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 195 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 385ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40000 steps (8 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 29 ms. (1333 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 30 ms. (1290 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (8 resets) in 46 ms. (851 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 291805 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :0 out of 10
Probabilistic random walk after 291805 steps, saw 201454 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
[2024-06-01 10:02:00] [INFO ] Invariant cache hit.
[2024-06-01 10:02:00] [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, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 10:02:00] [INFO ] Deduced a trap composed of 5 places in 23 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, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 0 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: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 10/60 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 0/60 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 37 constraints, problems are : Problem set: 0 solved, 10 unsolved in 192 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 8/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/18 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (OVERLAPS) 32/50 variables, 18/20 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/50 variables, 4/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 10/60 variables, 7/41 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
[2024-06-01 10:02:00] [INFO ] Deduced a trap composed of 2 places in 14 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/60 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/60 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (OVERLAPS) 0/60 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 48 constraints, problems are : Problem set: 0 solved, 10 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 25/25 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 432ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 764 ms.
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 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-06-01 10:02:01] [INFO ] Invariant cache hit.
[2024-06-01 10:02:01] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-01 10:02:01] [INFO ] Invariant cache hit.
[2024-06-01 10:02:01] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:01] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
[2024-06-01 10:02:01] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:01] [INFO ] Invariant cache hit.
[2024-06-01 10:02:01] [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 446 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 294 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 746ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 746ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 819 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 10 properties.
[2024-06-01 10:02:02] [INFO ] Invariant cache hit.
[2024-06-01 10:02:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:02] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-06-01 10:02:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:02] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-06-01 10:02:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:02] [INFO ] After 26ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :10
TRAPS : Iteration 0
[2024-06-01 10:02:02] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
[2024-06-01 10:02:02] [INFO ] After 185ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[2, 3, 1, 2, 2, 128, 104, 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-06-01 10:02:02] [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 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-06-01 10:02:02] [INFO ] Invariant cache hit.
[2024-06-01 10:02:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:02] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:02] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:02] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:02] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:02] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:02:02] [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 6 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-06-01 10:02:02] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:02:02] [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 31 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 213 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 273ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 274ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 280 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 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 10:02:03] [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 217 ms. (4587 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 251 ms. (3968 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:03] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:02:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:03] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:02:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:03] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:02:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:03] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:02:03] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 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-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:03] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:03] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-06-01 10:02:03] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:03] [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 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 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 23 ms. (steps per millisecond=434 ) 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 40001 steps (8 resets) in 32 ms. (1212 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 8 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 1190 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-06-01 10:02:03] [INFO ] Computed 1 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[3] 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 6 ms. (1428 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 10:02:03] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] [Real]Absence check using 1 positive place invariants in 30 ms returned sat
[2024-06-01 10:02:04] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-06-01 10:02:04] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:04] [INFO ] [Real]Added 10 Read/Feed constraints in 29 ms returned sat
[2024-06-01 10:02:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:04] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 10:02:04] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:04] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:04] [INFO ] Added : 3 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 7 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 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-06-01 10:02:04] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:02:04] [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 36 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 3/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 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 1000000 steps (2 resets) in 227 ms. (4385 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 184 ms. (5405 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[3] Max Struct:[+inf]
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:04] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:02:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:04] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 10:02:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:04] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:02:04] [INFO ] Added : 3 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[3] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[3] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:04] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 10:02:04] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [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 26 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 54ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[3]
Current structural bounds on expressions (after cover walk) : Max Seen:[3] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 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 988 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-06-01 10:02:04] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10004 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:[1] Max Struct:[+inf]
[2024-06-01 10:02:04] [INFO ] Invariant cache hit.
[2024-06-01 10:02:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:02:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:05] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:02:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:02:05] [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:[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-06-01 10:02:05] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:02: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 31 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 3/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 :[1]
Current structural bounds on expressions (after cover walk) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 10:02:05] [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 220 ms. (4524 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 179 ms. (5555 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 10:02:05] [INFO ] Invariant cache hit.
[2024-06-01 10:02:05] [INFO ] [Real]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:05] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:05] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:02:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:05] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:02:05] [INFO ] Added : 3 causal constraints over 2 iterations in 7 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-06-01 10:02:05] [INFO ] Invariant cache hit.
[2024-06-01 10:02:05] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:02:05] [INFO ] Invariant cache hit.
[2024-06-01 10:02:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:05] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-06-01 10:02:05] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:02:05] [INFO ] Invariant cache hit.
[2024-06-01 10:02: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 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 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 104 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 20 ms. (1904 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 3 ms. (steps per millisecond=4 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-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 805 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-06-01 10:02:05] [INFO ] Computed 1 invariants in 3 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:[2] Max Struct:[+inf]
[2024-06-01 10:02:05] [INFO ] Invariant cache hit.
[2024-06-01 10:02:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:05] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-06-01 10:02:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:05] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:05] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:05] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:05] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:05] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Minimization took 13 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-06-01 10:02:05] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:02: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 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 31 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 64ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 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-06-01 10:02:05] [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 229 ms. (4347 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 176 ms. (5649 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 10:02:06] [INFO ] Invariant cache hit.
[2024-06-01 10:02:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:02:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:06] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:06] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:02:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:06] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:02:06] [INFO ] Added : 2 causal constraints over 1 iterations in 2 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 10:02:06] [INFO ] Invariant cache hit.
[2024-06-01 10:02:06] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 10:02:06] [INFO ] Invariant cache hit.
[2024-06-01 10:02:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:06] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-06-01 10:02:06] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:02:06] [INFO ] Invariant cache hit.
[2024-06-01 10:02: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 32 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 40 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 78ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 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 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40002 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 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-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 854 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-06-01 10:02:06] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10007 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:[2] Max Struct:[+inf]
[2024-06-01 10:02:06] [INFO ] Invariant cache hit.
[2024-06-01 10:02:06] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:06] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:06] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:06] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:06] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:06] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:06] [INFO ] Added : 2 causal constraints over 1 iterations in 7 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.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 2 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-06-01 10:02:06] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:02: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 34 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 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 76 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 1 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 10:02:06] [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 234 ms. (4255 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 178 ms. (5586 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 10:02:07] [INFO ] Invariant cache hit.
[2024-06-01 10:02:07] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 10:02:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:07] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:07] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:02:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:07] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:02:07] [INFO ] Added : 2 causal constraints over 1 iterations in 3 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 10:02:07] [INFO ] Invariant cache hit.
[2024-06-01 10:02:07] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 10:02:07] [INFO ] Invariant cache hit.
[2024-06-01 10:02:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:07] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 10:02:07] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:02:07] [INFO ] Invariant cache hit.
[2024-06-01 10:02: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 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 62ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 62ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 112 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40000 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 4 ms. (steps per millisecond=3 ) properties seen :0
Explored full state space saw : 6 states, properties seen :0
Exhaustive walk after 14 steps, saw 6 distinct states, run finished after 1 ms. (steps per millisecond=14 ) properties seen :0
FORMULA Murphy-PT-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 843 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-06-01 10:02:07] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
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:[57] Max Struct:[130]
[2024-06-01 10:02:07] [INFO ] Invariant cache hit.
[2024-06-01 10:02:07] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:07] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:07] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:07] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:07] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:07] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:07] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:07] [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:[57] 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-06-01 10:02:07] [INFO ] Invariant cache hit.
[2024-06-01 10:02:07] [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 217 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 421ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 421ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 423 ms. Remains : 25/25 places, 35/35 transitions.
[2024-06-01 10:02:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[79] Max Struct:[130]
RANDOM walk for 1000007 steps (2 resets) in 476 ms. (2096 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 372 ms. (2680 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[79] Max Struct:[130]
[2024-06-01 10:02:08] [INFO ] Invariant cache hit.
[2024-06-01 10:02:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:08] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:08] [INFO ] [Real]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 10:02:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 10:02:08] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:08] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:08] [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 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:02:08] [INFO ] Invariant cache hit.
[2024-06-01 10:02:09] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:02:09] [INFO ] Invariant cache hit.
[2024-06-01 10:02:09] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:09] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
[2024-06-01 10:02:09] [INFO ] Redundant transitions in 1 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:09] [INFO ] Invariant cache hit.
[2024-06-01 10:02:09] [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 205 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 207 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 417ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 418ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 491 ms. Remains : 25/25 places, 35/35 transitions.
[2024-06-01 10:02:09] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[128] Max Struct:[130]
RANDOM walk for 1000001 steps (2 resets) in 498 ms. (2004 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 377 ms. (2645 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[128] Max Struct:[130]
[2024-06-01 10:02:10] [INFO ] Invariant cache hit.
[2024-06-01 10:02:10] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:10] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:10] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:10] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-06-01 10:02:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-06-01 10:02:10] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 10:02:10] [INFO ] Added : 1 causal constraints over 1 iterations in 11 ms. Result :sat
Minimization took 8 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 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-06-01 10:02:10] [INFO ] Invariant cache hit.
[2024-06-01 10:02:10] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:02:10] [INFO ] Invariant cache hit.
[2024-06-01 10:02:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:10] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 10:02:10] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:10] [INFO ] Invariant cache hit.
[2024-06-01 10:02:10] [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 186 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 204 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 397ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 397ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40065 steps (8 resets) in 59 ms. (667 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 24 ms. (1600 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 874455 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :0 out of 2
Probabilistic random walk after 874455 steps, saw 609098 distinct states, run finished after 3003 ms. (steps per millisecond=291 ) properties seen :0
[2024-06-01 10:02:14] [INFO ] Invariant cache hit.
[2024-06-01 10:02:14] [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-06-01 10:02:14] [INFO ] Deduced a trap composed of 5 places in 18 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 85 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 49 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 139ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 22 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 5 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:14] [INFO ] Invariant cache hit.
[2024-06-01 10:02:14] [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 215 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 195 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 437ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 439ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 444 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40055 steps (8 resets) in 28 ms. (1381 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2322921 steps, run timeout after 3001 ms. (steps per millisecond=774 ) properties seen :0 out of 1
Probabilistic random walk after 2322921 steps, saw 1620593 distinct states, run finished after 3001 ms. (steps per millisecond=774 ) properties seen :0
[2024-06-01 10:02:17] [INFO ] Invariant cache hit.
[2024-06-01 10:02:17] [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-06-01 10:02:17] [INFO ] Deduced a trap composed of 5 places in 23 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 37 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 111ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 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 2 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 25/25 places, 35/35 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25/25 places, 35/35 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:02:17] [INFO ] Invariant cache hit.
[2024-06-01 10:02:17] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:02:17] [INFO ] Invariant cache hit.
[2024-06-01 10:02:17] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:17] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-01 10:02:17] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:17] [INFO ] Invariant cache hit.
[2024-06-01 10:02:17] [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 192 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 216 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 421ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 422ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 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 3 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-06-01 10:02:18] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 10:02:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:18] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 10:02:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:18] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-01 10:02:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 10:02:18] [INFO ] After 2ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 10:02:18] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 10:02:18] [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 65 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 10875 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-06-01 10:02:18] [INFO ] Computed 1 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[25] Max Struct:[130]
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:[54] Max Struct:[130]
[2024-06-01 10:02:18] [INFO ] Invariant cache hit.
[2024-06-01 10:02:18] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:18] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:18] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:18] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:18] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:18] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:18] [INFO ] Added : 0 causal constraints over 0 iterations in 6 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[54] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[82] 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 7 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:18] [INFO ] Invariant cache hit.
[2024-06-01 10:02:18] [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 194 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 226 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 433ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 440 ms. Remains : 25/25 places, 35/35 transitions.
[2024-06-01 10:02:18] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[82] Max Struct:[130]
RANDOM walk for 1000000 steps (2 resets) in 515 ms. (1937 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 400 ms. (2493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[82] Max Struct:[130]
[2024-06-01 10:02:19] [INFO ] Invariant cache hit.
[2024-06-01 10:02:19] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:19] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:19] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:19] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-06-01 10:02:19] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:19] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:19] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:19] [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:[82] Max Struct:[130]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[82] 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 0 ms. Remains 25 /25 variables (removed 0) and now considering 35/35 (removed 0) transitions.
[2024-06-01 10:02:19] [INFO ] Invariant cache hit.
[2024-06-01 10:02:19] [INFO ] Implicit Places using invariants in 29 ms returned []
[2024-06-01 10:02:19] [INFO ] Invariant cache hit.
[2024-06-01 10:02:20] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:20] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
[2024-06-01 10:02:20] [INFO ] Redundant transitions in 0 ms returned []
Running 20 sub problems to find dead transitions.
[2024-06-01 10:02:20] [INFO ] Invariant cache hit.
[2024-06-01 10:02: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 189 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 394ms problems are : Problem set: 0 solved, 20 unsolved
Search for dead transitions found 0 dead transitions in 394ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 466 ms. Remains : 25/25 places, 35/35 transitions.
RANDOM walk for 40003 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 563050 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :0 out of 2
Probabilistic random walk after 563050 steps, saw 392192 distinct states, run finished after 3002 ms. (steps per millisecond=187 ) properties seen :0
[2024-06-01 10:02:23] [INFO ] Invariant cache hit.
[2024-06-01 10:02:23] [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-06-01 10:02:23] [INFO ] Deduced a trap composed of 5 places in 23 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 70 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 45 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 121ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 1941 steps, including 24 resets, run visited all 1 properties in 4 ms. (steps per millisecond=485 )
Parikh walk visited 1 properties in 9 ms.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[82] Max Struct:[130]
Ending property specific reduction for Murphy-PT-D4N025-UpperBounds-10 in 5233 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]
[2024-06-01 10:02:23] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10011 steps (2 resets) in 6 ms. (1430 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 10:02:23] [INFO ] Invariant cache hit.
[2024-06-01 10:02:23] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:23] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 10:02:23] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:23] [INFO ] [Real]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:23] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:23] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:23] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:23] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:02:23] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Minimization took 7 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-06-01 10:02:23] [INFO ] Computed 0 invariants in 6 ms
[2024-06-01 10:02:23] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 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 74 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-06-01 10:02:23] [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 235 ms. (4237 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 190 ms. (5235 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 10:02:24] [INFO ] Invariant cache hit.
[2024-06-01 10:02:24] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:24] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:02:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:24] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:02:24] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:02:24] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 10:02:24] [INFO ] Added : 3 causal constraints over 2 iterations in 4 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-06-01 10:02:24] [INFO ] Invariant cache hit.
[2024-06-01 10:02:24] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 10:02:24] [INFO ] Invariant cache hit.
[2024-06-01 10:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:24] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
[2024-06-01 10:02:24] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:02:24] [INFO ] Invariant cache hit.
[2024-06-01 10:02:24] [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 34 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 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 114 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 40001 steps (8 resets) in 133 ms. (298 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 21 ms. (1818 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 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 2 ms. (steps per millisecond=7 ) 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 916 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-06-01 10:02:24] [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 7 ms. (1252 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-06-01 10:02:24] [INFO ] Invariant cache hit.
[2024-06-01 10:02:24] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:24] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:24] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:24] [INFO ] [Real]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:24] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:24] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:24] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:24] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:24] [INFO ] Added : 1 causal constraints over 1 iterations in 8 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 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 2 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-06-01 10:02:24] [INFO ] Computed 0 invariants in 1 ms
[2024-06-01 10:02:24] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 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 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]
[2024-06-01 10:02:24] [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 241 ms. (4132 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 191 ms. (5208 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[1] Max Struct:[+inf]
[2024-06-01 10:02:25] [INFO ] Invariant cache hit.
[2024-06-01 10:02:25] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 10:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:25] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:25] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:02:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 10:02:25] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:02:25] [INFO ] Added : 3 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[1] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 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-06-01 10:02:25] [INFO ] Invariant cache hit.
[2024-06-01 10:02:25] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 10:02:25] [INFO ] Invariant cache hit.
[2024-06-01 10:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:25] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 10:02:25] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:02:25] [INFO ] Invariant cache hit.
[2024-06-01 10:02:25] [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 85ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 85ms
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 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 21 ms. (1818 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 6 states, properties seen :0
Probabilistic random walk after 14 steps, saw 6 distinct states, run finished after 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-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 886 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-06-01 10:02:25] [INFO ] Computed 1 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[+inf]
RANDOM walk for 10000 steps (2 resets) in 5 ms. (1666 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 4 ms. (2000 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2] Max Struct:[+inf]
[2024-06-01 10:02:25] [INFO ] Invariant cache hit.
[2024-06-01 10:02:25] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 10:02:25] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:25] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 10:02:25] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 10:02:25] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 10:02:25] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 10:02:25] [INFO ] Computed and/alt/rep : 20/50/20 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 10:02:25] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 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 2 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-06-01 10:02:25] [INFO ] Computed 0 invariants in 0 ms
[2024-06-01 10:02:25] [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 38 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 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-06-01 10:02:25] [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 222 ms. (4484 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:[2] Max Struct:[+inf]
[2024-06-01 10:02:25] [INFO ] Invariant cache hit.
[2024-06-01 10:02:25] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 10:02:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:25] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:02:26] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 10:02:26] [INFO ] [Nat]Absence check using state equation in 1 ms returned sat
[2024-06-01 10:02:26] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 10:02:26] [INFO ] Computed and/alt/rep : 3/6/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 10:02:26] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Minimization took 2 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[2] Max Struct:[+inf]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[2] Max Struct:[+inf]
Support contains 1 out of 3 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 3/3 places, 4/4 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3/3 places, 4/4 transitions.
Applied a total of 0 rules in 0 ms. Remains 3 /3 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-06-01 10:02:26] [INFO ] Invariant cache hit.
[2024-06-01 10:02:26] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 10:02:26] [INFO ] Invariant cache hit.
[2024-06-01 10:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 10:02:26] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-06-01 10:02:26] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-06-01 10:02:26] [INFO ] Invariant cache hit.
[2024-06-01 10:02:26] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/7 variables, and 4 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/7 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/7 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/7 variables, and 7 constraints, problems are : Problem set: 0 solved, 3 unsolved in 33 ms.
Refiners :[State Equation: 3/3 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 70ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 70ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 108 ms. Remains : 3/3 places, 4/4 transitions.
Found an invariant !
This invariant on transitions {0=1}
Produces a positive solution :{}
Attempting to minimize the solution found.
Minimization OK=successtook 0 ms.
This minimized invariant on transitions {0=1}
Produces a positive solution
Incomplete random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :[2]
Current structural bounds on expressions (after cover walk) : Max Seen:[2] Max Struct:[+inf]
RANDOM walk for 40001 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 26 ms. (1481 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 802 ms.
[2024-06-01 10:02:26] [INFO ] Flatten gal took : 21 ms
[2024-06-01 10:02:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2024-06-01 10:02:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 35 transitions and 115 arcs took 3 ms.
Total runtime 56943 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : Murphy-PT-D4N025-UpperBounds-08
Could not compute solution for formula : Murphy-PT-D4N025-UpperBounds-10

BK_STOP 1717236146613

--------------------
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
mcc2024
ub formula name Murphy-PT-D4N025-UpperBounds-08
ub formula formula --maxsum=/tmp/1474/ub_0_
ub formula name Murphy-PT-D4N025-UpperBounds-10
ub formula formula --maxsum=/tmp/1474/ub_1_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
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 r508-tall-171654351400325"
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 ;