MCC'2024- Execution of r504-tall-171649611900045

About the Execution of LTSMin+red for JoinFreeModules-PT-0050

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1693.995	148700.00	210382.00	359.20	52 53 52 51 52 50 53 50 51 52 51 53 52 50 51 52	normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K 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.9K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 5.4K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K 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 152K 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-0050-UpperBounds-00
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-01
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-02
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-03
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-04
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-05
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-06
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-07
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-08
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-09
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-10
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-11
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-12
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-13
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-14
FORMULA_NAME JoinFreeModules-PT-0050-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717218175235

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-0050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:02:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-06-01 05:02:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:02:56] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2024-06-01 05:02:56] [INFO ] Transformed 251 places.
[2024-06-01 05:02:56] [INFO ] Transformed 401 transitions.
[2024-06-01 05:02:56] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 188 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[2, 0, 0, 1, 0, 50, 0, 50, 1, 2, 1, 0, 0, 50, 1, 2] 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:[2, 0, 0, 1, 0, 50, 0, 50, 1, 2, 1, 0, 0, 50, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 401 rows 250 cols
[2024-06-01 05:02:56] [INFO ] Computed 50 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 0, 0, 1, 0, 50, 0, 50, 1, 2, 1, 0, 0, 50, 1, 2] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 10002 steps (2 resets) in 58 ms. (169 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 463 ms. (344 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[27, 49, 25, 51, 30, 50, 49, 50, 51, 25, 34, 49, 27, 50, 51, 27] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2024-06-01 05:02:57] [INFO ] Invariant cache hit.
[2024-06-01 05:02:57] [INFO ] [Real]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-06-01 05:02:57] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2024-06-01 05:02:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:02:57] [INFO ] [Nat]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-06-01 05:02:57] [INFO ] [Nat]Absence check using state equation in 120 ms returned sat
[2024-06-01 05:02:57] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:02:57] [INFO ] [Nat]Added 50 Read/Feed constraints in 19 ms returned sat
[2024-06-01 05:02:57] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 36 ms.
[2024-06-01 05:02:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 13 ms to minimize.
[2024-06-01 05:02:58] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:02:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 141 ms
[2024-06-01 05:02:58] [INFO ] Added : 105 causal constraints over 22 iterations in 793 ms. Result :sat
Minimization took 207 ms.
[2024-06-01 05:02:58] [INFO ] [Real]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-06-01 05:02:59] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-01 05:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:02:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-06-01 05:02:59] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2024-06-01 05:02:59] [INFO ] [Nat]Added 50 Read/Feed constraints in 24 ms returned sat
[2024-06-01 05:02:59] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 05:02:59] [INFO ] Added : 49 causal constraints over 12 iterations in 359 ms. Result :sat
Minimization took 68 ms.
[2024-06-01 05:02:59] [INFO ] [Real]Absence check using 50 positive place invariants in 16 ms returned sat
[2024-06-01 05:02:59] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2024-06-01 05:02:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:02:59] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:00] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-01 05:03:00] [INFO ] [Nat]Added 50 Read/Feed constraints in 58 ms returned sat
[2024-06-01 05:03:00] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 05:03:00] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 05:03:00] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:03:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:03:01] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:03:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:03:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:03:01] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 344 ms
[2024-06-01 05:03:01] [INFO ] Added : 132 causal constraints over 28 iterations in 1107 ms. Result :sat
Minimization took 165 ms.
[2024-06-01 05:03:01] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-06-01 05:03:01] [INFO ] [Real]Absence check using state equation in 84 ms returned sat
[2024-06-01 05:03:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:01] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-06-01 05:03:01] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2024-06-01 05:03:01] [INFO ] [Nat]Added 50 Read/Feed constraints in 36 ms returned sat
[2024-06-01 05:03:01] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 25 ms.
[2024-06-01 05:03:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:03:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-06-01 05:03:02] [INFO ] Added : 72 causal constraints over 15 iterations in 483 ms. Result :sat
Minimization took 71 ms.
[2024-06-01 05:03:02] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:02] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-01 05:03:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:02] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:02] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2024-06-01 05:03:02] [INFO ] [Nat]Added 50 Read/Feed constraints in 32 ms returned sat
[2024-06-01 05:03:02] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 05:03:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:03:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2024-06-01 05:03:03] [INFO ] Added : 74 causal constraints over 16 iterations in 508 ms. Result :sat
Minimization took 110 ms.
[2024-06-01 05:03:03] [INFO ] [Real]Absence check using 50 positive place invariants in 10 ms returned sat
[2024-06-01 05:03:03] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-01 05:03:03] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:03] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2024-06-01 05:03:03] [INFO ] [Nat]Added 50 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:03:03] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 05:03:04] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:03:04] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 112 ms
[2024-06-01 05:03:04] [INFO ] Added : 98 causal constraints over 21 iterations in 671 ms. Result :sat
Minimization took 71 ms.
[2024-06-01 05:03:04] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-06-01 05:03:04] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-06-01 05:03:04] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:04] [INFO ] [Nat]Absence check using 50 positive place invariants in 14 ms returned sat
[2024-06-01 05:03:04] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-06-01 05:03:04] [INFO ] [Nat]Added 50 Read/Feed constraints in 44 ms returned sat
[2024-06-01 05:03:04] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 05:03:05] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:03:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2024-06-01 05:03:05] [INFO ] Added : 101 causal constraints over 21 iterations in 622 ms. Result :sat
Minimization took 83 ms.
[2024-06-01 05:03:05] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:05] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 05:03:05] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:05] [INFO ] [Nat]Absence check using 50 positive place invariants in 9 ms returned sat
[2024-06-01 05:03:05] [INFO ] [Nat]Absence check using state equation in 122 ms returned sat
[2024-06-01 05:03:05] [INFO ] [Nat]Added 50 Read/Feed constraints in 24 ms returned sat
[2024-06-01 05:03:05] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 29 ms.
[2024-06-01 05:03:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:03:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:03:06] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 103 ms
[2024-06-01 05:03:06] [INFO ] Added : 76 causal constraints over 17 iterations in 548 ms. Result :sat
Minimization took 69 ms.
[2024-06-01 05:03:06] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:06] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2024-06-01 05:03:06] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:06] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2024-06-01 05:03:06] [INFO ] [Nat]Added 50 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:03:06] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 05:03:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 3 ms to minimize.
[2024-06-01 05:03:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:03:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2024-06-01 05:03:07] [INFO ] Added : 90 causal constraints over 19 iterations in 621 ms. Result :sat
Minimization took 78 ms.
[2024-06-01 05:03:07] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:07] [INFO ] [Real]Absence check using state equation in 78 ms returned sat
[2024-06-01 05:03:07] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:07] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:07] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2024-06-01 05:03:07] [INFO ] [Nat]Added 50 Read/Feed constraints in 22 ms returned sat
[2024-06-01 05:03:08] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 05:03:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:03:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:03:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:03:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 181 ms
[2024-06-01 05:03:08] [INFO ] Added : 87 causal constraints over 19 iterations in 672 ms. Result :sat
Minimization took 139 ms.
[2024-06-01 05:03:08] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:08] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-01 05:03:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:09] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:09] [INFO ] [Nat]Absence check using state equation in 85 ms returned sat
[2024-06-01 05:03:09] [INFO ] [Nat]Added 50 Read/Feed constraints in 20 ms returned sat
[2024-06-01 05:03:09] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 24 ms.
[2024-06-01 05:03:09] [INFO ] Added : 116 causal constraints over 24 iterations in 595 ms. Result :sat
Minimization took 79 ms.
[2024-06-01 05:03:09] [INFO ] [Real]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-06-01 05:03:10] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2024-06-01 05:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:10] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2024-06-01 05:03:10] [INFO ] [Nat]Added 50 Read/Feed constraints in 6 ms returned sat
[2024-06-01 05:03:10] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 05:03:10] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:03:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-06-01 05:03:10] [INFO ] Added : 72 causal constraints over 15 iterations in 447 ms. Result :sat
Minimization took 80 ms.
[2024-06-01 05:03:10] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:10] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-06-01 05:03:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:10] [INFO ] [Nat]Absence check using 50 positive place invariants in 7 ms returned sat
[2024-06-01 05:03:11] [INFO ] [Nat]Absence check using state equation in 94 ms returned sat
[2024-06-01 05:03:11] [INFO ] [Nat]Added 50 Read/Feed constraints in 30 ms returned sat
[2024-06-01 05:03:11] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 30 ms.
[2024-06-01 05:03:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:03:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-06-01 05:03:11] [INFO ] Added : 99 causal constraints over 21 iterations in 550 ms. Result :sat
Minimization took 150 ms.
[2024-06-01 05:03:11] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:11] [INFO ] [Real]Absence check using state equation in 83 ms returned sat
[2024-06-01 05:03:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:12] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2024-06-01 05:03:12] [INFO ] [Nat]Added 50 Read/Feed constraints in 43 ms returned sat
[2024-06-01 05:03:12] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 22 ms.
[2024-06-01 05:03:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:03:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:03:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:03:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 4 ms to minimize.
[2024-06-01 05:03:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:03:13] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 278 ms
[2024-06-01 05:03:13] [INFO ] Added : 115 causal constraints over 24 iterations in 872 ms. Result :sat
Minimization took 79 ms.
[2024-06-01 05:03:13] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:13] [INFO ] [Real]Absence check using state equation in 81 ms returned sat
[2024-06-01 05:03:13] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:13] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:13] [INFO ] [Nat]Absence check using state equation in 86 ms returned sat
[2024-06-01 05:03:13] [INFO ] [Nat]Added 50 Read/Feed constraints in 44 ms returned sat
[2024-06-01 05:03:13] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 26 ms.
[2024-06-01 05:03:13] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:03:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-06-01 05:03:14] [INFO ] Added : 85 causal constraints over 18 iterations in 519 ms. Result :sat
Minimization took 73 ms.
[2024-06-01 05:03:14] [INFO ] [Real]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:14] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-01 05:03:14] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:14] [INFO ] [Nat]Absence check using 50 positive place invariants in 8 ms returned sat
[2024-06-01 05:03:14] [INFO ] [Nat]Absence check using state equation in 84 ms returned sat
[2024-06-01 05:03:14] [INFO ] [Nat]Added 50 Read/Feed constraints in 40 ms returned sat
[2024-06-01 05:03:14] [INFO ] Computed and/alt/rep : 300/750/300 causal constraints (skipped 0 transitions) in 23 ms.
[2024-06-01 05:03:14] [INFO ] Added : 102 causal constraints over 21 iterations in 542 ms. Result :sat
Minimization took 151 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[27, 49, 25, 51, 30, 50, 49, 50, 51, 25, 34, 49, 27, 50, 51, 27] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[52, 49, 51, 51, 51, 50, 49, 50, 51, 52, 51, 49, 51, 50, 51, 52] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Support contains 16 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 401/401 transitions.
Graph (complete) has 600 edges and 250 vertex of which 65 are kept as prefixes of interest. Removing 185 places using SCC suffix rule.2 ms
Discarding 185 places :
Also discarding 296 output transitions
Drop transitions (Output transitions of discarded places.) removed 296 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 65 transition count 104
Applied a total of 2 rules in 23 ms. Remains 65 /250 variables (removed 185) and now considering 104/401 (removed 297) transitions.
Running 78 sub problems to find dead transitions.
// Phase 1: matrix 104 rows 65 cols
[2024-06-01 05:03:36] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 05:03:36] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 6 (OVERLAPS) 0/169 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Real declared 169/169 variables, and 91 constraints, problems are : Problem set: 0 solved, 78 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 78 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 1 (OVERLAPS) 13/65 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 3 (OVERLAPS) 104/169 variables, 65/78 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 13/91 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/169 variables, 78/169 constraints. Problems are: Problem set: 0 solved, 78 unsolved
[2024-06-01 05:03:38] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:03:38] [INFO ] Deduced a trap composed of 4 places in 49 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/169 variables, 2/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/169 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
At refinement iteration 8 (OVERLAPS) 0/169 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 78 unsolved
No progress, stopping.
After SMT solving in domain Int declared 169/169 variables, and 171 constraints, problems are : Problem set: 0 solved, 78 unsolved in 4071 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 65/65 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 78/78 constraints, Known Traps: 2/2 constraints]
After SMT, in 5387ms problems are : Problem set: 0 solved, 78 unsolved
Search for dead transitions found 0 dead transitions in 5399ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5434 ms. Remains : 65/250 places, 104/401 transitions.
[2024-06-01 05:03:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[52, 49, 51, 51, 51, 50, 49, 50, 51, 52, 51, 49, 51, 50, 51, 52] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000004 steps (2 resets) in 1289 ms. (775 steps per ms)
FORMULA JoinFreeModules-PT-0050-UpperBounds-11 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-06 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-01 53 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 13000013 steps (26 resets) in 12761 ms. (1018 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52, 51, 51, 51, 50, 50, 51, 52, 51, 51, 50, 51, 52] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2024-06-01 05:03:55] [INFO ] Invariant cache hit.
[2024-06-01 05:03:55] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:55] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2024-06-01 05:03:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:55] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:03:55] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-01 05:03:55] [INFO ] [Nat]Added 13 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:03:55] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:03:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:03:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
Minimization took 14 ms.
[2024-06-01 05:03:55] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:55] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 05:03:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:55] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:55] [INFO ] [Nat]Absence check using state equation in 107 ms returned sat
[2024-06-01 05:03:55] [INFO ] [Nat]Added 13 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:03:55] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:03:56] [INFO ] Added : 64 causal constraints over 14 iterations in 147 ms. Result :sat
Minimization took 35 ms.
[2024-06-01 05:03:56] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:03:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:03:56] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:03:56] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:03:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 38 ms
[2024-06-01 05:03:56] [INFO ] Added : 68 causal constraints over 16 iterations in 198 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 05:03:56] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 05:03:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Nat]Absence check using state equation in 88 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-06-01 05:03:56] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:03:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2024-06-01 05:03:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-06-01 05:03:56] [INFO ] Added : 51 causal constraints over 11 iterations in 120 ms. Result :sat
Minimization took 20 ms.
[2024-06-01 05:03:56] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-01 05:03:56] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:03:56] [INFO ] [Nat]Added 13 Read/Feed constraints in 46 ms returned sat
[2024-06-01 05:03:56] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 12 ms.
[2024-06-01 05:03:57] [INFO ] Added : 59 causal constraints over 13 iterations in 139 ms. Result :sat
Minimization took 31 ms.
[2024-06-01 05:03:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:03:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:57] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2024-06-01 05:03:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 71 ms returned sat
[2024-06-01 05:03:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 9 ms.
[2024-06-01 05:03:57] [INFO ] Added : 57 causal constraints over 13 iterations in 94 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 05:03:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:57] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:03:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:57] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:03:57] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:03:57] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:03:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:03:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 5 ms to minimize.
[2024-06-01 05:03:57] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 05:03:57] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 05:03:57] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 137 ms
[2024-06-01 05:03:57] [INFO ] Added : 66 causal constraints over 15 iterations in 246 ms. Result :sat
Minimization took 33 ms.
[2024-06-01 05:03:57] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:57] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 05:03:57] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:03:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:03:58] [INFO ] Added : 58 causal constraints over 13 iterations in 96 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 05:03:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 05:03:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-06-01 05:03:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:03:58] [INFO ] Added : 54 causal constraints over 13 iterations in 95 ms. Result :sat
Minimization took 29 ms.
[2024-06-01 05:03:58] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-06-01 05:03:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 3 ms returned sat
[2024-06-01 05:03:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:03:58] [INFO ] Added : 59 causal constraints over 13 iterations in 93 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 05:03:58] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-01 05:03:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2024-06-01 05:03:58] [INFO ] [Nat]Added 13 Read/Feed constraints in 25 ms returned sat
[2024-06-01 05:03:58] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:03:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:03:59] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 05:03:59] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 59 ms
[2024-06-01 05:03:59] [INFO ] Added : 37 causal constraints over 9 iterations in 129 ms. Result :sat
Minimization took 25 ms.
[2024-06-01 05:03:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 05:03:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:59] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-06-01 05:03:59] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:03:59] [INFO ] Computed and/alt/rep : 78/195/78 causal constraints (skipped 0 transitions) in 6 ms.
[2024-06-01 05:03:59] [INFO ] Added : 50 causal constraints over 12 iterations in 79 ms. Result :sat
Minimization took 30 ms.
[2024-06-01 05:03:59] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:59] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-06-01 05:03:59] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:03:59] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2024-06-01 05:03:59] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-01 05:03:59] [INFO ] [Nat]Added 13 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:03:59] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 13 ms to minimize.
[2024-06-01 05:03:59] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 36 ms
Current structural bounds on expressions (after SMT) : Max Seen:[52, 51, 51, 51, 50, 50, 51, 52, 51, 51, 50, 51, 52] Max Struct:[52, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 52]
FORMULA JoinFreeModules-PT-0050-UpperBounds-15 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-00 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51, 51, 52, 50, 50, 51, 52, 51, 52, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
Support contains 11 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 104/104 transitions.
Graph (complete) has 156 edges and 65 vertex of which 50 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 2 ms. Remains 50 /65 variables (removed 15) and now considering 80/104 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 50/65 places, 80/104 transitions.
// Phase 1: matrix 80 rows 50 cols
[2024-06-01 05:04:00] [INFO ] Computed 10 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[51, 51, 52, 50, 50, 51, 52, 51, 52, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000005 steps (2 resets) in 951 ms. (1050 steps per ms)
BEST_FIRST walk for 11000011 steps (22 resets) in 8145 ms. (1350 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[52, 51, 52, 50, 50, 51, 52, 51, 52, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53]
[2024-06-01 05:04:10] [INFO ] Invariant cache hit.
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-06-01 05:04:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-06-01 05:04:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:10] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:04:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 21 ms
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:10] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:04:10] [INFO ] Added : 28 causal constraints over 6 iterations in 97 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:04:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:10] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:04:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:04:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 81 ms returned sat
[2024-06-01 05:04:10] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 7 ms.
[2024-06-01 05:04:10] [INFO ] Added : 23 causal constraints over 5 iterations in 36 ms. Result :sat
Minimization took 18 ms.
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 55 ms returned sat
[2024-06-01 05:04:10] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:04:10] [INFO ] Added : 26 causal constraints over 6 iterations in 41 ms. Result :sat
Minimization took 19 ms.
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:04:10] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:10] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:10] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:04:11] [INFO ] Added : 32 causal constraints over 8 iterations in 104 ms. Result :sat
Minimization took 22 ms.
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:11] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:11] [INFO ] Added : 41 causal constraints over 10 iterations in 54 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:11] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:04:11] [INFO ] Added : 35 causal constraints over 9 iterations in 108 ms. Result :sat
Minimization took 21 ms.
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-06-01 05:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:04:11] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Added 10 Read/Feed constraints in 38 ms returned sat
[2024-06-01 05:04:11] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:04:11] [INFO ] Added : 27 causal constraints over 6 iterations in 46 ms. Result :sat
Minimization took 24 ms.
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-06-01 05:04:11] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:11] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-06-01 05:04:12] [INFO ] [Nat]Added 10 Read/Feed constraints in 101 ms returned sat
[2024-06-01 05:04:12] [INFO ] Computed and/alt/rep : 60/150/60 causal constraints (skipped 0 transitions) in 8 ms.
[2024-06-01 05:04:12] [INFO ] Added : 30 causal constraints over 6 iterations in 43 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[52, 51, 52, 50, 50, 51, 52, 51, 52, 50, 51] Max Struct:[52, 53, 52, 53, 53, 53, 53, 53, 52, 53, 53]
FORMULA JoinFreeModules-PT-0050-UpperBounds-12 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-04 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA JoinFreeModules-PT-0050-UpperBounds-02 52 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
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 2 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 2 ms. Remains : 35/50 places, 56/80 transitions.
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:04:12] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
RANDOM walk for 1000000 steps (2 resets) in 704 ms. (1418 steps per ms)
BEST_FIRST walk for 8000008 steps (16 resets) in 4309 ms. (1856 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
[2024-06-01 05:04:17] [INFO ] Invariant cache hit.
[2024-06-01 05:04:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:17] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:04:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:17] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:17] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:04:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:17] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:04:17] [INFO ] Added : 24 causal constraints over 6 iterations in 32 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:04:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:17] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:04:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:17] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:17] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:04:17] [INFO ] [Nat]Added 7 Read/Feed constraints in 14 ms returned sat
[2024-06-01 05:04:17] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:17] [INFO ] Added : 28 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:04:17] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:17] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:04:17] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 31 ms returned sat
[2024-06-01 05:04:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:04:18] [INFO ] Added : 22 causal constraints over 6 iterations in 29 ms. Result :sat
Minimization took 16 ms.
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 5 ms.
[2024-06-01 05:04:18] [INFO ] Added : 29 causal constraints over 6 iterations in 30 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:18] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:04:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 34 ms
[2024-06-01 05:04:18] [INFO ] Added : 28 causal constraints over 6 iterations in 69 ms. Result :sat
Minimization took 11 ms.
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:18] [INFO ] Added : 21 causal constraints over 5 iterations in 23 ms. Result :sat
Minimization took 15 ms.
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:04:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:04:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:18] [INFO ] Added : 29 causal constraints over 7 iterations in 32 ms. Result :sat
Minimization took 17 ms.
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2024-06-01 05:04:18] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:18] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:18] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:04:18] [INFO ] Added : 22 causal constraints over 6 iterations in 26 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51, 50, 50, 51, 52, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53, 53]
Support contains 8 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 05:04:19] [INFO ] Invariant cache hit.
[2024-06-01 05:04:19] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-06-01 05:04:19] [INFO ] Invariant cache hit.
[2024-06-01 05:04:19] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:04:19] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
[2024-06-01 05:04:19] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 05:04:19] [INFO ] Invariant cache hit.
[2024-06-01 05:04:19] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 691 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1140ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1140ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1213 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 40040 steps (8 resets) in 664 ms. (60 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 157509 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :0 out of 16
Probabilistic random walk after 157509 steps, saw 135839 distinct states, run finished after 3004 ms. (steps per millisecond=52 ) properties seen :0
[2024-06-01 05:04:23] [INFO ] Invariant cache hit.
[2024-06-01 05:04:23] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 27/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2024-06-01 05:04:23] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
[2024-06-01 05:04:23] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:04:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:04:23] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:04:23] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:04:24] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:04:24] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
Problem MAX3 is UNSAT
[2024-06-01 05:04:24] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Problem MAX4 is UNSAT
Problem MIN4 is UNSAT
Problem MAX5 is UNSAT
Problem MAX6 is UNSAT
Problem MAX7 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 8/15 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/50 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/57 constraints. Problems are: Problem set: 9 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/57 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/57 constraints. Problems are: Problem set: 9 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 57 constraints, problems are : Problem set: 9 solved, 7 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 9 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 28/35 variables, 7/7 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 8/15 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/15 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/50 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/57 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 7/64 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/91 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 64 constraints, problems are : Problem set: 9 solved, 7 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/16 constraints, Known Traps: 8/8 constraints]
After SMT, in 553ms problems are : Problem set: 9 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1262 ms.
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Running 42 sub problems to find dead transitions.
[2024-06-01 05:04:25] [INFO ] Invariant cache hit.
[2024-06-01 05:04:25] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 435 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 704 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1156ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1157ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1159 ms. Remains : 35/35 places, 56/56 transitions.
RANDOM walk for 40017 steps (8 resets) in 67 ms. (588 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 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 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 218065 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :0 out of 7
Probabilistic random walk after 218065 steps, saw 186715 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
[2024-06-01 05:04:30] [INFO ] Invariant cache hit.
[2024-06-01 05:04:30] [INFO ] State equation strengthened by 7 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) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 7 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 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) 28/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:04:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:04:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 56/91 variables, 35/44 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-01 05:04:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:04:30] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:04:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/91 variables, 3/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 0/91 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 61 constraints, problems are : Problem set: 0 solved, 7 unsolved in 439 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 5/5 constraints]
After SMT, in 539ms problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 966 ms.
Support contains 7 out of 35 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 2 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 35/35 places, 56/56 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 35/35 places, 56/56 transitions.
Applied a total of 0 rules in 1 ms. Remains 35 /35 variables (removed 0) and now considering 56/56 (removed 0) transitions.
[2024-06-01 05:04:31] [INFO ] Invariant cache hit.
[2024-06-01 05:04:31] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 05:04:31] [INFO ] Invariant cache hit.
[2024-06-01 05:04:31] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:04:31] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2024-06-01 05:04:31] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
[2024-06-01 05:04:31] [INFO ] Invariant cache hit.
[2024-06-01 05:04:31] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 0/91 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 49 constraints, problems are : Problem set: 0 solved, 42 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 7/35 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 56/91 variables, 35/42 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/91 variables, 42/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (OVERLAPS) 0/91 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 91 constraints, problems are : Problem set: 0 solved, 42 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 35/35 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 0/0 constraints]
After SMT, in 1087ms problems are : Problem set: 0 solved, 42 unsolved
Search for dead transitions found 0 dead transitions in 1087ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1146 ms. Remains : 35/35 places, 56/56 transitions.
FORMULA JoinFreeModules-PT-0050-UpperBounds-09 52 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[51, 50, 50, 51, 51, 50, 51] Max Struct:[53, 53, 53, 53, 53, 53, 53]
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-03
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:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[53]
[2024-06-01 05:04:32] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[53]
RANDOM walk for 10009 steps (2 resets) in 12 ms. (769 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:[51] Max Struct:[53]
[2024-06-01 05:04:32] [INFO ] Invariant cache hit.
[2024-06-01 05:04:32] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:32] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:04:32] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:32] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:32] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:04:32] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:04:32] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:32] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:04:32] [INFO ] Added : 24 causal constraints over 6 iterations in 27 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:04:32] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:04:32] [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 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]
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 100 ms. Remains : 5/35 places, 8/56 transitions.
[2024-06-01 05:04:33] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000009 steps (2 resets) in 192 ms. (5181 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 243 ms. (4098 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-06-01 05:04:33] [INFO ] Invariant cache hit.
[2024-06-01 05:04:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:33] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:04:33] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:33] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:04:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:33] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:04:33] [INFO ] Added : 6 causal constraints over 3 iterations in 7 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
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 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2024-06-01 05:04:33] [INFO ] Invariant cache hit.
[2024-06-01 05:04:33] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 05:04:33] [INFO ] Invariant cache hit.
[2024-06-01 05:04:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:04:33] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 05:04:33] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:04:33] [INFO ] Invariant cache hit.
[2024-06-01 05:04:33] [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 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]
After SMT, in 101ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40008 steps (8 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1760411 steps, run timeout after 3001 ms. (steps per millisecond=586 ) properties seen :0 out of 2
Probabilistic random walk after 1760411 steps, saw 381251 distinct states, run finished after 3001 ms. (steps per millisecond=586 ) properties seen :0
[2024-06-01 05:04:36] [INFO ] Invariant cache hit.
[2024-06-01 05:04:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:04:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 90ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
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.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:04:36] [INFO ] Invariant cache hit.
[2024-06-01 05:04:36] [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 51 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/5 places, 8/8 transitions.
RANDOM walk for 40008 steps (8 resets) in 24 ms. (1600 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1612 ms. (steps per millisecond=1800 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1595 ms. (steps per millisecond=1822 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-03 51 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-03 in 7436 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[53]
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:04:40] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 10000 steps (2 resets) in 8 ms. (1111 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:[50] Max Struct:[53]
[2024-06-01 05:04:40] [INFO ] Invariant cache hit.
[2024-06-01 05:04:40] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:40] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:40] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:40] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:04:40] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:04:40] [INFO ] [Nat]Added 7 Read/Feed constraints in 22 ms returned sat
[2024-06-01 05:04:40] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:04:40] [INFO ] Added : 28 causal constraints over 6 iterations in 35 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:04:40] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:04:40] [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 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]
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 97 ms. Remains : 5/35 places, 8/56 transitions.
[2024-06-01 05:04:40] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 1000016 steps (2 resets) in 208 ms. (4784 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 169 ms. (5882 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-06-01 05:04:40] [INFO ] Invariant cache hit.
[2024-06-01 05:04:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:04:40] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:04:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:04:40] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:04:40] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:04:40] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:04:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:04:40] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 05:04:40] [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:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
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:04:40] [INFO ] Invariant cache hit.
[2024-06-01 05:04:40] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 05:04:40] [INFO ] Invariant cache hit.
[2024-06-01 05:04:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:04:40] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 05:04:40] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:04:40] [INFO ] Invariant cache hit.
[2024-06-01 05:04:40] [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 56 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 51 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 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 164 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40029 steps (8 resets) in 45 ms. (870 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 24 ms. (1600 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1587902 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :0 out of 2
Probabilistic random walk after 1587902 steps, saw 378797 distinct states, run finished after 3001 ms. (steps per millisecond=529 ) properties seen :0
[2024-06-01 05:04:44] [INFO ] Invariant cache hit.
[2024-06-01 05:04:44] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:04:44] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 49 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 83ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
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.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:04:44] [INFO ] Invariant cache hit.
[2024-06-01 05:04:44] [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 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]
After SMT, in 103ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40048 steps (8 resets) in 25 ms. (1540 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1871 ms. (steps per millisecond=1551 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1112 ms. (steps per millisecond=2613 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-05 50 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-05 in 7136 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-07
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[53]
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:04:47] [INFO ] Computed 7 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 10016 steps (2 resets) in 8 ms. (1112 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-06-01 05:04:47] [INFO ] Invariant cache hit.
[2024-06-01 05:04:47] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:47] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:47] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:47] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:04:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:04:47] [INFO ] [Nat]Added 7 Read/Feed constraints in 31 ms returned sat
[2024-06-01 05:04:47] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 2 ms.
[2024-06-01 05:04:47] [INFO ] Added : 22 causal constraints over 6 iterations in 23 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:04:47] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 05:04:47] [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 56 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 110ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 5/35 places, 8/56 transitions.
[2024-06-01 05:04:47] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 1000024 steps (2 resets) in 227 ms. (4386 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 165 ms. (6024 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-06-01 05:04:48] [INFO ] Invariant cache hit.
[2024-06-01 05:04:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:04:48] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:04:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:04:48] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:04:48] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:04:48] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:04:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2024-06-01 05:04:48] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:04:48] [INFO ] Added : 5 causal constraints over 2 iterations in 8 ms. Result :sat
Minimization took 5 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
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 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:04:48] [INFO ] Invariant cache hit.
[2024-06-01 05:04:48] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 05:04:48] [INFO ] Invariant cache hit.
[2024-06-01 05:04:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:04:48] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 05:04:48] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:04:48] [INFO ] Invariant cache hit.
[2024-06-01 05:04:48] [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 54 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 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40009 steps (8 resets) in 24 ms. (1600 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 28 ms. (1379 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1901962 steps, run timeout after 3001 ms. (steps per millisecond=633 ) properties seen :0 out of 2
Probabilistic random walk after 1901962 steps, saw 383374 distinct states, run finished after 3002 ms. (steps per millisecond=633 ) properties seen :0
[2024-06-01 05:04:51] [INFO ] Invariant cache hit.
[2024-06-01 05:04:51] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:04:51] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 81ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
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.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:04:51] [INFO ] Invariant cache hit.
[2024-06-01 05:04:51] [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 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]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40007 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 20 ms. (1904 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1801 ms. (steps per millisecond=1611 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1146 ms. (steps per millisecond=2535 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-07 50 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-07 in 7115 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-08
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:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[53]
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:04:54] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[53]
RANDOM walk for 10004 steps (2 resets) in 7 ms. (1250 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:[51] Max Struct:[53]
[2024-06-01 05:04:54] [INFO ] Invariant cache hit.
[2024-06-01 05:04:54] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:54] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:04:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:54] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:04:54] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-06-01 05:04:54] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:04:54] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:54] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 4 ms.
[2024-06-01 05:04:54] [INFO ] Added : 29 causal constraints over 6 iterations in 28 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:04:54] [INFO ] Computed 1 invariants in 2 ms
[2024-06-01 05:04:54] [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 101ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 5/35 places, 8/56 transitions.
[2024-06-01 05:04:54] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000013 steps (2 resets) in 217 ms. (4587 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:[51] Max Struct:[53]
[2024-06-01 05:04:55] [INFO ] Invariant cache hit.
[2024-06-01 05:04:55] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:04:55] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-06-01 05:04:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:04:55] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:04:55] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:04:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:04:55] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:04:55] [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:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
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:04:55] [INFO ] Invariant cache hit.
[2024-06-01 05:04:55] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 05:04:55] [INFO ] Invariant cache hit.
[2024-06-01 05:04:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:04:55] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 05:04:55] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:04:55] [INFO ] Invariant cache hit.
[2024-06-01 05:04:55] [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 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]
After SMT, in 102ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 103ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 151 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40030 steps (8 resets) in 39 ms. (1000 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 22 ms. (1739 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1046684 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 2
Probabilistic random walk after 1046684 steps, saw 364296 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
[2024-06-01 05:04:58] [INFO ] Invariant cache hit.
[2024-06-01 05:04:58] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:04:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 82ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
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.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:04:58] [INFO ] Invariant cache hit.
[2024-06-01 05:04: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 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 51 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 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40034 steps (8 resets) in 16 ms. (2354 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 16 ms. (2353 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1709 ms. (steps per millisecond=1698 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1118 ms. (steps per millisecond=2599 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-08 51 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-08 in 6971 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-10
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:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[53]
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:05:01] [INFO ] Computed 7 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[53]
RANDOM walk for 10022 steps (2 resets) in 9 ms. (1002 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:[51] Max Struct:[53]
[2024-06-01 05:05:01] [INFO ] Invariant cache hit.
[2024-06-01 05:05:01] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:01] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:05:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:01] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:01] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:05:01] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:05:01] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:05:01] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:05:01] [INFO ] Added : 21 causal constraints over 5 iterations in 22 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:05:01] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:05: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 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 49 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 112ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 112ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 113 ms. Remains : 5/35 places, 8/56 transitions.
[2024-06-01 05:05:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000002 steps (2 resets) in 236 ms. (4219 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 146 ms. (6802 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-06-01 05:05:02] [INFO ] Invariant cache hit.
[2024-06-01 05:05:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:02] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:05:02] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-06-01 05:05:02] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:05:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:05:02] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:05:02] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2024-06-01 05:05:02] [INFO ] Added : 6 causal constraints over 3 iterations in 5 ms. Result :sat
Minimization took 10 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
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:05:02] [INFO ] Invariant cache hit.
[2024-06-01 05:05:02] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 05:05:02] [INFO ] Invariant cache hit.
[2024-06-01 05:05:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:05:02] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-06-01 05:05:02] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:05:02] [INFO ] Invariant cache hit.
[2024-06-01 05:05: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 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 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]
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 139 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40018 steps (8 resets) in 35 ms. (1111 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
Interrupted probabilistic random walk after 1583871 steps, run timeout after 3001 ms. (steps per millisecond=527 ) properties seen :0 out of 2
Probabilistic random walk after 1583871 steps, saw 378750 distinct states, run finished after 3001 ms. (steps per millisecond=527 ) properties seen :0
[2024-06-01 05:05:05] [INFO ] Invariant cache hit.
[2024-06-01 05:05:05] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:05:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 87ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
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.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:05:05] [INFO ] Invariant cache hit.
[2024-06-01 05:05: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 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 52 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 105ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 106ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40021 steps (8 resets) in 26 ms. (1482 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 18 ms. (2105 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1651 ms. (steps per millisecond=1758 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1332 ms. (steps per millisecond=2181 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-10 51 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-10 in 7129 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[50] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[50] Max Struct:[53]
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:05:08] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 10008 steps (2 resets) in 8 ms. (1112 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:[50] Max Struct:[53]
[2024-06-01 05:05:08] [INFO ] Invariant cache hit.
[2024-06-01 05:05:08] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:08] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-06-01 05:05:08] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:05:08] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-06-01 05:05:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:05:08] [INFO ] [Nat]Added 7 Read/Feed constraints in 15 ms returned sat
[2024-06-01 05:05:08] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:05:08] [INFO ] Added : 29 causal constraints over 7 iterations in 32 ms. Result :sat
Minimization took 16 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.1 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:05:08] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:05:08] [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 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]
After SMT, in 104ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 104ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 106 ms. Remains : 5/35 places, 8/56 transitions.
[2024-06-01 05:05:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[50] Max Struct:[53]
RANDOM walk for 1000000 steps (2 resets) in 189 ms. (5263 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 184 ms. (5405 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[50] Max Struct:[53]
[2024-06-01 05:05:09] [INFO ] Invariant cache hit.
[2024-06-01 05:05:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:09] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2024-06-01 05:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:05:09] [INFO ] [Real]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:05:09] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:09] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:05:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2024-06-01 05:05:09] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:05:09] [INFO ] Added : 5 causal constraints over 2 iterations in 6 ms. Result :sat
Minimization took 6 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[50] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[50] Max Struct:[53]
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:05:09] [INFO ] Invariant cache hit.
[2024-06-01 05:05:09] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 05:05:09] [INFO ] Invariant cache hit.
[2024-06-01 05:05:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:05:09] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 05:05:09] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:05:09] [INFO ] Invariant cache hit.
[2024-06-01 05:05:09] [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 49 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 99ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40037 steps (8 resets) in 34 ms. (1143 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 21 ms. (1818 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1044054 steps, run timeout after 3001 ms. (steps per millisecond=347 ) properties seen :0 out of 2
Probabilistic random walk after 1044054 steps, saw 363712 distinct states, run finished after 3001 ms. (steps per millisecond=347 ) properties seen :0
[2024-06-01 05:05:12] [INFO ] Invariant cache hit.
[2024-06-01 05:05:12] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:05:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 86ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
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.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:05:12] [INFO ] Invariant cache hit.
[2024-06-01 05:05:12] [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 57 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 113ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 113ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 114 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40020 steps (8 resets) in 25 ms. (1539 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 13 ms. (2857 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 1843 ms. (steps per millisecond=1574 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1488 ms. (steps per millisecond=1953 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-13 50 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-13 in 7487 ms.
Starting property specific reduction for JoinFreeModules-PT-0050-UpperBounds-14
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:[53]
Current structural bounds on expressions (Before main loop) : Max Seen:[1] Max Struct:[53]
// Phase 1: matrix 56 rows 35 cols
[2024-06-01 05:05:16] [INFO ] Computed 7 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[1] Max Struct:[53]
RANDOM walk for 10003 steps (2 resets) in 8 ms. (1111 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 7 ms. (1250 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-06-01 05:05:16] [INFO ] Invariant cache hit.
[2024-06-01 05:05:16] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-01 05:05:16] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:05:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-01 05:05:16] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-06-01 05:05:16] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-01 05:05:16] [INFO ] [Nat]Added 7 Read/Feed constraints in 1 ms returned sat
[2024-06-01 05:05:16] [INFO ] Computed and/alt/rep : 42/105/42 causal constraints (skipped 0 transitions) in 3 ms.
[2024-06-01 05:05:16] [INFO ] Added : 22 causal constraints over 6 iterations in 34 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
Support contains 1 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 5 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /35 variables (removed 30) and now considering 8/56 (removed 48) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 05:05:16] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 05:05:16] [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 49 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 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]
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 100 ms. Remains : 5/35 places, 8/56 transitions.
[2024-06-01 05:05:16] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[51] Max Struct:[53]
RANDOM walk for 1000000 steps (2 resets) in 194 ms. (5128 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 200 ms. (4975 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[51] Max Struct:[53]
[2024-06-01 05:05:16] [INFO ] Invariant cache hit.
[2024-06-01 05:05:16] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:05:16] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-06-01 05:05:16] [INFO ] Solution in real domain found non-integer solution.
[2024-06-01 05:05:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 05:05:16] [INFO ] [Nat]Absence check using state equation in 2 ms returned sat
[2024-06-01 05:05:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:05:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2024-06-01 05:05:16] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 1 ms.
[2024-06-01 05:05:16] [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:[51] Max Struct:[53]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[51] Max Struct:[53]
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:05:16] [INFO ] Invariant cache hit.
[2024-06-01 05:05:16] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 05:05:16] [INFO ] Invariant cache hit.
[2024-06-01 05:05:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 05:05:16] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 05:05:16] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2024-06-01 05:05:16] [INFO ] Invariant cache hit.
[2024-06-01 05:05:16] [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 55 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 51 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 111ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 111ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 162 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40010 steps (8 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 25 ms. (1538 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1601837 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :0 out of 2
Probabilistic random walk after 1601837 steps, saw 378947 distinct states, run finished after 3001 ms. (steps per millisecond=533 ) properties seen :0
[2024-06-01 05:05:19] [INFO ] Invariant cache hit.
[2024-06-01 05:05:19] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:05:20] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
Problem MAX0 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 8 constraints, problems are : Problem set: 1 solved, 1 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 8/13 variables, 5/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 1/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 1/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/13 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 9 constraints, problems are : Problem set: 1 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 88ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
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.
Running 6 sub problems to find dead transitions.
[2024-06-01 05:05:20] [INFO ] Invariant cache hit.
[2024-06-01 05:05:20] [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 55 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 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 101ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 102 ms. Remains : 5/5 places, 8/8 transitions.
RANDOM walk for 40019 steps (8 resets) in 21 ms. (1819 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 15 ms. (2500 steps per ms) remains 1/1 properties
Probably explored full state space saw : 393111 states, properties seen :0
Probabilistic random walk after 2902721 steps, saw 393111 distinct states, run finished after 2162 ms. (steps per millisecond=1342 ) properties seen :0
Explored full state space saw : 393720 states, properties seen :0
Exhaustive walk after 2906120 steps, saw 393720 distinct states, run finished after 1339 ms. (steps per millisecond=2170 ) properties seen :0
FORMULA JoinFreeModules-PT-0050-UpperBounds-14 51 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0050-UpperBounds-14 in 7682 ms.
[2024-06-01 05:05:23] [INFO ] Flatten gal took : 144 ms
Total runtime 147457 ms.
ITS solved all properties within timeout

BK_STOP 1717218323935

--------------------
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-0050"
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-0050, 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-171649611900045"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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