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.r480-tall-171624189400509.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 DBSingleClientW-PT-d1m06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189400509
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 848K
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 12:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 12 12:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 12 12:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 12 12:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K 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 DBSingleClientW-PT-d1m06-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717189449866

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:04:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2024-05-31 21:04:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:04:11] [INFO ] Load time of PNML (sax parser for PT used): 124 ms
[2024-05-31 21:04:11] [INFO ] Transformed 1440 places.
[2024-05-31 21:04:11] [INFO ] Transformed 672 transitions.
[2024-05-31 21:04:11] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 244 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf]
// Phase 1: matrix 672 rows 347 cols
[2024-05-31 21:04:11] [INFO ] Computed 6 invariants in 44 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[6, 6, 6, 6]
RANDOM walk for 10000 steps (2325 resets) in 142 ms. (69 steps per ms)
BEST_FIRST walk for 40001 steps (3616 resets) in 179 ms. (222 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 4] Max Struct:[6, 6, 6, 6]
[2024-05-31 21:04:11] [INFO ] Invariant cache hit.
[2024-05-31 21:04:12] [INFO ] [Real]Absence check using 2 positive place invariants in 12 ms returned sat
[2024-05-31 21:04:12] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned sat
[2024-05-31 21:04:12] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2024-05-31 21:04:12] [INFO ] State equation strengthened by 418 read => feed constraints.
[2024-05-31 21:04:12] [INFO ] [Real]Added 418 Read/Feed constraints in 90 ms returned sat
[2024-05-31 21:04:12] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:12] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:04:12] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:04:13] [INFO ] [Nat]Absence check using state equation in 271 ms returned sat
[2024-05-31 21:04:13] [INFO ] [Nat]Added 418 Read/Feed constraints in 103 ms returned sat
[2024-05-31 21:04:13] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 128 ms.
[2024-05-31 21:04:13] [INFO ] Added : 7 causal constraints over 2 iterations in 316 ms. Result :sat
Minimization took 524 ms.
[2024-05-31 21:04:14] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:04:14] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:04:14] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2024-05-31 21:04:14] [INFO ] [Real]Added 418 Read/Feed constraints in 122 ms returned sat
[2024-05-31 21:04:14] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-31 21:04:14] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:04:14] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:04:14] [INFO ] [Nat]Added 418 Read/Feed constraints in 74 ms returned sat
[2024-05-31 21:04:14] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 69 ms.
[2024-05-31 21:04:14] [INFO ] Added : 5 causal constraints over 1 iterations in 219 ms. Result :sat
Minimization took 508 ms.
[2024-05-31 21:04:15] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2024-05-31 21:04:15] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-31 21:04:15] [INFO ] [Real]Absence check using state equation in 138 ms returned sat
[2024-05-31 21:04:15] [INFO ] [Real]Added 418 Read/Feed constraints in 74 ms returned sat
[2024-05-31 21:04:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:04:15] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:04:16] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2024-05-31 21:04:16] [INFO ] [Nat]Added 418 Read/Feed constraints in 69 ms returned sat
[2024-05-31 21:04:16] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 67 ms.
[2024-05-31 21:04:16] [INFO ] Added : 7 causal constraints over 2 iterations in 198 ms. Result :sat
Minimization took 502 ms.
[2024-05-31 21:04:16] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:04:16] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2024-05-31 21:04:17] [INFO ] [Real]Absence check using state equation in 151 ms returned sat
[2024-05-31 21:04:17] [INFO ] [Real]Added 418 Read/Feed constraints in 85 ms returned sat
[2024-05-31 21:04:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:17] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 21:04:17] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2024-05-31 21:04:17] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2024-05-31 21:04:17] [INFO ] [Nat]Added 418 Read/Feed constraints in 59 ms returned sat
[2024-05-31 21:04:17] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 59 ms.
[2024-05-31 21:04:17] [INFO ] Added : 1 causal constraints over 1 iterations in 146 ms. Result :sat
Minimization took 509 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 4] Max Struct:[6, 6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 4] Max Struct:[6, 6, 6, 6]
Support contains 4 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 672/672 transitions.
Graph (complete) has 1246 edges and 347 vertex of which 325 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.3 ms
Discarding 22 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 88 transitions.
Iterating post reduction 0 with 88 rules applied. Total rules applied 89 place count 325 transition count 584
Discarding 92 places :
Symmetric choice reduction at 1 with 92 rule applications. Total rules 181 place count 233 transition count 339
Iterating global reduction 1 with 92 rules applied. Total rules applied 273 place count 233 transition count 339
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 277 place count 233 transition count 335
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 348 place count 162 transition count 264
Iterating global reduction 2 with 71 rules applied. Total rules applied 419 place count 162 transition count 264
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 425 place count 162 transition count 258
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 465 place count 122 transition count 196
Iterating global reduction 3 with 40 rules applied. Total rules applied 505 place count 122 transition count 196
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 528 place count 122 transition count 173
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 538 place count 112 transition count 159
Iterating global reduction 4 with 10 rules applied. Total rules applied 548 place count 112 transition count 159
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 550 place count 112 transition count 157
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 556 place count 106 transition count 151
Iterating global reduction 5 with 6 rules applied. Total rules applied 562 place count 106 transition count 151
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 563 place count 106 transition count 150
Discarding 5 places :
Symmetric choice reduction at 6 with 5 rule applications. Total rules 568 place count 101 transition count 145
Iterating global reduction 6 with 5 rules applied. Total rules applied 573 place count 101 transition count 145
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 575 place count 101 transition count 143
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 577 place count 99 transition count 135
Iterating global reduction 7 with 2 rules applied. Total rules applied 579 place count 99 transition count 135
Applied a total of 579 rules in 106 ms. Remains 99 /347 variables (removed 248) and now considering 135/672 (removed 537) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 119 ms. Remains : 99/347 places, 135/672 transitions.
// Phase 1: matrix 135 rows 99 cols
[2024-05-31 21:04:18] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 4] Max Struct:[6, 6, 6, 6]
RANDOM walk for 1000000 steps (229395 resets) in 2150 ms. (464 steps per ms)
BEST_FIRST walk for 4000002 steps (380653 resets) in 3777 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 5] Max Struct:[6, 6, 6, 6]
[2024-05-31 21:04:24] [INFO ] Invariant cache hit.
[2024-05-31 21:04:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:24] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:04:24] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-05-31 21:04:24] [INFO ] [Real]Added 46 Read/Feed constraints in 12 ms returned sat
[2024-05-31 21:04:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-31 21:04:24] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:04:24] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:24] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 99 transitions) in 9 ms.
[2024-05-31 21:04:24] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 12 ms to minimize.
[2024-05-31 21:04:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2024-05-31 21:04:24] [INFO ] Added : 17 causal constraints over 5 iterations in 190 ms. Result :sat
Minimization took 75 ms.
[2024-05-31 21:04:24] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:24] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:04:24] [INFO ] [Real]Added 46 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:04:24] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:24] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:24] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:04:24] [INFO ] [Nat]Added 46 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:24] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 99 transitions) in 7 ms.
[2024-05-31 21:04:24] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-31 21:04:25] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:04:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2024-05-31 21:04:25] [INFO ] Added : 21 causal constraints over 6 iterations in 236 ms. Result :sat
Minimization took 97 ms.
[2024-05-31 21:04:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:25] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:04:25] [INFO ] [Real]Added 46 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:04:25] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:25] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:25] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:04:25] [INFO ] [Nat]Added 46 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:04:25] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 99 transitions) in 9 ms.
[2024-05-31 21:04:25] [INFO ] Deduced a trap composed of 13 places in 55 ms of which 1 ms to minimize.
[2024-05-31 21:04:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-31 21:04:25] [INFO ] Added : 8 causal constraints over 3 iterations in 112 ms. Result :sat
Minimization took 77 ms.
[2024-05-31 21:04:25] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:25] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:04:25] [INFO ] [Real]Added 46 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:04:25] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:04:25] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 57 ms
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 5] Max Struct:[6, 6, 6, 5]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 5 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 6]
Support contains 3 out of 99 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 99/99 places, 135/135 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 130
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 130
Applied a total of 2 rules in 10 ms. Remains 98 /99 variables (removed 1) and now considering 130/135 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 98/99 places, 130/135 transitions.
// Phase 1: matrix 130 rows 98 cols
[2024-05-31 21:04:25] [INFO ] Computed 2 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[6, 6, 6]
RANDOM walk for 1000000 steps (229096 resets) in 2055 ms. (486 steps per ms)
BEST_FIRST walk for 3000001 steps (294397 resets) in 2788 ms. (1075 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[6, 6, 6]
[2024-05-31 21:04:30] [INFO ] Invariant cache hit.
[2024-05-31 21:04:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:30] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2024-05-31 21:04:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:04:30] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:30] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:30] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:30] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:04:30] [INFO ] [Nat]Added 41 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:04:30] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 7 ms.
[2024-05-31 21:04:30] [INFO ] Deduced a trap composed of 14 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:04:31] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:04:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 134 ms
[2024-05-31 21:04:31] [INFO ] Added : 16 causal constraints over 4 iterations in 205 ms. Result :sat
Minimization took 109 ms.
[2024-05-31 21:04:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:31] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 21:04:31] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:04:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:31] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:04:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:31] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 8 ms.
[2024-05-31 21:04:31] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2024-05-31 21:04:31] [INFO ] Deduced a trap composed of 16 places in 50 ms of which 1 ms to minimize.
[2024-05-31 21:04:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 122 ms
[2024-05-31 21:04:31] [INFO ] Added : 12 causal constraints over 4 iterations in 172 ms. Result :sat
Minimization took 77 ms.
[2024-05-31 21:04:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:31] [INFO ] [Real]Absence check using state equation in 36 ms returned sat
[2024-05-31 21:04:31] [INFO ] [Real]Added 41 Read/Feed constraints in 9 ms returned sat
[2024-05-31 21:04:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:31] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2024-05-31 21:04:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 7 ms returned sat
[2024-05-31 21:04:31] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 8 ms.
[2024-05-31 21:04:31] [INFO ] Added : 7 causal constraints over 3 iterations in 43 ms. Result :sat
Minimization took 75 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[6, 6, 6]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Applied a total of 0 rules in 8 ms. Remains 98 /98 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 98/98 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Applied a total of 0 rules in 16 ms. Remains 98 /98 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-31 21:04:31] [INFO ] Invariant cache hit.
[2024-05-31 21:04:32] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-31 21:04:32] [INFO ] Invariant cache hit.
[2024-05-31 21:04:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:04:32] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 274 ms to find 0 implicit places.
[2024-05-31 21:04:32] [INFO ] Redundant transitions in 2 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-31 21:04:32] [INFO ] Invariant cache hit.
[2024-05-31 21:04:32] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/228 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 141 constraints, problems are : Problem set: 0 solved, 129 unsolved in 3265 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/228 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 129/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 270 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5404 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 8913ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 8933ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9248 ms. Remains : 98/98 places, 130/130 transitions.
[2024-05-31 21:04:41] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1] Max Struct:[6, 6, 6]
RANDOM walk for 1000000 steps (229257 resets) in 2044 ms. (488 steps per ms)
BEST_FIRST walk for 3000000 steps (295155 resets) in 2832 ms. (1058 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 1] Max Struct:[6, 6, 6]
[2024-05-31 21:04:46] [INFO ] Invariant cache hit.
[2024-05-31 21:04:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 21:04:46] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:04:46] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:46] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 7 ms.
[2024-05-31 21:04:46] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2024-05-31 21:04:46] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 2 ms to minimize.
[2024-05-31 21:04:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2024-05-31 21:04:46] [INFO ] Added : 16 causal constraints over 4 iterations in 191 ms. Result :sat
Minimization took 106 ms.
[2024-05-31 21:04:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:46] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Nat]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:46] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 9 ms.
[2024-05-31 21:04:46] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:04:46] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-31 21:04:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2024-05-31 21:04:46] [INFO ] Added : 12 causal constraints over 4 iterations in 178 ms. Result :sat
Minimization took 78 ms.
[2024-05-31 21:04:46] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:04:46] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:04:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:04:47] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:04:47] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:04:47] [INFO ] [Nat]Added 41 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:04:47] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 12 ms.
[2024-05-31 21:04:47] [INFO ] Added : 7 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 76 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 1] Max Struct:[6, 6, 6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 1] Max Struct:[6, 6, 6]
Support contains 3 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 130/130 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 98/98 places, 130/130 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 130/130 (removed 0) transitions.
[2024-05-31 21:04:47] [INFO ] Invariant cache hit.
[2024-05-31 21:04:47] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-05-31 21:04:47] [INFO ] Invariant cache hit.
[2024-05-31 21:04:47] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:04:47] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2024-05-31 21:04:47] [INFO ] Redundant transitions in 2 ms returned []
Running 129 sub problems to find dead transitions.
[2024-05-31 21:04:47] [INFO ] Invariant cache hit.
[2024-05-31 21:04:47] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/228 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (OVERLAPS) 0/228 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 141 constraints, problems are : Problem set: 0 solved, 129 unsolved in 2838 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (OVERLAPS) 1/98 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 130/228 variables, 98/100 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/228 variables, 41/141 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/228 variables, 129/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/228 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 8 (OVERLAPS) 0/228 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 129 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 270 constraints, problems are : Problem set: 0 solved, 129 unsolved in 5447 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 0/0 constraints]
After SMT, in 8484ms problems are : Problem set: 0 solved, 129 unsolved
Search for dead transitions found 0 dead transitions in 8487ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8763 ms. Remains : 98/98 places, 130/130 transitions.
RANDOM walk for 40000 steps (9161 resets) in 1394 ms. (28 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (4021 resets) in 195 ms. (204 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (3947 resets) in 145 ms. (274 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3978 resets) in 178 ms. (223 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (3877 resets) in 113 ms. (350 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3874 resets) in 130 ms. (305 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3885 resets) in 115 ms. (344 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 979791 steps, run timeout after 3001 ms. (steps per millisecond=326 ) properties seen :3 out of 6
Probabilistic random walk after 979791 steps, saw 370110 distinct states, run finished after 3004 ms. (steps per millisecond=326 ) properties seen :3
[2024-05-31 21:04:59] [INFO ] Invariant cache hit.
[2024-05-31 21:04:59] [INFO ] State equation strengthened by 41 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 10/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 104/117 variables, 11/14 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/117 variables, 14/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/117 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 60/177 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/177 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 7/184 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 44/228 variables, 40/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 27/141 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-31 21:05:00] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MAX1 is UNSAT
Problem MAX2 is UNSAT
After SMT solving in domain Real declared 228/228 variables, and 142 constraints, problems are : Problem set: 3 solved, 0 unsolved in 235 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 98/98 constraints, ReadFeed: 41/41 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 240ms problems are : Problem set: 3 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0, 0, 1] Max Struct:[6, 6, 6]
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-05
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:05:00] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2294 resets) in 24 ms. (400 steps per ms)
BEST_FIRST walk for 10001 steps (947 resets) in 13 ms. (714 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:05:00] [INFO ] Invariant cache hit.
[2024-05-31 21:05:00] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:00] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 21:05:00] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:05:00] [INFO ] [Real]Added 41 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:05:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:05:00] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:00] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:05:00] [INFO ] [Nat]Added 41 Read/Feed constraints in 31 ms returned sat
[2024-05-31 21:05:00] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 11 ms.
[2024-05-31 21:05:00] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-05-31 21:05:00] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 36 ms to minimize.
[2024-05-31 21:05:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2024-05-31 21:05:00] [INFO ] Added : 16 causal constraints over 4 iterations in 293 ms. Result :sat
Minimization took 105 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 94 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 94 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 92 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 92 transition count 117
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 90 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 90 transition count 112
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 88 transition count 110
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 88 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 22 place count 88 transition count 108
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 23 place count 87 transition count 107
Iterating global reduction 1 with 1 rules applied. Total rules applied 24 place count 87 transition count 107
Applied a total of 24 rules in 21 ms. Remains 87 /98 variables (removed 11) and now considering 107/130 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 87/98 places, 107/130 transitions.
// Phase 1: matrix 107 rows 87 cols
[2024-05-31 21:05:00] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (230017 resets) in 1896 ms. (527 steps per ms)
BEST_FIRST walk for 1000001 steps (98162 resets) in 871 ms. (1146 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:05:03] [INFO ] Invariant cache hit.
[2024-05-31 21:05:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:05:03] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:05:03] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:05:03] [INFO ] [Real]Added 32 Read/Feed constraints in 5 ms returned sat
[2024-05-31 21:05:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:05:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:03] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 21:05:03] [INFO ] [Nat]Added 32 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:05:03] [INFO ] Computed and/alt/rep : 31/67/31 causal constraints (skipped 75 transitions) in 8 ms.
[2024-05-31 21:05:03] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-31 21:05:03] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 2 ms to minimize.
[2024-05-31 21:05:03] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 0 ms to minimize.
[2024-05-31 21:05:03] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
[2024-05-31 21:05:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 204 ms
[2024-05-31 21:05:03] [INFO ] Added : 14 causal constraints over 4 iterations in 255 ms. Result :sat
Minimization took 48 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 107/107 transitions.
Applied a total of 0 rules in 4 ms. Remains 87 /87 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 87/87 places, 107/107 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2024-05-31 21:05:03] [INFO ] Invariant cache hit.
[2024-05-31 21:05:04] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-05-31 21:05:04] [INFO ] Invariant cache hit.
[2024-05-31 21:05:04] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-31 21:05:04] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-31 21:05:04] [INFO ] Redundant transitions in 2 ms returned []
Running 106 sub problems to find dead transitions.
[2024-05-31 21:05:04] [INFO ] Invariant cache hit.
[2024-05-31 21:05:04] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/194 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (OVERLAPS) 0/194 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 121 constraints, problems are : Problem set: 0 solved, 106 unsolved in 1990 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 106 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 4 (OVERLAPS) 107/194 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/194 variables, 32/121 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/194 variables, 106/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 8 (OVERLAPS) 0/194 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 106 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 227 constraints, problems are : Problem set: 0 solved, 106 unsolved in 4227 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 106/106 constraints, Known Traps: 0/0 constraints]
After SMT, in 6323ms problems are : Problem set: 0 solved, 106 unsolved
Search for dead transitions found 0 dead transitions in 6326ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6549 ms. Remains : 87/87 places, 107/107 transitions.
RANDOM walk for 40000 steps (9120 resets) in 148 ms. (268 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4054 resets) in 62 ms. (634 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (4004 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Probably explored full state space saw : 742649 states, properties seen :1
Probabilistic random walk after 1897282 steps, saw 742649 distinct states, run finished after 2613 ms. (steps per millisecond=726 ) properties seen :1
Explored full state space saw : 745167 states, properties seen :0
Exhaustive walk after 1903331 steps, saw 745167 distinct states, run finished after 2383 ms. (steps per millisecond=798 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-05 in 15548 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-09
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 130 rows 98 cols
[2024-05-31 21:05:15] [INFO ] Computed 2 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2266 resets) in 23 ms. (416 steps per ms)
BEST_FIRST walk for 10000 steps (1003 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:05:15] [INFO ] Invariant cache hit.
[2024-05-31 21:05:15] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:05:15] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2024-05-31 21:05:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:05:15] [INFO ] [Real]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:05:15] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:05:15] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-31 21:05:15] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2024-05-31 21:05:15] [INFO ] [Nat]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:05:15] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 10 ms.
[2024-05-31 21:05:15] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 1 ms to minimize.
[2024-05-31 21:05:15] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-31 21:05:15] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2024-05-31 21:05:15] [INFO ] Added : 12 causal constraints over 4 iterations in 180 ms. Result :sat
Minimization took 78 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 128
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 128
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 94 transition count 126
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 94 transition count 126
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 92 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 92 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 92 transition count 119
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 90 transition count 117
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 90 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 88 transition count 115
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 88 transition count 115
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 24 place count 88 transition count 112
Applied a total of 24 rules in 12 ms. Remains 88 /98 variables (removed 10) and now considering 112/130 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 88/98 places, 112/130 transitions.
// Phase 1: matrix 112 rows 88 cols
[2024-05-31 21:05:16] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229982 resets) in 1882 ms. (531 steps per ms)
BEST_FIRST walk for 1000001 steps (98425 resets) in 880 ms. (1135 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:05:18] [INFO ] Invariant cache hit.
[2024-05-31 21:05:18] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:18] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-31 21:05:18] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:05:18] [INFO ] [Real]Added 36 Read/Feed constraints in 8 ms returned sat
[2024-05-31 21:05:18] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:05:18] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:18] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2024-05-31 21:05:19] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:05:19] [INFO ] Computed and/alt/rep : 31/66/31 causal constraints (skipped 80 transitions) in 6 ms.
[2024-05-31 21:05:19] [INFO ] Deduced a trap composed of 11 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:05:19] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
[2024-05-31 21:05:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 119 ms
[2024-05-31 21:05:19] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-05-31 21:05:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-31 21:05:19] [INFO ] Added : 15 causal constraints over 6 iterations in 250 ms. Result :sat
Minimization took 72 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 88/88 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 88 /88 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2024-05-31 21:05:19] [INFO ] Invariant cache hit.
[2024-05-31 21:05:19] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 21:05:19] [INFO ] Invariant cache hit.
[2024-05-31 21:05:19] [INFO ] State equation strengthened by 36 read => feed constraints.
[2024-05-31 21:05:19] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-31 21:05:19] [INFO ] Redundant transitions in 2 ms returned []
Running 111 sub problems to find dead transitions.
[2024-05-31 21:05:19] [INFO ] Invariant cache hit.
[2024-05-31 21:05:19] [INFO ] State equation strengthened by 36 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 126 constraints, problems are : Problem set: 0 solved, 111 unsolved in 2518 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 2 (OVERLAPS) 1/88 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 4 (OVERLAPS) 112/200 variables, 88/90 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 36/126 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 111/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
At refinement iteration 8 (OVERLAPS) 0/200 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 237 constraints, problems are : Problem set: 0 solved, 111 unsolved in 4526 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 88/88 constraints, ReadFeed: 36/36 constraints, PredecessorRefiner: 111/111 constraints, Known Traps: 0/0 constraints]
After SMT, in 7152ms problems are : Problem set: 0 solved, 111 unsolved
Search for dead transitions found 0 dead transitions in 7154ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7365 ms. Remains : 88/88 places, 112/112 transitions.
RANDOM walk for 40000 steps (9173 resets) in 143 ms. (277 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3876 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (4001 resets) in 56 ms. (701 steps per ms) remains 2/2 properties
Probably explored full state space saw : 818181 states, properties seen :1
Probabilistic random walk after 2196419 steps, saw 818181 distinct states, run finished after 2978 ms. (steps per millisecond=737 ) properties seen :1
Explored full state space saw : 821355 states, properties seen :0
Exhaustive walk after 2205019 steps, saw 821355 distinct states, run finished after 2585 ms. (steps per millisecond=853 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-09 in 16810 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-11
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[6]
// Phase 1: matrix 130 rows 98 cols
[2024-05-31 21:05:32] [INFO ] Computed 2 invariants in 0 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 10000 steps (2241 resets) in 21 ms. (454 steps per ms)
BEST_FIRST walk for 10000 steps (987 resets) in 10 ms. (909 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:05:32] [INFO ] Invariant cache hit.
[2024-05-31 21:05:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:32] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2024-05-31 21:05:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-31 21:05:32] [INFO ] [Real]Added 41 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:05:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:05:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:32] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2024-05-31 21:05:32] [INFO ] [Nat]Added 41 Read/Feed constraints in 6 ms returned sat
[2024-05-31 21:05:32] [INFO ] Computed and/alt/rep : 35/84/35 causal constraints (skipped 94 transitions) in 9 ms.
[2024-05-31 21:05:32] [INFO ] Added : 8 causal constraints over 3 iterations in 37 ms. Result :sat
Minimization took 80 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 130/130 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 96 transition count 124
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 96 transition count 124
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 94 transition count 122
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 94 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 92 transition count 119
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 92 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 92 transition count 118
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 15 place count 90 transition count 113
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 90 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 19 place count 88 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 21 place count 88 transition count 111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 22 place count 88 transition count 110
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 87 transition count 109
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 87 transition count 109
Applied a total of 24 rules in 13 ms. Remains 87 /98 variables (removed 11) and now considering 109/130 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 87/98 places, 109/130 transitions.
// Phase 1: matrix 109 rows 87 cols
[2024-05-31 21:05:32] [INFO ] Computed 2 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[6]
RANDOM walk for 1000000 steps (229725 resets) in 1869 ms. (534 steps per ms)
BEST_FIRST walk for 1000000 steps (98288 resets) in 920 ms. (1085 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[6]
[2024-05-31 21:05:35] [INFO ] Invariant cache hit.
[2024-05-31 21:05:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:35] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2024-05-31 21:05:35] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 21:05:35] [INFO ] [Real]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:05:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 21:05:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-31 21:05:35] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2024-05-31 21:05:35] [INFO ] [Nat]Added 31 Read/Feed constraints in 4 ms returned sat
[2024-05-31 21:05:35] [INFO ] Computed and/alt/rep : 31/73/31 causal constraints (skipped 77 transitions) in 6 ms.
[2024-05-31 21:05:35] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-31 21:05:35] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-31 21:05:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2024-05-31 21:05:35] [INFO ] Added : 8 causal constraints over 3 iterations in 142 ms. Result :sat
Minimization took 63 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[6]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[6]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 109/109 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 87/87 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 87/87 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 87 /87 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2024-05-31 21:05:35] [INFO ] Invariant cache hit.
[2024-05-31 21:05:35] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-31 21:05:35] [INFO ] Invariant cache hit.
[2024-05-31 21:05:36] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-31 21:05:36] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2024-05-31 21:05:36] [INFO ] Redundant transitions in 2 ms returned []
Running 108 sub problems to find dead transitions.
[2024-05-31 21:05:36] [INFO ] Invariant cache hit.
[2024-05-31 21:05:36] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (OVERLAPS) 0/196 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Real declared 196/196 variables, and 120 constraints, problems are : Problem set: 0 solved, 108 unsolved in 2066 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 108 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/86 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/86 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 2 (OVERLAPS) 1/87 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 4 (OVERLAPS) 109/196 variables, 87/89 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 31/120 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 108/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
At refinement iteration 8 (OVERLAPS) 0/196 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 108 unsolved
No progress, stopping.
After SMT solving in domain Int declared 196/196 variables, and 228 constraints, problems are : Problem set: 0 solved, 108 unsolved in 4055 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 87/87 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 108/108 constraints, Known Traps: 0/0 constraints]
After SMT, in 6226ms problems are : Problem set: 0 solved, 108 unsolved
Search for dead transitions found 0 dead transitions in 6227ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6428 ms. Remains : 87/87 places, 109/109 transitions.
RANDOM walk for 40000 steps (9205 resets) in 175 ms. (227 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3984 resets) in 79 ms. (500 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (3887 resets) in 52 ms. (754 steps per ms) remains 2/2 properties
Probably explored full state space saw : 809046 states, properties seen :1
Probabilistic random walk after 2090207 steps, saw 809046 distinct states, run finished after 2918 ms. (steps per millisecond=716 ) properties seen :1
Explored full state space saw : 812642 states, properties seen :0
Exhaustive walk after 2099778 steps, saw 812642 distinct states, run finished after 2763 ms. (steps per millisecond=759 ) properties seen :0
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[0] Max Struct:[6]
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-11 in 15750 ms.
[2024-05-31 21:05:48] [INFO ] Flatten gal took : 36 ms
[2024-05-31 21:05:48] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2024-05-31 21:05:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 98 places, 130 transitions and 513 arcs took 4 ms.
Total runtime 97190 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : DBSingleClientW-PT-d1m06-UpperBounds-05
Could not compute solution for formula : DBSingleClientW-PT-d1m06-UpperBounds-09
Could not compute solution for formula : DBSingleClientW-PT-d1m06-UpperBounds-11

BK_STOP 1717189548614

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
mcc2024
ub formula name DBSingleClientW-PT-d1m06-UpperBounds-05
ub formula formula --maxsum=/tmp/818/ub_0_
ub formula name DBSingleClientW-PT-d1m06-UpperBounds-09
ub formula formula --maxsum=/tmp/818/ub_1_
ub formula name DBSingleClientW-PT-d1m06-UpperBounds-11
ub formula formula --maxsum=/tmp/818/ub_2_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m06"
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 DBSingleClientW-PT-d1m06, 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 r480-tall-171624189400509"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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