fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of Marcie+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
5450.668 23671.00 36059.00 334.90 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.r106-tall-167814482500253.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 marciexred
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 r106-tall-167814482500253
=====================================================================

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

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=marciexred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m06
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:47:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 08:47:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:47:58] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2023-03-09 08:47:58] [INFO ] Transformed 1440 places.
[2023-03-09 08:47:58] [INFO ] Transformed 672 transitions.
[2023-03-09 08:47:58] [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-09 08:47:58] [INFO ] Computed 6 place invariants in 40 ms
Incomplete random walk after 10000 steps, including 2290 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 930 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 887 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 933 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 974 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :1
[2023-03-09 08:47:59] [INFO ] Invariant cache hit.
[2023-03-09 08:47:59] [INFO ] [Real]Absence check using 2 positive place invariants in 10 ms returned sat
[2023-03-09 08:47:59] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 6 ms returned sat
[2023-03-09 08:47:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:47:59] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2023-03-09 08:47:59] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:47:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 25 ms returned sat
[2023-03-09 08:47:59] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-09 08:47:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:47:59] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2023-03-09 08:47:59] [INFO ] State equation strengthened by 418 read => feed constraints.
[2023-03-09 08:47:59] [INFO ] [Nat]Added 418 Read/Feed constraints in 58 ms returned sat
[2023-03-09 08:48:00] [INFO ] Deduced a trap composed of 108 places in 426 ms of which 5 ms to minimize.
[2023-03-09 08:48:00] [INFO ] Deduced a trap composed of 95 places in 245 ms of which 11 ms to minimize.
[2023-03-09 08:48:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 747 ms
[2023-03-09 08:48:00] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 124 ms.
[2023-03-09 08:48:00] [INFO ] Added : 4 causal constraints over 1 iterations in 270 ms. Result :sat
Minimization took 81 ms.
[2023-03-09 08:48:01] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:48:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 08:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:01] [INFO ] [Real]Absence check using state equation in 150 ms returned sat
[2023-03-09 08:48:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:48:01] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-09 08:48:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:01] [INFO ] [Nat]Absence check using state equation in 115 ms returned sat
[2023-03-09 08:48:01] [INFO ] [Nat]Added 418 Read/Feed constraints in 73 ms returned sat
[2023-03-09 08:48:01] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 52 ms.
[2023-03-09 08:48:01] [INFO ] Added : 11 causal constraints over 3 iterations in 234 ms. Result :sat
Minimization took 98 ms.
[2023-03-09 08:48:01] [INFO ] [Real]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 08:48:01] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-09 08:48:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:02] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2023-03-09 08:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 3 ms returned sat
[2023-03-09 08:48:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 08:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:02] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2023-03-09 08:48:02] [INFO ] [Nat]Added 418 Read/Feed constraints in 59 ms returned sat
[2023-03-09 08:48:02] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 62 ms.
[2023-03-09 08:48:02] [INFO ] Added : 2 causal constraints over 1 iterations in 158 ms. Result :sat
Minimization took 69 ms.
[2023-03-09 08:48:02] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:48:02] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 08:48:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:02] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2023-03-09 08:48:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 4 ms returned sat
[2023-03-09 08:48:02] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 4 ms returned sat
[2023-03-09 08:48:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:02] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2023-03-09 08:48:03] [INFO ] [Nat]Added 418 Read/Feed constraints in 57 ms returned sat
[2023-03-09 08:48:03] [INFO ] Computed and/alt/rep : 126/406/126 causal constraints (skipped 545 transitions) in 52 ms.
[2023-03-09 08:48:03] [INFO ] Added : 2 causal constraints over 1 iterations in 135 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.3 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 76 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 76 ms. Remains : 91/347 places, 118/672 transitions.
// Phase 1: matrix 118 rows 91 cols
[2023-03-09 08:48:03] [INFO ] Computed 2 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 229343 resets, run finished after 929 ms. (steps per millisecond=1076 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000001 steps, including 98464 resets, run finished after 467 ms. (steps per millisecond=2141 ) properties (out of 4) seen :4
Incomplete Best-First random walk after 1000000 steps, including 98270 resets, run finished after 427 ms. (steps per millisecond=2341 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 1000000 steps, including 98413 resets, run finished after 425 ms. (steps per millisecond=2352 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 1000001 steps, including 98308 resets, run finished after 430 ms. (steps per millisecond=2325 ) properties (out of 4) seen :4
[2023-03-09 08:48:06] [INFO ] Invariant cache hit.
[2023-03-09 08:48:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:06] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
[2023-03-09 08:48:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 08:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 08:48:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 08:48:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:06] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-09 08:48:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-09 08:48:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 11 ms returned sat
[2023-03-09 08:48:06] [INFO ] Computed and/alt/rep : 32/72/32 causal constraints (skipped 85 transitions) in 8 ms.
[2023-03-09 08:48:06] [INFO ] Added : 10 causal constraints over 3 iterations in 44 ms. Result :sat
Minimization took 15 ms.
[2023-03-09 08:48:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:06] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2023-03-09 08:48:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:06] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 08:48:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:06] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 08:48:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:06] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2023-03-09 08:48:06] [INFO ] [Nat]Added 40 Read/Feed constraints in 6 ms returned sat
[2023-03-09 08:48:06] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2023-03-09 08:48:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-09 08:48:06] [INFO ] Computed and/alt/rep : 32/72/32 causal constraints (skipped 85 transitions) in 6 ms.
[2023-03-09 08:48:06] [INFO ] Added : 2 causal constraints over 1 iterations in 21 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 16 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 16 ms. Remains : 85/91 places, 108/118 transitions.
// Phase 1: matrix 108 rows 85 cols
[2023-03-09 08:48:06] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229539 resets, run finished after 819 ms. (steps per millisecond=1221 ) properties (out of 2) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98789 resets, run finished after 384 ms. (steps per millisecond=2604 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 1000000 steps, including 98213 resets, run finished after 388 ms. (steps per millisecond=2577 ) properties (out of 2) seen :2
[2023-03-09 08:48:08] [INFO ] Invariant cache hit.
[2023-03-09 08:48:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 08:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:08] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 08:48:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:08] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2023-03-09 08:48:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:48:08] [INFO ] [Nat]Added 36 Read/Feed constraints in 8 ms returned sat
[2023-03-09 08:48:08] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 9 ms.
[2023-03-09 08:48:08] [INFO ] Added : 13 causal constraints over 3 iterations in 41 ms. Result :sat
Minimization took 22 ms.
[2023-03-09 08:48:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:08] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 08:48:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:08] [INFO ] [Nat]Absence check using state equation in 29 ms returned sat
[2023-03-09 08:48:08] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-09 08:48:08] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 2 ms to minimize.
[2023-03-09 08:48:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-09 08:48:08] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-09 08:48:08] [INFO ] Added : 13 causal constraints over 4 iterations in 42 ms. Result :sat
Minimization took 22 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:48:08] [INFO ] Invariant cache hit.
[2023-03-09 08:48:08] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-09 08:48:08] [INFO ] Invariant cache hit.
[2023-03-09 08:48:08] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:48:08] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2023-03-09 08:48:08] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:48:08] [INFO ] Invariant cache hit.
[2023-03-09 08:48:09] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 290 ms. Remains : 85/85 places, 108/108 transitions.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06
[2023-03-09 08:48:09] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 995 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
[2023-03-09 08:48:09] [INFO ] Invariant cache hit.
[2023-03-09 08:48:09] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:09] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-09 08:48:09] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:09] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:09] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2023-03-09 08:48:09] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:48:09] [INFO ] [Nat]Added 36 Read/Feed constraints in 29 ms returned sat
[2023-03-09 08:48:09] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 8 ms.
[2023-03-09 08:48:09] [INFO ] Added : 13 causal constraints over 3 iterations in 39 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 4 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.
[2023-03-09 08:48:09] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229491 resets, run finished after 773 ms. (steps per millisecond=1293 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 98295 resets, run finished after 393 ms. (steps per millisecond=2544 ) properties (out of 1) seen :0
[2023-03-09 08:48:10] [INFO ] Invariant cache hit.
[2023-03-09 08:48:10] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:10] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-09 08:48:10] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:10] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:10] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-09 08:48:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:48:10] [INFO ] [Nat]Added 36 Read/Feed constraints in 9 ms returned sat
[2023-03-09 08:48:10] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 6 ms.
[2023-03-09 08:48:10] [INFO ] Added : 13 causal constraints over 3 iterations in 40 ms. Result :sat
Minimization took 25 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.
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:48:10] [INFO ] Invariant cache hit.
[2023-03-09 08:48:10] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 08:48:10] [INFO ] Invariant cache hit.
[2023-03-09 08:48:10] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:48:10] [INFO ] Implicit Places using invariants and state equation in 112 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-09 08:48:10] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-09 08:48:10] [INFO ] Invariant cache hit.
[2023-03-09 08:48:10] [INFO ] Dead Transitions using invariants and state equation in 76 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 85/85 places, 108/108 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-06 in 1937 ms.
Starting property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14
[2023-03-09 08:48:10] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2301 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 948 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :1
[2023-03-09 08:48:11] [INFO ] Invariant cache hit.
[2023-03-09 08:48:11] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:11] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-09 08:48:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:11] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:11] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2023-03-09 08:48:11] [INFO ] State equation strengthened by 36 read => feed constraints.
[2023-03-09 08:48:11] [INFO ] [Nat]Added 36 Read/Feed constraints in 4 ms returned sat
[2023-03-09 08:48:11] [INFO ] Computed and/alt/rep : 30/63/30 causal constraints (skipped 77 transitions) in 5 ms.
[2023-03-09 08:48:11] [INFO ] Added : 2 causal constraints over 1 iterations in 20 ms. Result :sat
Minimization took 18 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 11 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:48:11] [INFO ] Computed 2 place invariants in 0 ms
Incomplete random walk after 1000000 steps, including 229469 resets, run finished after 721 ms. (steps per millisecond=1386 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98493 resets, run finished after 359 ms. (steps per millisecond=2785 ) properties (out of 1) seen :2
[2023-03-09 08:48:12] [INFO ] Invariant cache hit.
[2023-03-09 08:48:12] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:12] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2023-03-09 08:48:12] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:12] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:12] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2023-03-09 08:48:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 08:48:12] [INFO ] [Nat]Added 29 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:48:12] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 0 ms to minimize.
[2023-03-09 08:48:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2023-03-09 08:48:12] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 4 ms.
[2023-03-09 08:48:12] [INFO ] Added : 2 causal constraints over 1 iterations in 18 ms. Result :sat
Minimization took 19 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:48:12] [INFO ] Invariant cache hit.
[2023-03-09 08:48:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-09 08:48:12] [INFO ] Invariant cache hit.
[2023-03-09 08:48:12] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 08:48:12] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 166 ms to find 0 implicit places.
[2023-03-09 08:48:12] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-09 08:48:12] [INFO ] Invariant cache hit.
[2023-03-09 08:48:12] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 82/82 places, 99/99 transitions.
[2023-03-09 08:48:12] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229549 resets, run finished after 775 ms. (steps per millisecond=1290 ) properties (out of 1) seen :2
Incomplete Best-First random walk after 1000000 steps, including 98511 resets, run finished after 366 ms. (steps per millisecond=2732 ) properties (out of 1) seen :2
[2023-03-09 08:48:13] [INFO ] Invariant cache hit.
[2023-03-09 08:48:13] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:48:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:13] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2023-03-09 08:48:13] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:48:13] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 4 ms returned sat
[2023-03-09 08:48:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:48:13] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-09 08:48:13] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 08:48:13] [INFO ] [Nat]Added 29 Read/Feed constraints in 10 ms returned sat
[2023-03-09 08:48:13] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 3 ms to minimize.
[2023-03-09 08:48:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-09 08:48:13] [INFO ] Computed and/alt/rep : 29/61/29 causal constraints (skipped 69 transitions) in 6 ms.
[2023-03-09 08:48:14] [INFO ] Added : 2 causal constraints over 1 iterations in 26 ms. Result :sat
Minimization took 12 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 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:48:14] [INFO ] Invariant cache hit.
[2023-03-09 08:48:14] [INFO ] Implicit Places using invariants in 53 ms returned []
[2023-03-09 08:48:14] [INFO ] Invariant cache hit.
[2023-03-09 08:48:14] [INFO ] State equation strengthened by 29 read => feed constraints.
[2023-03-09 08:48:14] [INFO ] Implicit Places using invariants and state equation in 198 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-09 08:48:14] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:48:14] [INFO ] Invariant cache hit.
[2023-03-09 08:48:14] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 82/82 places, 99/99 transitions.
Ending property specific reduction for DBSingleClientW-PT-d1m06-UpperBounds-14 in 3364 ms.
[2023-03-09 08:48:14] [INFO ] Flatten gal took : 30 ms
[2023-03-09 08:48:14] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/UpperBounds.sr.xml took 3 ms.
[2023-03-09 08:48:14] [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 16157 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: DBSingleClientW_PT_d1m06
(NrP: 85 NrTr: 108 NrArc: 425)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 2.701sec


RS generation: 0m 0.778sec


-> reachability set: #nodes 5177 (5.2e+03) #states 478,508 (5)



starting MCC model checker
--------------------------

checking: place_bound(p6)
normalized: place_bound(p6)

-> the formula is 1

FORMULA DBSingleClientW-PT-d1m06-UpperBounds-06 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p67)
normalized: place_bound(p67)

-> the formula is 2

FORMULA DBSingleClientW-PT-d1m06-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 122326 (1.2e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1582329 3709431 5291760
used/not used/entry size/cache size: 3707035 63401829 16 1024MB
basic ops cache: hits/miss/sum: 986 4579 5565
used/not used/entry size/cache size: 12670 16764546 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 2295 5177 7472
used/not used/entry size/cache size: 5177 8383431 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66993202
1 109789
2 5535
3 292
4 17
5 5
6 3
7 7
8 1
9 2
>= 10 11

Total processing time: 0m 5.095sec


BK_STOP 1678351700659

--------------------
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
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:60377 (559), effective:1656 (15)

initing FirstDep: 0m 0.000sec

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="marciexred"
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 marciexred"
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 r106-tall-167814482500253"
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 ;