fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r107-tall-167814484000253
Last Updated
May 14, 2023

About the Execution of Smart+red for DBSingleClientW-PT-d1m06

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
349.191 25395.00 39915.00 320.20 0 0 1 0 0 0 1 0 1 0 0 0 0 0 2 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.r107-tall-167814484000253.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 smartxred
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 r107-tall-167814484000253
=====================================================================

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

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=smartxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-09 08:04:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 08:04:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:04:41] [INFO ] Load time of PNML (sax parser for PT used): 85 ms
[2023-03-09 08:04:41] [INFO ] Transformed 1440 places.
[2023-03-09 08:04:41] [INFO ] Transformed 672 transitions.
[2023-03-09 08:04:41] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 151 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-09 08:04:41] [INFO ] Computed 6 place invariants in 42 ms
Incomplete random walk after 10000 steps, including 2255 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 954 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 947 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 988 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 940 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :1
[2023-03-09 08:04:42] [INFO ] Invariant cache hit.
[2023-03-09 08:04:42] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-09 08:04:42] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 11 ms returned sat
[2023-03-09 08:04:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:42] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-09 08:04:42] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:42] [INFO ] [Nat]Absence check using 2 positive place invariants in 7 ms returned sat
[2023-03-09 08:04:42] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 08:04:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:42] [INFO ] [Nat]Absence check using state equation in 135 ms returned sat
[2023-03-09 08:04:42] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-09 08:04:42] [INFO ] [Nat]Added 418 Read/Feed constraints in 68 ms returned sat
[2023-03-09 08:04:43] [INFO ] Deduced a trap composed of 108 places in 164 ms of which 3 ms to minimize.
[2023-03-09 08:04:43] [INFO ] Deduced a trap composed of 95 places in 256 ms of which 1 ms to minimize.
[2023-03-09 08:04:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 521 ms
[2023-03-09 08:04:43] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 154 ms.
[2023-03-09 08:04:43] [INFO ] Added : 4 causal constraints over 1 iterations in 274 ms. Result :sat
Minimization took 179 ms.
[2023-03-09 08:04:43] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 08:04:43] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 08:04:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:44] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2023-03-09 08:04:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 08:04:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 08:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:44] [INFO ] [Nat]Absence check using state equation in 112 ms returned sat
[2023-03-09 08:04:44] [INFO ] [Nat]Added 418 Read/Feed constraints in 74 ms returned sat
[2023-03-09 08:04:44] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 78 ms.
[2023-03-09 08:04:44] [INFO ] Added : 11 causal constraints over 3 iterations in 275 ms. Result :sat
Minimization took 98 ms.
[2023-03-09 08:04:44] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 08:04:44] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 08:04:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:44] [INFO ] [Real]Absence check using state equation in 147 ms returned sat
[2023-03-09 08:04:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:44] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 08:04:44] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-09 08:04:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:45] [INFO ] [Nat]Absence check using state equation in 126 ms returned sat
[2023-03-09 08:04:45] [INFO ] [Nat]Added 418 Read/Feed constraints in 67 ms returned sat
[2023-03-09 08:04:45] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 51 ms.
[2023-03-09 08:04:45] [INFO ] Added : 2 causal constraints over 1 iterations in 139 ms. Result :sat
Minimization took 69 ms.
[2023-03-09 08:04:45] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:04:45] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 08:04:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:45] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2023-03-09 08:04:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:45] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:04:45] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 08:04:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:45] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2023-03-09 08:04:45] [INFO ] [Nat]Added 418 Read/Feed constraints in 54 ms returned sat
[2023-03-09 08:04:45] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 51 ms.
[2023-03-09 08:04:45] [INFO ] Added : 2 causal constraints over 1 iterations in 139 ms. Result :sat
Minimization took 94 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-09 08:04:46] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229627 resets, run finished after 903 ms. (steps per millisecond=1107 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 98615 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 98462 resets, run finished after 452 ms. (steps per millisecond=2212 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000000 steps, including 98708 resets, run finished after 414 ms. (steps per millisecond=2415 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 97910 resets, run finished after 412 ms. (steps per millisecond=2427 ) properties (out of 4) seen :4
[2023-03-09 08:04:48] [INFO ] Invariant cache hit.
[2023-03-09 08:04:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:48] [INFO ] [Real]Absence check using state equation in 22 ms returned unsat
[2023-03-09 08:04:48] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:49] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2023-03-09 08:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:49] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:49] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-09 08:04:49] [INFO ] [Nat]Added 40 Read/Feed constraints in 19 ms returned sat
[2023-03-09 08:04:49] [INFO ] Computed and/alt/rep : 32/72/32 causal constraints (skipped 85 transitions) in 10 ms.
[2023-03-09 08:04:49] [INFO ] Added : 10 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 18 ms.
[2023-03-09 08:04:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:49] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2023-03-09 08:04:49] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:49] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:49] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 08:04:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:49] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:49] [INFO ] [Nat]Added 40 Read/Feed constraints in 5 ms returned sat
[2023-03-09 08:04:49] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2023-03-09 08:04:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 59 ms
[2023-03-09 08:04:49] [INFO ] Computed and/alt/rep : 32/72/32 causal constraints (skipped 85 transitions) in 5 ms.
[2023-03-09 08:04:49] [INFO ] Added : 2 causal constraints over 1 iterations in 20 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.1 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 17 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 17 ms. Remains : 85/91 places, 108/118 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-09 08:04:49] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229418 resets, run finished after 788 ms. (steps per millisecond=1269 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 98439 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 98312 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 2) seen :2
[2023-03-09 08:04:51] [INFO ] Invariant cache hit.
[2023-03-09 08:04:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-09 08:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:51] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-09 08:04:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:04:51] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-09 08:04:51] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 8 ms.
[2023-03-09 08:04:51] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 22 ms.
[2023-03-09 08:04:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:51] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:51] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:51] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-09 08:04:51] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2023-03-09 08:04:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2023-03-09 08:04:51] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-09 08:04:51] [INFO ] Added : 13 causal constraints over 4 iterations in 45 ms. Result :sat
Minimization took 18 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 5 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 5 ms. Remains 85 /85 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2023-03-09 08:04:51] [INFO ] Invariant cache hit.
[2023-03-09 08:04:51] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 08:04:51] [INFO ] Invariant cache hit.
[2023-03-09 08:04:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:04:51] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2023-03-09 08:04:51] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:04:51] [INFO ] Invariant cache hit.
[2023-03-09 08:04:51] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 85/85 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06
[2023-03-09 08:04:51] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2262 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 984 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-09 08:04:51] [INFO ] Invariant cache hit.
[2023-03-09 08:04:51] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 08:04:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:51] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:51] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-09 08:04:51] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:04:51] [INFO ] [Nat]Added 36 Read/Feed constraints in 16 ms returned sat
[2023-03-09 08:04:51] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 7 ms.
[2023-03-09 08:04:51] [INFO ] Added : 13 causal constraints over 3 iterations in 42 ms. Result :sat
Minimization took 19 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-09 08:04:52] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229888 resets, run finished after 825 ms. (steps per millisecond=1212 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000000 steps, including 98305 resets, run finished after 383 ms. (steps per millisecond=2610 ) properties (out of 1) seen :0
[2023-03-09 08:04:53] [INFO ] Invariant cache hit.
[2023-03-09 08:04:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:53] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:53] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-09 08:04:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:04:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 10 ms returned sat
[2023-03-09 08:04:53] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-09 08:04:53] [INFO ] Added : 13 causal constraints over 3 iterations in 45 ms. Result :sat
Minimization took 22 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 12 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 12 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-09 08:04:53] [INFO ] Invariant cache hit.
[2023-03-09 08:04:53] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 08:04:53] [INFO ] Invariant cache hit.
[2023-03-09 08:04:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:04:53] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2023-03-09 08:04:53] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:04:53] [INFO ] Invariant cache hit.
[2023-03-09 08:04:53] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06 in 1896 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14
[2023-03-09 08:04:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2283 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 947 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-03-09 08:04:53] [INFO ] Invariant cache hit.
[2023-03-09 08:04:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:53] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 08:04:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:53] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:04:53] [INFO ] [Nat]Added 36 Read/Feed constraints in 5 ms returned sat
[2023-03-09 08:04:53] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-09 08:04:53] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 19 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 12 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 12 ms. Remains : 82/85 places, 99/108 transitions.
// Phase 1: matrix 99 rows 82 cols
[2023-03-09 08:04:53] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229506 resets, run finished after 747 ms. (steps per millisecond=1338 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 97936 resets, run finished after 377 ms. (steps per millisecond=2652 ) properties (out of 1) seen :2
[2023-03-09 08:04:55] [INFO ] Invariant cache hit.
[2023-03-09 08:04:55] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:55] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2023-03-09 08:04:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:55] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:55] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-09 08:04:55] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 08:04:55] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:04:55] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2023-03-09 08:04:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-09 08:04:55] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 6 ms.
[2023-03-09 08:04:55] [INFO ] Added : 2 causal constraints over 1 iterations in 17 ms. Result :sat
Minimization took 13 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 4 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 4 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-09 08:04:55] [INFO ] Invariant cache hit.
[2023-03-09 08:04:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 08:04:55] [INFO ] Invariant cache hit.
[2023-03-09 08:04:55] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 08:04:55] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-09 08:04:55] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:04:55] [INFO ] Invariant cache hit.
[2023-03-09 08:04:55] [INFO ] Dead Transitions using invariants and state equation in 43 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 82/82 places, 99/99 transitions.
[2023-03-09 08:04:55] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229571 resets, run finished after 724 ms. (steps per millisecond=1381 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98076 resets, run finished after 359 ms. (steps per millisecond=2785 ) properties (out of 1) seen :2
[2023-03-09 08:04:56] [INFO ] Invariant cache hit.
[2023-03-09 08:04:56] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:04:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:56] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 08:04:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:04:56] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2023-03-09 08:04:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:04:56] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-09 08:04:56] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 08:04:56] [INFO ] [Nat]Added 29 Read/Feed constraints in 5 ms returned sat
[2023-03-09 08:04:56] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 3 ms to minimize.
[2023-03-09 08:04:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 08:04:56] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 5 ms.
[2023-03-09 08:04:56] [INFO ] Added : 2 causal constraints over 1 iterations in 22 ms. Result :sat
Minimization took 14 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-09 08:04:56] [INFO ] Invariant cache hit.
[2023-03-09 08:04:56] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-09 08:04:56] [INFO ] Invariant cache hit.
[2023-03-09 08:04:56] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 08:04:56] [INFO ] Implicit Places using invariants and state equation in 111 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-09 08:04:56] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:04:56] [INFO ] Invariant cache hit.
[2023-03-09 08:04:56] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14 in 3279 ms.
[2023-03-09 08:04:57] [INFO ] Flatten gal took : 35 ms
[2023-03-09 08:04:57] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 08:04:57] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 85 places, 108 transitions and 425 arcs took 2 ms.
Total runtime 15773 ms.
There are residual formulas that ITS could not solve within timeout
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running DBSingleClientW (PT), instance d1m06
Examination UpperBounds
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/UpperBoundParse.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//upper_bound//smart

PNML FILE: model.pnml
Petri model created: 85 places, 108 transitions, 425 arcs.
Final Score: 1313.967
Took : 6 seconds
Bounds file is: UpperBounds.xml
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS
FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS

BK_STOP 1678349105370

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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

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="smartxred"
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 smartxred"
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 r107-tall-167814484000253"
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 ;