About the Execution of LoLa+red for DBSingleClientW-PT-d1m07
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 558.884 | 31803.00 | 64422.00 | 558.50 | 0 0 0 0 0 4 1 1 0 0 1 0 0 0 0 0 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r103-tall-167814478100261.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is DBSingleClientW-PT-d1m07, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r103-tall-167814478100261
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 432K Mar 5 18:22 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-d1m07-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d1m07-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1678239800860
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m07
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:43:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 01:43:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:43:22] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-08 01:43:22] [INFO ] Transformed 1440 places.
[2023-03-08 01:43:22] [INFO ] Transformed 672 transitions.
[2023-03-08 01:43:22] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 155 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 1093 places in 5 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 672 rows 347 cols
[2023-03-08 01:43:22] [INFO ] Computed 6 place invariants in 48 ms
Incomplete random walk after 10000 steps, including 2271 resets, run finished after 116 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 982 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 959 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 965 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 946 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
[2023-03-08 01:43:22] [INFO ] Invariant cache hit.
[2023-03-08 01:43:23] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-08 01:43:23] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 14 ms returned sat
[2023-03-08 01:43:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:23] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2023-03-08 01:43:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:23] [INFO ] [Nat]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-08 01:43:23] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-08 01:43:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:23] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2023-03-08 01:43:23] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-08 01:43:23] [INFO ] [Nat]Added 418 Read/Feed constraints in 81 ms returned sat
[2023-03-08 01:43:24] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 120 ms.
[2023-03-08 01:43:24] [INFO ] Added : 7 causal constraints over 2 iterations in 293 ms. Result :sat
Minimization took 406 ms.
[2023-03-08 01:43:24] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:43:24] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:43:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:25] [INFO ] [Real]Absence check using state equation in 219 ms returned sat
[2023-03-08 01:43:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:43:25] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:43:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:25] [INFO ] [Nat]Absence check using state equation in 158 ms returned sat
[2023-03-08 01:43:25] [INFO ] [Nat]Added 418 Read/Feed constraints in 87 ms returned sat
[2023-03-08 01:43:25] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 85 ms.
[2023-03-08 01:43:25] [INFO ] Deduced a trap composed of 26 places in 192 ms of which 16 ms to minimize.
[2023-03-08 01:43:26] [INFO ] Deduced a trap composed of 91 places in 130 ms of which 1 ms to minimize.
[2023-03-08 01:43:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 484 ms
[2023-03-08 01:43:26] [INFO ] Added : 20 causal constraints over 5 iterations in 926 ms. Result :sat
Minimization took 123 ms.
[2023-03-08 01:43:26] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:43:26] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 01:43:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:26] [INFO ] [Real]Absence check using state equation in 142 ms returned sat
[2023-03-08 01:43:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:43:26] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:43:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:26] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2023-03-08 01:43:26] [INFO ] [Nat]Added 418 Read/Feed constraints in 83 ms returned sat
[2023-03-08 01:43:27] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 62 ms.
[2023-03-08 01:43:27] [INFO ] Added : 12 causal constraints over 3 iterations in 235 ms. Result :sat
Minimization took 95 ms.
[2023-03-08 01:43:27] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:43:27] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:43:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:27] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-08 01:43:27] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:43:27] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-08 01:43:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:27] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2023-03-08 01:43:27] [INFO ] [Nat]Added 418 Read/Feed constraints in 57 ms returned sat
[2023-03-08 01:43:27] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 54 ms.
[2023-03-08 01:43:27] [INFO ] Added : 2 causal constraints over 1 iterations in 135 ms. Result :sat
Minimization took 77 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7, 7] Max seen :[0, 0, 0, 0]
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 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 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 183 place count 231 transition count 329
Iterating global reduction 1 with 94 rules applied. Total rules applied 277 place count 231 transition count 329
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 281 place count 231 transition count 325
Discarding 71 places :
Symmetric choice reduction at 2 with 71 rule applications. Total rules 352 place count 160 transition count 254
Iterating global reduction 2 with 71 rules applied. Total rules applied 423 place count 160 transition count 254
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 429 place count 160 transition count 248
Discarding 39 places :
Symmetric choice reduction at 3 with 39 rule applications. Total rules 468 place count 121 transition count 188
Iterating global reduction 3 with 39 rules applied. Total rules applied 507 place count 121 transition count 188
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 3 with 21 rules applied. Total rules applied 528 place count 121 transition count 167
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 539 place count 110 transition count 149
Iterating global reduction 4 with 11 rules applied. Total rules applied 550 place count 110 transition count 149
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 552 place count 110 transition count 147
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 559 place count 103 transition count 140
Iterating global reduction 5 with 7 rules applied. Total rules applied 566 place count 103 transition count 140
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 567 place count 103 transition count 139
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 573 place count 97 transition count 133
Iterating global reduction 6 with 6 rules applied. Total rules applied 579 place count 97 transition count 133
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 581 place count 97 transition count 131
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 582 place count 96 transition count 129
Iterating global reduction 7 with 1 rules applied. Total rules applied 583 place count 96 transition count 129
Applied a total of 583 rules in 82 ms. Remains 96 /347 variables (removed 251) and now considering 129/672 (removed 543) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 96/347 places, 129/672 transitions.
// Phase 1: matrix 129 rows 96 cols
[2023-03-08 01:43:28] [INFO ] Computed 2 place invariants in 4 ms
Incomplete random walk after 1000000 steps, including 229325 resets, run finished after 1006 ms. (steps per millisecond=994 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000000 steps, including 98284 resets, run finished after 523 ms. (steps per millisecond=1912 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 98461 resets, run finished after 482 ms. (steps per millisecond=2074 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 98830 resets, run finished after 449 ms. (steps per millisecond=2227 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 1000001 steps, including 97671 resets, run finished after 481 ms. (steps per millisecond=2079 ) properties (out of 4) seen :1
[2023-03-08 01:43:31] [INFO ] Invariant cache hit.
[2023-03-08 01:43:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:31] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:43:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:31] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:43:31] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-08 01:43:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 23 ms returned sat
[2023-03-08 01:43:31] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 93 transitions) in 10 ms.
[2023-03-08 01:43:31] [INFO ] Deduced a trap composed of 14 places in 237 ms of which 1 ms to minimize.
[2023-03-08 01:43:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 245 ms
[2023-03-08 01:43:31] [INFO ] Added : 6 causal constraints over 2 iterations in 293 ms. Result :sat
Minimization took 39 ms.
[2023-03-08 01:43:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:31] [INFO ] [Real]Absence check using state equation in 39 ms returned sat
[2023-03-08 01:43:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:31] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 01:43:31] [INFO ] [Nat]Added 41 Read/Feed constraints in 11 ms returned sat
[2023-03-08 01:43:31] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 93 transitions) in 13 ms.
[2023-03-08 01:43:31] [INFO ] Added : 14 causal constraints over 3 iterations in 59 ms. Result :sat
Minimization took 19 ms.
[2023-03-08 01:43:31] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:31] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2023-03-08 01:43:31] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:32] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:32] [INFO ] [Nat]Absence check using state equation in 44 ms returned sat
[2023-03-08 01:43:32] [INFO ] [Nat]Added 41 Read/Feed constraints in 13 ms returned sat
[2023-03-08 01:43:32] [INFO ] Computed and/alt/rep : 35/85/35 causal constraints (skipped 93 transitions) in 7 ms.
[2023-03-08 01:43:32] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 19 ms.
[2023-03-08 01:43:32] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:32] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 7, 7, 1] Max seen :[0, 0, 0, 1]
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 3 out of 96 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 96/96 places, 129/129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 95 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 95 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 94 transition count 126
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 94 transition count 126
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 94 transition count 125
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 93 transition count 124
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 92 transition count 123
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 92 transition count 123
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 92 transition count 122
Applied a total of 10 rules in 15 ms. Remains 92 /96 variables (removed 4) and now considering 122/129 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 92/96 places, 122/129 transitions.
// Phase 1: matrix 122 rows 92 cols
[2023-03-08 01:43:32] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229709 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98681 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98405 resets, run finished after 429 ms. (steps per millisecond=2331 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98100 resets, run finished after 422 ms. (steps per millisecond=2369 ) properties (out of 3) seen :0
[2023-03-08 01:43:34] [INFO ] Invariant cache hit.
[2023-03-08 01:43:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 01:43:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:34] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:34] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:43:34] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:43:34] [INFO ] [Nat]Added 39 Read/Feed constraints in 6 ms returned sat
[2023-03-08 01:43:34] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 7 ms.
[2023-03-08 01:43:34] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 4 ms to minimize.
[2023-03-08 01:43:34] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2023-03-08 01:43:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 152 ms
[2023-03-08 01:43:34] [INFO ] Added : 16 causal constraints over 4 iterations in 211 ms. Result :sat
Minimization took 52 ms.
[2023-03-08 01:43:34] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:34] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 01:43:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:35] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-08 01:43:35] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2023-03-08 01:43:35] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 8 ms.
[2023-03-08 01:43:35] [INFO ] Added : 10 causal constraints over 3 iterations in 74 ms. Result :sat
Minimization took 15 ms.
[2023-03-08 01:43:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:35] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-08 01:43:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:35] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2023-03-08 01:43:35] [INFO ] [Nat]Added 39 Read/Feed constraints in 7 ms returned sat
[2023-03-08 01:43:35] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 7 ms.
[2023-03-08 01:43:35] [INFO ] Added : 9 causal constraints over 2 iterations in 28 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [7, 7, 7] Max seen :[0, 0, 0]
Support contains 3 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 122/122 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 92/92 places, 122/122 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Applied a total of 0 rules in 6 ms. Remains 92 /92 variables (removed 0) and now considering 122/122 (removed 0) transitions.
[2023-03-08 01:43:35] [INFO ] Invariant cache hit.
[2023-03-08 01:43:35] [INFO ] Implicit Places using invariants in 59 ms returned []
[2023-03-08 01:43:35] [INFO ] Invariant cache hit.
[2023-03-08 01:43:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:43:35] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 191 ms to find 0 implicit places.
[2023-03-08 01:43:35] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 01:43:35] [INFO ] Invariant cache hit.
[2023-03-08 01:43:35] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 266 ms. Remains : 92/92 places, 122/122 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-05
[2023-03-08 01:43:35] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2267 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 955 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-08 01:43:35] [INFO ] Invariant cache hit.
[2023-03-08 01:43:35] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-08 01:43:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:35] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:43:35] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:35] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:35] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-08 01:43:35] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:43:35] [INFO ] [Nat]Added 39 Read/Feed constraints in 6 ms returned sat
[2023-03-08 01:43:35] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 7 ms.
[2023-03-08 01:43:36] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2023-03-08 01:43:36] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 0 ms to minimize.
[2023-03-08 01:43:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 125 ms
[2023-03-08 01:43:36] [INFO ] Added : 16 causal constraints over 4 iterations in 193 ms. Result :sat
Minimization took 50 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 117
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 10 place count 88 transition count 115
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 87 transition count 109
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 87 transition count 109
Applied a total of 12 rules in 27 ms. Remains 87 /92 variables (removed 5) and now considering 109/122 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 87/92 places, 109/122 transitions.
// Phase 1: matrix 109 rows 87 cols
[2023-03-08 01:43:36] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229201 resets, run finished after 867 ms. (steps per millisecond=1153 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98001 resets, run finished after 409 ms. (steps per millisecond=2444 ) properties (out of 1) seen :0
[2023-03-08 01:43:37] [INFO ] Invariant cache hit.
[2023-03-08 01:43:37] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:37] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:43:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:37] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:37] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:43:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 01:43:37] [INFO ] [Nat]Added 31 Read/Feed constraints in 5 ms returned sat
[2023-03-08 01:43:37] [INFO ] Computed and/alt/rep : 31/72/31 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-08 01:43:37] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2023-03-08 01:43:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2023-03-08 01:43:37] [INFO ] Added : 14 causal constraints over 4 iterations in 121 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
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 4 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 5 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 4 ms. Remains 87 /87 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 01:43:37] [INFO ] Invariant cache hit.
[2023-03-08 01:43:38] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-08 01:43:38] [INFO ] Invariant cache hit.
[2023-03-08 01:43:38] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 01:43:38] [INFO ] Implicit Places using invariants and state equation in 184 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-08 01:43:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:43:38] [INFO ] Invariant cache hit.
[2023-03-08 01:43:38] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 707 ms. Remains : 87/87 places, 109/109 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-05 in 2910 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-06
// Phase 1: matrix 122 rows 92 cols
[2023-03-08 01:43:38] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2250 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1045 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-08 01:43:38] [INFO ] Invariant cache hit.
[2023-03-08 01:43:38] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:38] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 01:43:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:38] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:38] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 01:43:38] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:43:38] [INFO ] [Nat]Added 39 Read/Feed constraints in 22 ms returned sat
[2023-03-08 01:43:38] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 6 ms.
[2023-03-08 01:43:38] [INFO ] Added : 10 causal constraints over 3 iterations in 34 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 118
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 88 transition count 117
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 113
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 111
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 85 transition count 109
Applied a total of 17 rules in 28 ms. Remains 85 /92 variables (removed 7) and now considering 109/122 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 85/92 places, 109/122 transitions.
// Phase 1: matrix 109 rows 85 cols
[2023-03-08 01:43:38] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229831 resets, run finished after 805 ms. (steps per millisecond=1242 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98150 resets, run finished after 401 ms. (steps per millisecond=2493 ) properties (out of 1) seen :0
[2023-03-08 01:43:40] [INFO ] Invariant cache hit.
[2023-03-08 01:43:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:40] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 01:43:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 6 ms returned sat
[2023-03-08 01:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:40] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:43:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:40] [INFO ] [Nat]Added 36 Read/Feed constraints in 12 ms returned sat
[2023-03-08 01:43:40] [INFO ] Computed and/alt/rep : 30/65/30 causal constraints (skipped 78 transitions) in 9 ms.
[2023-03-08 01:43:40] [INFO ] Added : 19 causal constraints over 5 iterations in 50 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 4 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 85/85 places, 109/109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 109/109 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 109/109 (removed 0) transitions.
[2023-03-08 01:43:40] [INFO ] Invariant cache hit.
[2023-03-08 01:43:40] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-08 01:43:40] [INFO ] Invariant cache hit.
[2023-03-08 01:43:40] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
[2023-03-08 01:43:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 01:43:40] [INFO ] Invariant cache hit.
[2023-03-08 01:43:40] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 361 ms. Remains : 85/85 places, 109/109 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-06 in 2104 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-07
// Phase 1: matrix 122 rows 92 cols
[2023-03-08 01:43:40] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 10000 steps, including 2322 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 917 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
[2023-03-08 01:43:40] [INFO ] Invariant cache hit.
[2023-03-08 01:43:40] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:43:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:40] [INFO ] [Real]Absence check using state equation in 29 ms returned sat
[2023-03-08 01:43:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:40] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:40] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2023-03-08 01:43:40] [INFO ] State equation strengthened by 39 read => feed constraints.
[2023-03-08 01:43:40] [INFO ] [Nat]Added 39 Read/Feed constraints in 14 ms returned sat
[2023-03-08 01:43:40] [INFO ] Computed and/alt/rep : 33/79/33 causal constraints (skipped 88 transitions) in 7 ms.
[2023-03-08 01:43:40] [INFO ] Added : 9 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 18 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 92 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 92/92 places, 122/122 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 90 transition count 120
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 120
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 88 transition count 117
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 88 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 88 transition count 116
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 85 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 85 transition count 110
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 85 transition count 108
Applied a total of 17 rules in 12 ms. Remains 85 /92 variables (removed 7) and now considering 108/122 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 85/92 places, 108/122 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-08 01:43:40] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229544 resets, run finished after 769 ms. (steps per millisecond=1300 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98673 resets, run finished after 381 ms. (steps per millisecond=2624 ) properties (out of 1) seen :0
[2023-03-08 01:43:42] [INFO ] Invariant cache hit.
[2023-03-08 01:43:42] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:42] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2023-03-08 01:43:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:43:42] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:43:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:43:42] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-08 01:43:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:42] [INFO ] [Nat]Added 36 Read/Feed constraints in 7 ms returned sat
[2023-03-08 01:43:42] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-08 01:43:42] [INFO ] Added : 9 causal constraints over 2 iterations in 25 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 85/85 places, 108/108 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Applied a total of 0 rules in 3 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 01:43:42] [INFO ] Invariant cache hit.
[2023-03-08 01:43:42] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 01:43:42] [INFO ] Invariant cache hit.
[2023-03-08 01:43:42] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:43:42] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 01:43:42] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:43:42] [INFO ] Invariant cache hit.
[2023-03-08 01:43:42] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 244 ms. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m07-UpperBounds-07 in 1872 ms.
[2023-03-08 01:43:42] [INFO ] Flatten gal took : 33 ms
[2023-03-08 01:43:42] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 01:43:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 122 transitions and 481 arcs took 1 ms.
Total runtime 20460 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d1m07
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
Upper Bounds
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA DBSingleClientW-PT-d1m07-UpperBounds-05 4 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678239832663
--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 11 (type EXCL) for 0 DBSingleClientW-PT-d1m07-UpperBounds-05
lola: time limit : 1200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 9 (type FNDP) for 0 DBSingleClientW-PT-d1m07-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 DBSingleClientW-PT-d1m07-UpperBounds-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 12 (type FNDP) for 3 DBSingleClientW-PT-d1m07-UpperBounds-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 7
sara: try reading problem file /home/mcc/execution/374/UpperBounds-10.sara.
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 2)
lola: REPORT NUM
lola: FINISHED task # 12 (type FNDP) for DBSingleClientW-PT-d1m07-UpperBounds-06
lola: fired transitions : 94067
lola: tried executions : 7502
lola: time used : 0.000000
lola: LAUNCH task # 15 (type FNDP) for 6 DBSingleClientW-PT-d1m07-UpperBounds-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: REPORT NUM
lola: FINISHED task # 15 (type FNDP) for DBSingleClientW-PT-d1m07-UpperBounds-07
lola: fired transitions : 26620
lola: tried executions : 2016
lola: time used : 0.000000
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m07-UpperBounds-06: BOUND 1 findpath
DBSingleClientW-PT-d1m07-UpperBounds-07: BOUND 1 findpath
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
DBSingleClientW-PT-d1m07-UpperBounds-05: BOUND 0 0 3 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
9 BOUND FNDP 5/3600 0/5 DBSingleClientW-PT-d1m07-UpperBounds-05 2656720 t fired, 223157 attempts, .
10 BOUND STEQ 5/3600 0/5 DBSingleClientW-PT-d1m07-UpperBounds-05 --
11 BOUND EXCL 5/3600 6/32 DBSingleClientW-PT-d1m07-UpperBounds-05 1574312 m, 314862 m/sec, 2486715 t fired, result in [4,7] .
Time elapsed: 5 secs. Pages in use: 6
# running tasks: 3 of 4 Visible: 3
lola: REPORT NUM
lola: FINISHED task # 11 (type EXCL) for DBSingleClientW-PT-d1m07-UpperBounds-05
lola: markings : 2631855
lola: fired transitions : 4306070
lola: time used : 8.000000
lola: memory pages used : 10
lola: CANCELED task # 9 (type FNDP) for DBSingleClientW-PT-d1m07-UpperBounds-05 (obsolete)
lola: CANCELED task # 10 (type EQUN) for DBSingleClientW-PT-d1m07-UpperBounds-05 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m07-UpperBounds-05: BOUND 4 state space
DBSingleClientW-PT-d1m07-UpperBounds-06: BOUND 1 findpath
DBSingleClientW-PT-d1m07-UpperBounds-07: BOUND 1 findpath
Time elapsed: 8 secs. Pages in use: 10
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-d1m07"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is DBSingleClientW-PT-d1m07, 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 r103-tall-167814478100261"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d1m07.tgz
mv DBSingleClientW-PT-d1m07 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 '
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 ;