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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:34 CTLCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:34 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:33 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 15:33 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 15:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 15:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 15:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 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 119K 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-d0m09-UpperBounds-00
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-01
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-02
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-03
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-04
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-05
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-06
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-07
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-08
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-09
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-10
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-11
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-12
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-13
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-14
FORMULA_NAME DBSingleClientW-PT-d0m09-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678350409290

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-d0m09
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 08:26:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-09 08:26:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 08:26:51] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-09 08:26:51] [INFO ] Transformed 553 places.
[2023-03-09 08:26:51] [INFO ] Transformed 150 transitions.
[2023-03-09 08:26:51] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 118 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 444 places in 2 ms
Reduce places removed 444 places and 0 transitions.
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 150 rows 109 cols
[2023-03-09 08:26:51] [INFO ] Computed 6 place invariants in 24 ms
Incomplete random walk after 10000 steps, including 2312 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10000 steps, including 1027 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 996 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 1049 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 977 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 4) seen :1
[2023-03-09 08:26:51] [INFO ] Invariant cache hit.
[2023-03-09 08:26:51] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2023-03-09 08:26:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2023-03-09 08:26:51] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:26:51] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-09 08:26:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:26:51] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2023-03-09 08:26:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:26:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:26:51] [INFO ] [Nat]Absence check using 2 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-09 08:26:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:26:51] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2023-03-09 08:26:51] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-09 08:26:51] [INFO ] [Nat]Added 74 Read/Feed constraints in 13 ms returned sat
[2023-03-09 08:26:51] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 3 ms to minimize.
[2023-03-09 08:26:51] [INFO ] Deduced a trap composed of 36 places in 44 ms of which 1 ms to minimize.
[2023-03-09 08:26:51] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2023-03-09 08:26:51] [INFO ] Deduced a trap composed of 37 places in 44 ms of which 1 ms to minimize.
[2023-03-09 08:26:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 238 ms
[2023-03-09 08:26:51] [INFO ] Computed and/alt/rep : 39/69/39 causal constraints (skipped 110 transitions) in 18 ms.
[2023-03-09 08:26:52] [INFO ] Added : 10 causal constraints over 2 iterations in 63 ms. Result :sat
Minimization took 51 ms.
[2023-03-09 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-09 08:26:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 2 ms returned unsat
[2023-03-09 08:26:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-09 08:26:52] [INFO ] [Real]Absence check using 2 positive and 4 generalized place invariants in 7 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 9, 1, 1] Max seen :[1, 0, 1, 1]
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA DBSingleClientW-PT-d0m09-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 109/109 places, 150/150 transitions.
Graph (complete) has 332 edges and 109 vertex of which 101 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.2 ms
Discarding 8 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 101 transition count 137
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 37 place count 78 transition count 98
Iterating global reduction 1 with 23 rules applied. Total rules applied 60 place count 78 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 61 place count 78 transition count 97
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 72 place count 67 transition count 86
Iterating global reduction 2 with 11 rules applied. Total rules applied 83 place count 67 transition count 86
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 86 place count 64 transition count 80
Iterating global reduction 2 with 3 rules applied. Total rules applied 89 place count 64 transition count 80
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 64 transition count 79
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 92 place count 62 transition count 76
Iterating global reduction 3 with 2 rules applied. Total rules applied 94 place count 62 transition count 76
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 96 place count 60 transition count 74
Iterating global reduction 3 with 2 rules applied. Total rules applied 98 place count 60 transition count 74
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 100 place count 60 transition count 72
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 101 place count 59 transition count 71
Iterating global reduction 4 with 1 rules applied. Total rules applied 102 place count 59 transition count 71
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 104 place count 59 transition count 69
Applied a total of 104 rules in 41 ms. Remains 59 /109 variables (removed 50) and now considering 69/150 (removed 81) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 59/109 places, 69/150 transitions.
// Phase 1: matrix 69 rows 59 cols
[2023-03-09 08:26:52] [INFO ] Computed 2 place invariants in 1 ms
Incomplete random walk after 1000000 steps, including 229052 resets, run finished after 699 ms. (steps per millisecond=1430 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102164 resets, run finished after 352 ms. (steps per millisecond=2840 ) properties (out of 1) seen :0
[2023-03-09 08:26:53] [INFO ] Invariant cache hit.
[2023-03-09 08:26:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:26:53] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2023-03-09 08:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:26:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:26:53] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2023-03-09 08:26:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 08:26:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 6 ms returned sat
[2023-03-09 08:26:53] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 49 transitions) in 6 ms.
[2023-03-09 08:26:53] [INFO ] Added : 10 causal constraints over 3 iterations in 31 ms. Result :sat
Minimization took 24 ms.
Current structural bounds on expressions (after SMT) : [9] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 9 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 59/59 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-09 08:26:53] [INFO ] Invariant cache hit.
[2023-03-09 08:26:53] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-09 08:26:53] [INFO ] Invariant cache hit.
[2023-03-09 08:26:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 08:26:53] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 138 ms to find 0 implicit places.
[2023-03-09 08:26:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:26:53] [INFO ] Invariant cache hit.
[2023-03-09 08:26:53] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 59/59 places, 69/69 transitions.
Starting property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-06
[2023-03-09 08:26:53] [INFO ] Invariant cache hit.
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 1079 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
[2023-03-09 08:26:53] [INFO ] Invariant cache hit.
[2023-03-09 08:26:53] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:26:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:26:53] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2023-03-09 08:26:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:26:53] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:26:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:26:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2023-03-09 08:26:53] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 08:26:53] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:26:53] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 49 transitions) in 6 ms.
[2023-03-09 08:26:53] [INFO ] Added : 10 causal constraints over 3 iterations in 27 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/59 places, 69/69 transitions.
[2023-03-09 08:26:53] [INFO ] Invariant cache hit.
Incomplete random walk after 1000000 steps, including 229398 resets, run finished after 675 ms. (steps per millisecond=1481 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102058 resets, run finished after 329 ms. (steps per millisecond=3039 ) properties (out of 1) seen :0
[2023-03-09 08:26:54] [INFO ] Invariant cache hit.
[2023-03-09 08:26:54] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-09 08:26:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-09 08:26:54] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2023-03-09 08:26:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-09 08:26:54] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2023-03-09 08:26:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-09 08:26:54] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2023-03-09 08:26:54] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 08:26:54] [INFO ] [Nat]Added 22 Read/Feed constraints in 3 ms returned sat
[2023-03-09 08:26:55] [INFO ] Computed and/alt/rep : 19/39/19 causal constraints (skipped 49 transitions) in 8 ms.
[2023-03-09 08:26:55] [INFO ] Added : 10 causal constraints over 3 iterations in 35 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 59/59 places, 69/69 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 69/69 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 69/69 (removed 0) transitions.
[2023-03-09 08:26:55] [INFO ] Invariant cache hit.
[2023-03-09 08:26:55] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-09 08:26:55] [INFO ] Invariant cache hit.
[2023-03-09 08:26:55] [INFO ] State equation strengthened by 22 read => feed constraints.
[2023-03-09 08:26:55] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
[2023-03-09 08:26:55] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-09 08:26:55] [INFO ] Invariant cache hit.
[2023-03-09 08:26:55] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 59/59 places, 69/69 transitions.
Ending property specific reduction for DBSingleClientW-PT-d0m09-UpperBounds-06 in 1590 ms.
[2023-03-09 08:26:55] [INFO ] Flatten gal took : 32 ms
[2023-03-09 08:26:55] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/UpperBounds.sr.xml took 2 ms.
[2023-03-09 08:26:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 59 places, 69 transitions and 271 arcs took 2 ms.
Total runtime 4676 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_d0m09
(NrP: 59 NrTr: 69 NrArc: 271)

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

net check time: 0m 0.000sec

init dd package: 0m 2.754sec


RS generation: 0m 1.408sec


-> reachability set: #nodes 6015 (6.0e+03) #states 10,949,504 (7)



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

checking: place_bound(p53)
normalized: place_bound(p53)

-> the formula is 6

FORMULA DBSingleClientW-PT-d0m09-UpperBounds-06 6 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 248715 (2.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6295651 5798553 12094204
used/not used/entry size/cache size: 5749638 61359226 16 1024MB
basic ops cache: hits/miss/sum: 481 2026 2507
used/not used/entry size/cache size: 5821 16771395 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: 5866 6015 11881
used/not used/entry size/cache size: 6015 8382593 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 66880734
1 214929
2 11469
3 1286
4 134
5 72
6 45
7 34
8 24
9 16
>= 10 121

Total processing time: 0m 5.818sec


BK_STOP 1678350422436

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

5982
iterations count:143097 (2073), effective:5918 (85)

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-d0m09"
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-d0m09, 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-167814482400221"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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