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.r504-tall-171649611900037.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 JoinFreeModules-PT-0020, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649611900037
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 61K May 18 16:42 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 JoinFreeModules-PT-0020-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0020-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717218006182

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0020
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:00:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:00:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:00:07] [INFO ] Load time of PNML (sax parser for PT used): 63 ms
[2024-06-01 05:00:07] [INFO ] Transformed 101 places.
[2024-06-01 05:00:07] [INFO ] Transformed 161 transitions.
[2024-06-01 05:00:07] [INFO ] Parsed PT model containing 101 places and 161 transitions and 462 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 10 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[1, 2, 20, 20, 0, 1, 0, 2, 0, 1, 20, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[1, 2, 20, 20, 0, 1, 0, 2, 0, 1, 20, 0, 0, 0, 0, 1] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 161 rows 100 cols
[2024-06-01 05:00:07] [INFO ] Computed 20 invariants in 17 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1, 2, 20, 20, 0, 1, 0, 2, 0, 1, 20, 0, 0, 0, 0, 1] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
RANDOM walk for 10000 steps (2 resets) in 55 ms. (178 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 252 ms. (632 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 15, 20, 20, 18, 21, 20, 20, 18, 21, 20, 15, 21, 21, 19, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
[2024-06-01 05:00:07] [INFO ] Invariant cache hit.
[2024-06-01 05:00:08] [INFO ] [Real]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-06-01 05:00:08] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-06-01 05:00:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-06-01 05:00:08] [INFO ] [Nat]Absence check using state equation in 54 ms returned sat
[2024-06-01 05:00:08] [INFO ] State equation strengthened by 20 read => feed constraints.
[2024-06-01 05:00:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 57 ms returned sat
[2024-06-01 05:00:08] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 05:00:08] [INFO ] Added : 62 causal constraints over 14 iterations in 184 ms. Result :sat
Minimization took 44 ms.
[2024-06-01 05:00:08] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-06-01 05:00:08] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-06-01 05:00:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-06-01 05:00:08] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 05:00:08] [INFO ] [Nat]Added 20 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:00:08] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 05:00:08] [INFO ] Added : 84 causal constraints over 18 iterations in 176 ms. Result :sat
Minimization took 61 ms.
[2024-06-01 05:00:09] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-06-01 05:00:09] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-06-01 05:00:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:09] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 05:00:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 36 ms returned sat
[2024-06-01 05:00:09] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 16 ms.
[2024-06-01 05:00:09] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 32 ms to minimize.
[2024-06-01 05:00:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 74 ms
[2024-06-01 05:00:09] [INFO ] Added : 60 causal constraints over 13 iterations in 255 ms. Result :sat
Minimization took 44 ms.
[2024-06-01 05:00:09] [INFO ] [Real]Absence check using 20 positive place invariants in 6 ms returned sat
[2024-06-01 05:00:09] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-06-01 05:00:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 5 ms returned sat
[2024-06-01 05:00:09] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 05:00:09] [INFO ] [Nat]Added 20 Read/Feed constraints in 51 ms returned sat
[2024-06-01 05:00:09] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 05:00:09] [INFO ] Added : 83 causal constraints over 17 iterations in 193 ms. Result :sat
Minimization took 48 ms.
[2024-06-01 05:00:10] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:10] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-01 05:00:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:10] [INFO ] [Nat]Absence check using state equation in 36 ms returned sat
[2024-06-01 05:00:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 35 ms returned sat
[2024-06-01 05:00:10] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:00:10] [INFO ] Added : 57 causal constraints over 14 iterations in 191 ms. Result :sat
Minimization took 45 ms.
[2024-06-01 05:00:10] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2024-06-01 05:00:10] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-06-01 05:00:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-06-01 05:00:10] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 05:00:10] [INFO ] [Nat]Added 20 Read/Feed constraints in 49 ms returned sat
[2024-06-01 05:00:10] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 15 ms.
[2024-06-01 05:00:10] [INFO ] Added : 87 causal constraints over 19 iterations in 206 ms. Result :sat
Minimization took 46 ms.
[2024-06-01 05:00:10] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-06-01 05:00:10] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:00:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:10] [INFO ] [Nat]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-06-01 05:00:11] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 05:00:11] [INFO ] [Nat]Added 20 Read/Feed constraints in 35 ms returned sat
[2024-06-01 05:00:11] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:00:11] [INFO ] Added : 56 causal constraints over 12 iterations in 140 ms. Result :sat
Minimization took 37 ms.
[2024-06-01 05:00:11] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-06-01 05:00:11] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 05:00:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:11] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:00:11] [INFO ] [Nat]Added 20 Read/Feed constraints in 69 ms returned sat
[2024-06-01 05:00:11] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 14 ms.
[2024-06-01 05:00:11] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:00:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-06-01 05:00:11] [INFO ] Added : 57 causal constraints over 12 iterations in 202 ms. Result :sat
Minimization took 39 ms.
[2024-06-01 05:00:11] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:11] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:00:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:11] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:11] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2024-06-01 05:00:11] [INFO ] [Nat]Added 20 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:00:11] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:00:12] [INFO ] Added : 48 causal constraints over 11 iterations in 137 ms. Result :sat
Minimization took 40 ms.
[2024-06-01 05:00:12] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-06-01 05:00:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:00:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:12] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 05:00:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 34 ms returned sat
[2024-06-01 05:00:12] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 05:00:12] [INFO ] Added : 88 causal constraints over 19 iterations in 214 ms. Result :sat
Minimization took 45 ms.
[2024-06-01 05:00:12] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:12] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:00:12] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:12] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:12] [INFO ] [Nat]Absence check using state equation in 46 ms returned sat
[2024-06-01 05:00:12] [INFO ] [Nat]Added 20 Read/Feed constraints in 35 ms returned sat
[2024-06-01 05:00:12] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 05:00:12] [INFO ] Added : 48 causal constraints over 11 iterations in 133 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 05:00:12] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 05:00:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 52 ms returned sat
[2024-06-01 05:00:13] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:00:13] [INFO ] Added : 79 causal constraints over 17 iterations in 181 ms. Result :sat
Minimization took 55 ms.
[2024-06-01 05:00:13] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:00:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Nat]Absence check using state equation in 41 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 58 ms returned sat
[2024-06-01 05:00:13] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 05:00:13] [INFO ] Added : 44 causal constraints over 9 iterations in 101 ms. Result :sat
Minimization took 34 ms.
[2024-06-01 05:00:13] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:00:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:13] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Nat]Absence check using state equation in 79 ms returned sat
[2024-06-01 05:00:13] [INFO ] [Nat]Added 20 Read/Feed constraints in 23 ms returned sat
[2024-06-01 05:00:13] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 10 ms.
[2024-06-01 05:00:14] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:00:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:00:14] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:00:14] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:00:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 132 ms
[2024-06-01 05:00:14] [INFO ] Added : 58 causal constraints over 12 iterations in 256 ms. Result :sat
Minimization took 36 ms.
[2024-06-01 05:00:14] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:14] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-06-01 05:00:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:14] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-06-01 05:00:14] [INFO ] [Nat]Added 20 Read/Feed constraints in 51 ms returned sat
[2024-06-01 05:00:14] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 11 ms.
[2024-06-01 05:00:14] [INFO ] Added : 60 causal constraints over 13 iterations in 152 ms. Result :sat
Minimization took 42 ms.
[2024-06-01 05:00:14] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:14] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-06-01 05:00:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:14] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:14] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-06-01 05:00:14] [INFO ] [Nat]Added 20 Read/Feed constraints in 51 ms returned sat
[2024-06-01 05:00:14] [INFO ] Computed and/alt/rep : 120/300/120 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 05:00:15] [INFO ] Added : 81 causal constraints over 18 iterations in 188 ms. Result :sat
Minimization took 43 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 15, 20, 20, 18, 21, 20, 20, 18, 21, 20, 15, 21, 21, 19, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 22, 20, 20, 21, 21, 20, 22, 18, 21, 20, 20, 21, 21, 19, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
Support contains 16 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 161/161 transitions.
Graph (complete) has 240 edges and 100 vertex of which 50 are kept as prefixes of interest. Removing 50 places using SCC suffix rule.1 ms
Discarding 50 places :
Also discarding 80 output transitions
Drop transitions (Output transitions of discarded places.) removed 80 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 50 transition count 80
Applied a total of 2 rules in 23 ms. Remains 50 /100 variables (removed 50) and now considering 80/161 (removed 81) transitions.
Running 60 sub problems to find dead transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-06-01 05:00:17] [INFO ] Computed 10 invariants in 5 ms
[2024-06-01 05:00:17] [INFO ] State equation strengthened by 10 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 0/130 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 70 constraints, problems are : Problem set: 0 solved, 60 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (OVERLAPS) 10/50 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 3 (OVERLAPS) 80/130 variables, 50/60 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/130 variables, 10/70 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 60/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 60 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 130 constraints, problems are : Problem set: 0 solved, 60 unsolved in 1304 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 50/50 constraints, ReadFeed: 10/10 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 0/0 constraints]
After SMT, in 2155ms problems are : Problem set: 0 solved, 60 unsolved
Search for dead transitions found 0 dead transitions in 2166ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2207 ms. Remains : 50/100 places, 80/161 transitions.
[2024-06-01 05:00:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[21, 22, 20, 20, 21, 21, 20, 22, 18, 21, 20, 20, 21, 21, 19, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
RANDOM walk for 1000000 steps (2 resets) in 1472 ms. (678 steps per ms)
FORMULA JoinFreeModules-PT-0020-UpperBounds-14 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-13 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-12 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-08 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-06 23 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 11000011 steps (22 resets) in 8235 ms. (1335 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 22, 20, 20, 22, 21, 22, 21, 20, 22, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23]
[2024-06-01 05:00:29] [INFO ] Invariant cache hit.
[2024-06-01 05:00:29] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 05:00:29] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:29] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-06-01 05:00:29] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 05:00:29] [INFO ] [Nat]Added 10 Read/Feed constraints in 22 ms returned sat
[2024-06-01 05:00:29] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:00:29] [INFO ] Added : 27 causal constraints over 6 iterations in 38 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 05:00:29] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:29] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:29] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:29] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:00:29] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:00:29] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 30 ms
[2024-06-01 05:00:29] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:29] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:29] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:29] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:29] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:29] [INFO ] [Nat]Added 10 Read/Feed constraints in 86 ms returned sat
[2024-06-01 05:00:29] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:00:29] [INFO ] Added : 28 causal constraints over 8 iterations in 48 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 54 ms returned sat
[2024-06-01 05:00:30] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:00:30] [INFO ] Added : 35 causal constraints over 8 iterations in 55 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 56 ms returned sat
[2024-06-01 05:00:30] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:00:30] [INFO ] Added : 25 causal constraints over 7 iterations in 44 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:00:30] [INFO ] Added : 5 causal constraints over 1 iterations in 24 ms. Result :sat
Minimization took 10 ms.
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 4 ms returned sat
[2024-06-01 05:00:30] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:00:30] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 27 ms
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:30] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:30] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:00:30] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:00:30] [INFO ] Added : 37 causal constraints over 8 iterations in 131 ms. Result :sat
Minimization took 23 ms.
[2024-06-01 05:00:31] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 81 ms returned sat
[2024-06-01 05:00:31] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:00:31] [INFO ] Added : 29 causal constraints over 7 iterations in 50 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 05:00:31] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:00:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 105 ms returned sat
[2024-06-01 05:00:31] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:00:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:00:31] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 26 ms
Minimization took 11 ms.
[2024-06-01 05:00:31] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:31] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:31] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:31] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:00:31] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:00:31] [INFO ] Added : 39 causal constraints over 8 iterations in 206 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 22, 20, 20, 22, 21, 22, 21, 20, 22, 21] Max Struct:[23, 22, 23, 23, 23, 23, 22, 23, 23, 22, 23]
FORMULA JoinFreeModules-PT-0020-UpperBounds-11 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-07 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0020-UpperBounds-01 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 20, 20, 22, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23]
Support contains 8 out of 50 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 50/50 places, 80/80 transitions.
Graph (complete) has 120 edges and 50 vertex of which 35 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 24 output transitions
Drop transitions (Output transitions of discarded places.) removed 24 transitions
Applied a total of 1 rules in 1 ms. Remains 35 /50 variables (removed 15) and now considering 56/80 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 35/50 places, 56/80 transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:00:32] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[21, 20, 20, 22, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23]
RANDOM walk for 1000002 steps (2 resets) in 1029 ms. (970 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 4246 ms. (1883 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 20, 20, 22, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23, 23]
[2024-06-01 05:00:37] [INFO ] Invariant cache hit.
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:00:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:00:37] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:00:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 3 ms returned sat
[2024-06-01 05:00:37] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:00:37] [INFO ] Added : 36 causal constraints over 8 iterations in 75 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:00:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 13 ms returned sat
[2024-06-01 05:00:37] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:00:37] [INFO ] Added : 17 causal constraints over 5 iterations in 24 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:00:37] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:00:37] [INFO ] Added : 27 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Nat]Added 7 Read/Feed constraints in 14 ms returned sat
[2024-06-01 05:00:37] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:00:37] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 25 ms
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:37] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:00:37] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Nat]Added 7 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:00:38] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:00:38] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:00:38] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:00:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 52 ms
[2024-06-01 05:00:38] [INFO ] Added : 34 causal constraints over 7 iterations in 88 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:00:38] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:00:38] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:00:38] [INFO ] Added : 24 causal constraints over 6 iterations in 25 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:00:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Nat]Added 7 Read/Feed constraints in 9 ms returned sat
[2024-06-01 05:00:38] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:00:38] [INFO ] Added : 15 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 05:00:38] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:38] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:00:38] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:00:38] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:00:38] [INFO ] Added : 27 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 20, 20, 22, 21, 21, 20, 21] Max Struct:[23, 23, 23, 22, 23, 23, 23, 23]
FORMULA JoinFreeModules-PT-0020-UpperBounds-04 22 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 20, 20, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23]
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Graph (complete) has 84 edges and 35 vertex of which 30 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Applied a total of 1 rules in 2 ms. Remains 30 /35 variables (removed 5) and now considering 48/56 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/35 places, 48/56 transitions.
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:00:38] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[21, 20, 20, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23]
RANDOM walk for 1000002 steps (2 resets) in 909 ms. (1098 steps per ms)
BEST_FIRST walk for 7000007 steps (14 resets) in 3263 ms. (2144 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21, 20, 20, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23]
[2024-06-01 05:00:42] [INFO ] Invariant cache hit.
[2024-06-01 05:00:42] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:42] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:42] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:42] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:42] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:42] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:00:42] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:00:42] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:00:42] [INFO ] Added : 21 causal constraints over 5 iterations in 25 ms. Result :sat
Minimization took 14 ms.
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:00:43] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:00:43] [INFO ] Deduced a trap composed of 4 places in 12 ms of which 1 ms to minimize.
[2024-06-01 05:00:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 19 ms
[2024-06-01 05:00:43] [INFO ] Added : 21 causal constraints over 5 iterations in 43 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2024-06-01 05:00:43] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:00:43] [INFO ] Added : 27 causal constraints over 7 iterations in 28 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:00:43] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:00:43] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:00:43] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:00:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 71 ms
[2024-06-01 05:00:43] [INFO ] Added : 26 causal constraints over 7 iterations in 235 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:00:43] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:00:43] [INFO ] Added : 30 causal constraints over 6 iterations in 44 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2024-06-01 05:00:43] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:00:43] [INFO ] Added : 17 causal constraints over 5 iterations in 21 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:43] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:00:43] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:00:43] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:00:43] [INFO ] Added : 30 causal constraints over 7 iterations in 31 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21, 20, 20, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21, 20, 20, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23]
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 05:00:44] [INFO ] Invariant cache hit.
[2024-06-01 05:00:44] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 05:00:44] [INFO ] Invariant cache hit.
[2024-06-01 05:00:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:00:44] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
[2024-06-01 05:00:44] [INFO ] Redundant transitions in 1 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 05:00:44] [INFO ] Invariant cache hit.
[2024-06-01 05:00:44] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 907ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 908ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 985 ms. Remains : 30/30 places, 48/48 transitions.
RANDOM walk for 40004 steps (8 resets) in 889 ms. (44 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 77 ms. (512 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 75 ms. (526 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (8 resets) in 72 ms. (547 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 184699 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :0 out of 14
Probabilistic random walk after 184699 steps, saw 153862 distinct states, run finished after 3005 ms. (steps per millisecond=61 ) properties seen :0
[2024-06-01 05:00:48] [INFO ] Invariant cache hit.
[2024-06-01 05:00:48] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 05:00:48] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:00:48] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:00:48] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:00:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
[2024-06-01 05:00:49] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 05:00:49] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2024-06-01 05:00:49] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 1 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 7/13 constraints. Problems are: Problem set: 7 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/43 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/49 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/49 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/49 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 49 constraints, problems are : Problem set: 7 solved, 7 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 7 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 7/13 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/43 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/49 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 7/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/56 constraints. Problems are: Problem set: 7 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 56 constraints, problems are : Problem set: 7 solved, 7 unsolved in 210 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/14 constraints, Known Traps: 7/7 constraints]
After SMT, in 452ms problems are : Problem set: 7 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 890 ms.
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Running 36 sub problems to find dead transitions.
[2024-06-01 05:00:50] [INFO ] Invariant cache hit.
[2024-06-01 05:00:50] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 338 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 891ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 892ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 894 ms. Remains : 30/30 places, 48/48 transitions.
RANDOM walk for 40007 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 70 ms. (563 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 51 ms. (769 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 230209 steps, run timeout after 3001 ms. (steps per millisecond=76 ) properties seen :0 out of 7
Probabilistic random walk after 230209 steps, saw 191988 distinct states, run finished after 3001 ms. (steps per millisecond=76 ) properties seen :0
[2024-06-01 05:00:54] [INFO ] Invariant cache hit.
[2024-06-01 05:00:54] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 7 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 23/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:00:54] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:00:54] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 05:00:54] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 7/52 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:00:54] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:00:54] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/78 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/78 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 54 constraints, problems are : Problem set: 0 solved, 7 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 588ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2783 ms.
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 30/30 places, 48/48 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-06-01 05:00:57] [INFO ] Invariant cache hit.
[2024-06-01 05:00:57] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 05:00:57] [INFO ] Invariant cache hit.
[2024-06-01 05:00:57] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:00:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 05:00:57] [INFO ] Redundant transitions in 0 ms returned []
Running 36 sub problems to find dead transitions.
[2024-06-01 05:00:57] [INFO ] Invariant cache hit.
[2024-06-01 05:00:57] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/78 variables, and 42 constraints, problems are : Problem set: 0 solved, 36 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 6/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 36/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 7 (OVERLAPS) 0/78 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 36 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/78 variables, and 78 constraints, problems are : Problem set: 0 solved, 36 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 30/30 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
After SMT, in 880ms problems are : Problem set: 0 solved, 36 unsolved
Search for dead transitions found 0 dead transitions in 881ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 943 ms. Remains : 30/30 places, 48/48 transitions.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[21, 20, 20, 21, 21, 20, 21] Max Struct:[23, 23, 23, 23, 23, 23, 23]
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-00
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[23]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[23]
[2024-06-01 05:00:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[23]
RANDOM walk for 10002 steps (2 resets) in 16 ms. (588 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:[21] Max Struct:[23]
[2024-06-01 05:00:58] [INFO ] Invariant cache hit.
[2024-06-01 05:00:58] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:58] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:58] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:58] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:00:58] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:00:58] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:00:58] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:00:58] [INFO ] Added : 21 causal constraints over 5 iterations in 26 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[23]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:00:58] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:00:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 47 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:00:58] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[21] Max Struct:[23]
RANDOM walk for 1000002 steps (2 resets) in 284 ms. (3508 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 183 ms. (5434 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21] Max Struct:[23]
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:00:59] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:59] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:00:59] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:00:59] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:00:59] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:00:59] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[23]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:00:59] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-06-01 05:00:59] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 86ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40012 steps (8 resets) in 45 ms. (869 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 2/2 properties
Probably explored full state space saw : 17010 states, properties seen :0
Probabilistic random walk after 100500 steps, saw 17010 distinct states, run finished after 118 ms. (steps per millisecond=851 ) properties seen :0
Explored full state space saw : 17010 states, properties seen :0
Exhaustive walk after 100500 steps, saw 17010 distinct states, run finished after 72 ms. (steps per millisecond=1395 ) properties seen :0
FORMULA JoinFreeModules-PT-0020-UpperBounds-00 21 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-00 in 1131 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-02
Current structural bounds on expressions (Initially) : Max Seen:[20] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (Before main loop) : Max Seen:[20] Max Struct:[23]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:00:59] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[23]
RANDOM walk for 10001 steps (2 resets) in 10 ms. (909 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:[20] Max Struct:[23]
[2024-06-01 05:00:59] [INFO ] Invariant cache hit.
[2024-06-01 05:00:59] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:59] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:00:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:00:59] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:00:59] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:00:59] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:00:59] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:00:59] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:00:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 26 ms
[2024-06-01 05:00:59] [INFO ] Added : 21 causal constraints over 5 iterations in 48 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[23]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:00:59] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:00:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 45 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 88ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:01:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[23]
RANDOM walk for 1000000 steps (2 resets) in 280 ms. (3558 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 150 ms. (6622 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[23]
[2024-06-01 05:01:00] [INFO ] Invariant cache hit.
[2024-06-01 05:01:00] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:00] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:00] [INFO ] [Real]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:01:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:00] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:00] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:01:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:01:00] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:01:00] [INFO ] Added : 5 causal constraints over 2 iterations in 9 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[23]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:01:00] [INFO ] Invariant cache hit.
[2024-06-01 05:01:00] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 05:01:00] [INFO ] Invariant cache hit.
[2024-06-01 05:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:00] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
[2024-06-01 05:01:00] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:01:00] [INFO ] Invariant cache hit.
[2024-06-01 05:01:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 94ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 94ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 132 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40010 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 2/2 properties
Probably explored full state space saw : 17010 states, properties seen :0
Probabilistic random walk after 100500 steps, saw 17010 distinct states, run finished after 122 ms. (steps per millisecond=823 ) properties seen :0
Explored full state space saw : 17010 states, properties seen :0
Exhaustive walk after 100500 steps, saw 17010 distinct states, run finished after 85 ms. (steps per millisecond=1182 ) properties seen :0
FORMULA JoinFreeModules-PT-0020-UpperBounds-02 20 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-02 in 1147 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-03
Current structural bounds on expressions (Initially) : Max Seen:[20] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (Before main loop) : Max Seen:[20] Max Struct:[23]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:01:00] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[23]
RANDOM walk for 10000 steps (2 resets) in 9 ms. (1000 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:[20] Max Struct:[23]
[2024-06-01 05:01:00] [INFO ] Invariant cache hit.
[2024-06-01 05:01:00] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:00] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:01:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:00] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-06-01 05:01:01] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:01:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:01:01] [INFO ] [Nat]Added 6 Read/Feed constraints in 10 ms returned sat
[2024-06-01 05:01:01] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:01:01] [INFO ] Added : 27 causal constraints over 7 iterations in 30 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[23]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:01:01] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 87ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:01:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[23]
RANDOM walk for 1000000 steps (2 resets) in 273 ms. (3649 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 145 ms. (6849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[23]
[2024-06-01 05:01:01] [INFO ] Invariant cache hit.
[2024-06-01 05:01:01] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:01] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:01] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:01:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:01] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:01:01] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 05:01:01] [INFO ] Added : 5 causal constraints over 2 iterations in 4 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[23]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:01:01] [INFO ] Invariant cache hit.
[2024-06-01 05:01:01] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 05:01:01] [INFO ] Invariant cache hit.
[2024-06-01 05:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:01] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-06-01 05:01:01] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:01:01] [INFO ] Invariant cache hit.
[2024-06-01 05:01:01] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 87ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 88ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 129 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40007 steps (8 resets) in 32 ms. (1212 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 19 ms. (2000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
Probably explored full state space saw : 17010 states, properties seen :0
Probabilistic random walk after 100500 steps, saw 17010 distinct states, run finished after 137 ms. (steps per millisecond=733 ) properties seen :0
Explored full state space saw : 17010 states, properties seen :0
Exhaustive walk after 100500 steps, saw 17010 distinct states, run finished after 114 ms. (steps per millisecond=881 ) properties seen :0
FORMULA JoinFreeModules-PT-0020-UpperBounds-03 20 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-03 in 1131 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[23]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[23]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:01:02] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[23]
RANDOM walk for 10004 steps (2 resets) in 10 ms. (909 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:[21] Max Struct:[23]
[2024-06-01 05:01:02] [INFO ] Invariant cache hit.
[2024-06-01 05:01:02] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:02] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:01:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:02] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:02] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:01:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:01:02] [INFO ] [Nat]Added 6 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:01:02] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:01:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:01:02] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2024-06-01 05:01:02] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 05:01:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 64 ms
[2024-06-01 05:01:02] [INFO ] Added : 26 causal constraints over 7 iterations in 234 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[23]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:01:02] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:01:02] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 37 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 82ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:01:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[21] Max Struct:[23]
RANDOM walk for 1000001 steps (2 resets) in 280 ms. (3558 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 150 ms. (6622 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21] Max Struct:[23]
[2024-06-01 05:01:02] [INFO ] Invariant cache hit.
[2024-06-01 05:01:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:02] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2024-06-01 05:01:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:01:02] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:01:03] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[23]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:01:03] [INFO ] Invariant cache hit.
[2024-06-01 05:01:03] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 05:01:03] [INFO ] Invariant cache hit.
[2024-06-01 05:01:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:03] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 05:01:03] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:01:03] [INFO ] Invariant cache hit.
[2024-06-01 05:01:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 99ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40009 steps (8 resets) in 40 ms. (975 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 23 ms. (1666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 2/2 properties
Probably explored full state space saw : 17010 states, properties seen :0
Probabilistic random walk after 100500 steps, saw 17010 distinct states, run finished after 131 ms. (steps per millisecond=767 ) properties seen :0
Explored full state space saw : 17010 states, properties seen :0
Exhaustive walk after 100500 steps, saw 17010 distinct states, run finished after 130 ms. (steps per millisecond=773 ) properties seen :0
FORMULA JoinFreeModules-PT-0020-UpperBounds-05 21 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-05 in 1391 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[23]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[23]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:01:03] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[23]
RANDOM walk for 10003 steps (2 resets) in 9 ms. (1000 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:[21] Max Struct:[23]
[2024-06-01 05:01:03] [INFO ] Invariant cache hit.
[2024-06-01 05:01:03] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:03] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:01:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:03] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:01:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:01:03] [INFO ] [Nat]Added 6 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:01:03] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:01:03] [INFO ] Added : 30 causal constraints over 6 iterations in 38 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[23]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 0 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:01:03] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:01:03] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:01:03] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[21] Max Struct:[23]
RANDOM walk for 1000001 steps (2 resets) in 280 ms. (3558 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 154 ms. (6451 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21] Max Struct:[23]
[2024-06-01 05:01:04] [INFO ] Invariant cache hit.
[2024-06-01 05:01:04] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:01:04] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:01:04] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:04] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:01:04] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 05:01:04] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[23]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:01:04] [INFO ] Invariant cache hit.
[2024-06-01 05:01:04] [INFO ] Implicit Places using invariants in 12 ms returned []
[2024-06-01 05:01:04] [INFO ] Invariant cache hit.
[2024-06-01 05:01:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:04] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 28 ms to find 0 implicit places.
[2024-06-01 05:01:04] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:01:04] [INFO ] Invariant cache hit.
[2024-06-01 05:01:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 83ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 83ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40005 steps (8 resets) in 42 ms. (930 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 17 ms. (2222 steps per ms) remains 2/2 properties
Probably explored full state space saw : 17010 states, properties seen :0
Probabilistic random walk after 100500 steps, saw 17010 distinct states, run finished after 118 ms. (steps per millisecond=851 ) properties seen :0
Explored full state space saw : 17010 states, properties seen :0
Exhaustive walk after 100500 steps, saw 17010 distinct states, run finished after 83 ms. (steps per millisecond=1210 ) properties seen :0
FORMULA JoinFreeModules-PT-0020-UpperBounds-09 21 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-09 in 1109 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-10
Current structural bounds on expressions (Initially) : Max Seen:[20] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (Before main loop) : Max Seen:[20] Max Struct:[23]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:01:04] [INFO ] Computed 6 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[23]
RANDOM walk for 10000 steps (2 resets) in 10 ms. (909 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:[20] Max Struct:[23]
[2024-06-01 05:01:04] [INFO ] Invariant cache hit.
[2024-06-01 05:01:04] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:04] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:01:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:04] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:01:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:01:04] [INFO ] [Nat]Added 6 Read/Feed constraints in 11 ms returned sat
[2024-06-01 05:01:04] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:01:04] [INFO ] Added : 17 causal constraints over 5 iterations in 25 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[23]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.0 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:01:04] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:01:04] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 98ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:01:04] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[20] Max Struct:[23]
RANDOM walk for 1000001 steps (2 resets) in 287 ms. (3472 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 149 ms. (6666 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[20] Max Struct:[23]
[2024-06-01 05:01:05] [INFO ] Invariant cache hit.
[2024-06-01 05:01:05] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:01:05] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:05] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:01:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:05] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:01:05] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:01:05] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:01:05] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[20] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[20] Max Struct:[23]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:01:05] [INFO ] Invariant cache hit.
[2024-06-01 05:01:05] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 05:01:05] [INFO ] Invariant cache hit.
[2024-06-01 05:01:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:05] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 31 ms to find 0 implicit places.
[2024-06-01 05:01:05] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:01:05] [INFO ] Invariant cache hit.
[2024-06-01 05:01:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 95ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 95ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 130 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40001 steps (8 resets) in 43 ms. (909 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 18 ms. (2105 steps per ms) remains 2/2 properties
Probably explored full state space saw : 17010 states, properties seen :0
Probabilistic random walk after 100500 steps, saw 17010 distinct states, run finished after 121 ms. (steps per millisecond=830 ) properties seen :0
Explored full state space saw : 17010 states, properties seen :0
Exhaustive walk after 100500 steps, saw 17010 distinct states, run finished after 93 ms. (steps per millisecond=1080 ) properties seen :0
FORMULA JoinFreeModules-PT-0020-UpperBounds-10 20 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-10 in 1134 ms.
Starting property specific reduction for JoinFreeModules-PT-0020-UpperBounds-15
Current structural bounds on expressions (Initially) : Max Seen:[1] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[1] Max Struct:[23]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[23]
// Phase 1: matrix 48 rows 30 cols
[2024-06-01 05:01:05] [INFO ] Computed 6 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[23]
RANDOM walk for 10001 steps (2 resets) in 10 ms. (909 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:[21] Max Struct:[23]
[2024-06-01 05:01:05] [INFO ] Invariant cache hit.
[2024-06-01 05:01:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:05] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-06-01 05:01:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-06-01 05:01:05] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:01:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-01 05:01:05] [INFO ] [Nat]Added 6 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:01:05] [INFO ] Computed and/alt/rep : 36/90/36 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:01:05] [INFO ] Added : 30 causal constraints over 7 iterations in 35 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[23]
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 48/48 transitions.
Graph (complete) has 72 edges and 30 vertex of which 5 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 places :
Also discarding 40 output transitions
Drop transitions (Output transitions of discarded places.) removed 40 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /30 variables (removed 25) and now considering 8/48 (removed 40) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:01:05] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:01:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 81ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 81ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 5/30 places, 8/48 transitions.
[2024-06-01 05:01:05] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[21] Max Struct:[23]
RANDOM walk for 1000001 steps (2 resets) in 286 ms. (3484 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 153 ms. (6493 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[21] Max Struct:[23]
[2024-06-01 05:01:06] [INFO ] Invariant cache hit.
[2024-06-01 05:01:06] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:01:06] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:01:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-06-01 05:01:06] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:01:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:01:06] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:01:06] [INFO ] Added : 6 causal constraints over 3 iterations in 6 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[21] Max Struct:[23]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[21] Max Struct:[23]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 0 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:01:06] [INFO ] Invariant cache hit.
[2024-06-01 05:01:06] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 05:01:06] [INFO ] Invariant cache hit.
[2024-06-01 05:01:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:01:06] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2024-06-01 05:01:06] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:01:06] [INFO ] Invariant cache hit.
[2024-06-01 05:01:06] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 93ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 93ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40000 steps (8 resets) in 45 ms. (869 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
BEST_FIRST walk for 40004 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
Probably explored full state space saw : 17010 states, properties seen :0
Probabilistic random walk after 100500 steps, saw 17010 distinct states, run finished after 122 ms. (steps per millisecond=823 ) properties seen :0
Explored full state space saw : 17010 states, properties seen :0
Exhaustive walk after 100500 steps, saw 17010 distinct states, run finished after 104 ms. (steps per millisecond=966 ) properties seen :0
FORMULA JoinFreeModules-PT-0020-UpperBounds-15 21 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0020-UpperBounds-15 in 1161 ms.
[2024-06-01 05:01:07] [INFO ] Flatten gal took : 129 ms
Total runtime 59694 ms.
ITS solved all properties within timeout

BK_STOP 1717218067064

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

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="JoinFreeModules-PT-0020"
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 JoinFreeModules-PT-0020, 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 r504-tall-171649611900037"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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