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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 864K
-rw-r--r-- 1 mcc users 8.8K Feb 26 15:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 15:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 49K Feb 26 15:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 15:26 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-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 1678239172916

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-d1m06
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 01:32:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-08 01:32:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 01:32:54] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-08 01:32:54] [INFO ] Transformed 1440 places.
[2023-03-08 01:32:54] [INFO ] Transformed 672 transitions.
[2023-03-08 01:32:54] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
Deduced a syphon composed of 1093 places in 5 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-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-11 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
// Phase 1: matrix 672 rows 347 cols
[2023-03-08 01:32:54] [INFO ] Computed 6 place invariants in 44 ms
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1009 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 993 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 952 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :1
[2023-03-08 01:32:55] [INFO ] Invariant cache hit.
[2023-03-08 01:32:55] [INFO ] [Real]Absence check using 2 positive place invariants in 9 ms returned sat
[2023-03-08 01:32:55] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 8 ms returned sat
[2023-03-08 01:32:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:32:55] [INFO ] [Real]Absence check using state equation in 145 ms returned sat
[2023-03-08 01:32:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:32:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-08 01:32:55] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-08 01:32:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:32:55] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2023-03-08 01:32:55] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-08 01:32:55] [INFO ] [Nat]Added 418 Read/Feed constraints in 62 ms returned sat
[2023-03-08 01:32:55] [INFO ] Deduced a trap composed of 108 places in 133 ms of which 4 ms to minimize.
[2023-03-08 01:32:56] [INFO ] Deduced a trap composed of 95 places in 142 ms of which 1 ms to minimize.
[2023-03-08 01:32:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 359 ms
[2023-03-08 01:32:56] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 124 ms.
[2023-03-08 01:32:56] [INFO ] Added : 4 causal constraints over 1 iterations in 219 ms. Result :sat
Minimization took 86 ms.
[2023-03-08 01:32:56] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:32:56] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 01:32:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:32:56] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2023-03-08 01:32:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:32:56] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:32:56] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 01:32:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:32:56] [INFO ] [Nat]Absence check using state equation in 110 ms returned sat
[2023-03-08 01:32:56] [INFO ] [Nat]Added 418 Read/Feed constraints in 84 ms returned sat
[2023-03-08 01:32:56] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 60 ms.
[2023-03-08 01:32:57] [INFO ] Added : 11 causal constraints over 3 iterations in 312 ms. Result :sat
Minimization took 95 ms.
[2023-03-08 01:32:57] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:32:57] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-08 01:32:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:32:57] [INFO ] [Real]Absence check using state equation in 112 ms returned sat
[2023-03-08 01:32:57] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:32:57] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:32:57] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 9 ms returned sat
[2023-03-08 01:32:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:32:57] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-08 01:32:57] [INFO ] [Nat]Added 418 Read/Feed constraints in 56 ms returned sat
[2023-03-08 01:32:57] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 56 ms.
[2023-03-08 01:32:57] [INFO ] Added : 2 causal constraints over 1 iterations in 145 ms. Result :sat
Minimization took 65 ms.
[2023-03-08 01:32:58] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-08 01:32:58] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 12 ms returned sat
[2023-03-08 01:32:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:32:58] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2023-03-08 01:32:58] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:32:58] [INFO ] [Nat]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-08 01:32:58] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-08 01:32:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:32:58] [INFO ] [Nat]Absence check using state equation in 114 ms returned sat
[2023-03-08 01:32:58] [INFO ] [Nat]Added 418 Read/Feed constraints in 55 ms returned sat
[2023-03-08 01:32:58] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 61 ms.
[2023-03-08 01:32:58] [INFO ] Added : 2 causal constraints over 1 iterations in 139 ms. Result :sat
Minimization took 92 ms.
Current structural bounds on expressions (after SMT) : [1257, 7, 6, 8] Max seen :[0, 0, 0, 1]
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 326 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.2 ms
Discarding 21 places :
Also discarding 0 output transitions
Drop transitions removed 8 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 87 transitions.
Iterating post reduction 0 with 87 rules applied. Total rules applied 88 place count 326 transition count 585
Discarding 96 places :
Symmetric choice reduction at 1 with 96 rule applications. Total rules 184 place count 230 transition count 328
Iterating global reduction 1 with 96 rules applied. Total rules applied 280 place count 230 transition count 328
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 284 place count 230 transition count 324
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 356 place count 158 transition count 252
Iterating global reduction 2 with 72 rules applied. Total rules applied 428 place count 158 transition count 252
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 434 place count 158 transition count 246
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 476 place count 116 transition count 178
Iterating global reduction 3 with 42 rules applied. Total rules applied 518 place count 116 transition count 178
Ensure Unique test removed 23 transitions
Reduce isomorphic transitions removed 23 transitions.
Iterating post reduction 3 with 23 rules applied. Total rules applied 541 place count 116 transition count 155
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 552 place count 105 transition count 138
Iterating global reduction 4 with 11 rules applied. Total rules applied 563 place count 105 transition count 138
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 565 place count 105 transition count 136
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 573 place count 97 transition count 128
Iterating global reduction 5 with 8 rules applied. Total rules applied 581 place count 97 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 584 place count 97 transition count 125
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 590 place count 91 transition count 119
Iterating global reduction 6 with 6 rules applied. Total rules applied 596 place count 91 transition count 119
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 597 place count 91 transition count 118
Applied a total of 597 rules in 83 ms. Remains 91 /347 variables (removed 256) and now considering 118/672 (removed 554) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 91/347 places, 118/672 transitions.
// Phase 1: matrix 118 rows 91 cols
[2023-03-08 01:32:58] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229667 resets, run finished after 950 ms. (steps per millisecond=1052 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000000 steps, including 98020 resets, run finished after 466 ms. (steps per millisecond=2145 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000001 steps, including 98153 resets, run finished after 408 ms. (steps per millisecond=2450 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98338 resets, run finished after 406 ms. (steps per millisecond=2463 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 98219 resets, run finished after 423 ms. (steps per millisecond=2364 ) properties (out of 4) seen :4
[2023-03-08 01:33:01] [INFO ] Invariant cache hit.
[2023-03-08 01:33:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:01] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2023-03-08 01:33:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:01] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 01:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-08 01:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:01] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:33:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-08 01:33:01] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-08 01:33:01] [INFO ] Computed and/alt/rep : 32/72/32 causal constraints (skipped 85 transitions) in 6 ms.
[2023-03-08 01:33:01] [INFO ] Added : 10 causal constraints over 3 iterations in 38 ms. Result :sat
Minimization took 23 ms.
[2023-03-08 01:33:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:01] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2023-03-08 01:33:01] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:01] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-08 01:33:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:01] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:01] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:33:01] [INFO ] [Nat]Added 40 Read/Feed constraints in 4 ms returned sat
[2023-03-08 01:33:01] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2023-03-08 01:33:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 44 ms
[2023-03-08 01:33:01] [INFO ] Computed and/alt/rep : 32/72/32 causal constraints (skipped 85 transitions) in 5 ms.
[2023-03-08 01:33:01] [INFO ] Added : 2 causal constraints over 1 iterations in 19 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [1, 7, 1, 8] Max seen :[1, 0, 1, 2]
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 118/118 transitions.
Graph (complete) has 284 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 90 transition count 117
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 88 transition count 114
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 88 transition count 114
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 87 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 87 transition count 112
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 86 transition count 111
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 86 transition count 111
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 85 transition count 110
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 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 14 place count 85 transition count 108
Applied a total of 14 rules in 28 ms. Remains 85 /91 variables (removed 6) and now considering 108/118 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 85/91 places, 108/118 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-08 01:33:02] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229734 resets, run finished after 776 ms. (steps per millisecond=1288 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98469 resets, run finished after 396 ms. (steps per millisecond=2525 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98533 resets, run finished after 391 ms. (steps per millisecond=2557 ) properties (out of 2) seen :2
[2023-03-08 01:33:03] [INFO ] Invariant cache hit.
[2023-03-08 01:33:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:03] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-08 01:33:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:03] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:33:03] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:33:03] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-08 01:33:03] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-08 01:33:03] [INFO ] Added : 13 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 22 ms.
[2023-03-08 01:33:03] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:03] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-08 01:33:03] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:03] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 5 ms returned sat
[2023-03-08 01:33:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:03] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:33:03] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-08 01:33:03] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-08 01:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-08 01:33:03] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-08 01:33:04] [INFO ] Added : 13 causal constraints over 4 iterations in 51 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : [7, 8] Max seen :[0, 2]
Support contains 2 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 5 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 6 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 4 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 01:33:04] [INFO ] Invariant cache hit.
[2023-03-08 01:33:04] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 01:33:04] [INFO ] Invariant cache hit.
[2023-03-08 01:33:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:33:04] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
[2023-03-08 01:33:04] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:33:04] [INFO ] Invariant cache hit.
[2023-03-08 01:33:04] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 85/85 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06
[2023-03-08 01:33:04] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2322 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 960 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-08 01:33:04] [INFO ] Invariant cache hit.
[2023-03-08 01:33:04] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:04] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:33:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:04] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:04] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:33:04] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:33:04] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-08 01:33:04] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-08 01:33:04] [INFO ] Added : 13 causal constraints over 3 iterations in 36 ms. Result :sat
Minimization took 20 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 5 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 5 ms. Remains : 85/85 places, 108/108 transitions.
[2023-03-08 01:33:04] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229895 resets, run finished after 751 ms. (steps per millisecond=1331 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98397 resets, run finished after 379 ms. (steps per millisecond=2638 ) properties (out of 1) seen :0
[2023-03-08 01:33:05] [INFO ] Invariant cache hit.
[2023-03-08 01:33:05] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:05] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-08 01:33:05] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:05] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:05] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 01:33:05] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:33:05] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-08 01:33:05] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-08 01:33:05] [INFO ] Added : 13 causal constraints over 3 iterations in 39 ms. Result :sat
Minimization took 23 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 10 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 10 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 6 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-08 01:33:05] [INFO ] Invariant cache hit.
[2023-03-08 01:33:05] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-08 01:33:06] [INFO ] Invariant cache hit.
[2023-03-08 01:33:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:33:06] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 01:33:06] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 01:33:06] [INFO ] Invariant cache hit.
[2023-03-08 01:33:06] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 240 ms. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06 in 1817 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14
[2023-03-08 01:33:06] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2328 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :1
Incomplete Best-First random walk after 10001 steps, including 987 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-03-08 01:33:06] [INFO ] Invariant cache hit.
[2023-03-08 01:33:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:06] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-08 01:33:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-08 01:33:06] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-08 01:33:06] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-08 01:33:06] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-08 01:33:06] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 20 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[1]
Support contains 1 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 108/108 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 84 transition count 107
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 107
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 83 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 83 transition count 106
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 83 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 82 transition count 99
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 82 transition count 99
Applied a total of 7 rules in 9 ms. Remains 82 /85 variables (removed 3) and now considering 99/108 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 82/85 places, 99/108 transitions.
// Phase 1: matrix 99 rows 82 cols
[2023-03-08 01:33:06] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 230025 resets, run finished after 706 ms. (steps per millisecond=1416 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98472 resets, run finished after 352 ms. (steps per millisecond=2840 ) properties (out of 1) seen :2
[2023-03-08 01:33:07] [INFO ] Invariant cache hit.
[2023-03-08 01:33:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:07] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-08 01:33:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:07] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-08 01:33:07] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:33:07] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2023-03-08 01:33:07] [INFO ] Deduced a trap composed of 10 places in 45 ms of which 1 ms to minimize.
[2023-03-08 01:33:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2023-03-08 01:33:07] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 6 ms.
[2023-03-08 01:33:07] [INFO ] Added : 2 causal constraints over 1 iterations in 21 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-08 01:33:07] [INFO ] Invariant cache hit.
[2023-03-08 01:33:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-08 01:33:07] [INFO ] Invariant cache hit.
[2023-03-08 01:33:07] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:33:07] [INFO ] Implicit Places using invariants and state equation in 108 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2023-03-08 01:33:07] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:33:07] [INFO ] Invariant cache hit.
[2023-03-08 01:33:07] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 222 ms. Remains : 82/82 places, 99/99 transitions.
[2023-03-08 01:33:07] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229856 resets, run finished after 714 ms. (steps per millisecond=1400 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98424 resets, run finished after 353 ms. (steps per millisecond=2832 ) properties (out of 1) seen :2
[2023-03-08 01:33:08] [INFO ] Invariant cache hit.
[2023-03-08 01:33:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-08 01:33:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:33:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 01:33:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-08 01:33:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 01:33:09] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-08 01:33:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:33:09] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2023-03-08 01:33:09] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 2 ms to minimize.
[2023-03-08 01:33:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-08 01:33:09] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 9 ms.
[2023-03-08 01:33:09] [INFO ] Added : 2 causal constraints over 1 iterations in 29 ms. Result :sat
Minimization took 15 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[2]
Support contains 1 out of 82 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 82/82 places, 99/99 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 82/82 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 82 /82 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2023-03-08 01:33:09] [INFO ] Invariant cache hit.
[2023-03-08 01:33:09] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 01:33:09] [INFO ] Invariant cache hit.
[2023-03-08 01:33:09] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-08 01:33:09] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-08 01:33:09] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 01:33:09] [INFO ] Invariant cache hit.
[2023-03-08 01:33:09] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14 in 3176 ms.
[2023-03-08 01:33:09] [INFO ] Flatten gal took : 34 ms
[2023-03-08 01:33:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-08 01:33:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 108 transitions and 425 arcs took 1 ms.
Total runtime 15223 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT DBSingleClientW-PT-d1m06
BK_EXAMINATION: UpperBounds
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
Upper Bounds

FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING TOPOLOGICAL EXPLICIT STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678239191159

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/UpperBounds.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: LAUNCH task # 8 (type EXCL) for 3 DBSingleClientW-PT-d1m06-UpperBounds-14
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 DBSingleClientW-PT-d1m06-UpperBounds-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 DBSingleClientW-PT-d1m06-UpperBounds-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type FNDP) for 0 DBSingleClientW-PT-d1m06-UpperBounds-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 3
sara: try reading problem file /home/mcc/execution/376/UpperBounds-7.sara.
sara: place or transition ordering is non-deterministic
lola: REPORT NUM
lola: FINISHED task # 8 (type EXCL) for DBSingleClientW-PT-d1m06-UpperBounds-14
lola: markings : 214887
lola: fired transitions : 303202
lola: time used : 1.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for DBSingleClientW-PT-d1m06-UpperBounds-14 (obsolete)
lola: CANCELED task # 7 (type EQUN) for DBSingleClientW-PT-d1m06-UpperBounds-14 (obsolete)
lola: LAUNCH task # 11 (type EXCL) for 0 DBSingleClientW-PT-d1m06-UpperBounds-06
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type EQUN) for 0 DBSingleClientW-PT-d1m06-UpperBounds-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: Structural Bound: 1
lola: REPORT NUM
lola: FINISHED task # 11 (type EXCL) for DBSingleClientW-PT-d1m06-UpperBounds-06
lola: markings : 1067
lola: fired transitions : 1265
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 9 (type FNDP) for DBSingleClientW-PT-d1m06-UpperBounds-06 (obsolete)
lola: CANCELED task # 10 (type EQUN) for DBSingleClientW-PT-d1m06-UpperBounds-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
DBSingleClientW-PT-d1m06-UpperBounds-06: BOUND 1 state space
DBSingleClientW-PT-d1m06-UpperBounds-14: BOUND 2 state space


Time elapsed: 1 secs. Pages in use: 1

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="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-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 r103-tall-167814478100253"
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 ;