Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-3253
Executing tool marcie
Input is S_Diffusion2D-PT-D05N050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r091-ebro-149488438600367
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-0
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-1
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-10
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-11
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-12
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-13
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-14
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-15
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-2
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-3
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-4
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-5
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-6
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-7
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-8
FORMULA_NAME Diffusion2D-PT-D05N050-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1495056994625

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=ReachabilityCardinality.xml --memory=6

parse successfull
net created successfully

Net: Diffusion2D_PT_D05N050
(NrP: 25 NrTr: 144 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 2.299sec

parse successfull
net created successfully

Net: Diffusion2D_PT_D05N050
(NrP: 25 NrTr: 144 NrArc: 288)

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

net check time: 0m 0.000sec

init dd package: 0m 8.538sec


RS generation: 0m 0.856sec


-> reachability set: #nodes 1225 (1.2e+03) #states 17,529,515,713,716,297,876 (19)



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

checking: EF [3<=cAMP__3_1_]
normalized: E [true U 3<=cAMP__3_1_]

abstracting: (3<=cAMP__3_1_)
states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.537sec

checking: EF [3<=cAMP__3_5_]
normalized: E [true U 3<=cAMP__3_5_]

abstracting: (3<=cAMP__3_5_)
states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.034sec

checking: EF [3<=cAMP__3_5_]
normalized: E [true U 3<=cAMP__3_5_]

abstracting: (3<=cAMP__3_5_)
states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [3<=cAMP__1_4_]
normalized: E [true U 3<=cAMP__1_4_]

abstracting: (3<=cAMP__1_4_)
states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.149sec

checking: AG [3<=cAMP__3_3_]
normalized: ~ [E [true U ~ [3<=cAMP__3_3_]]]

abstracting: (3<=cAMP__3_3_)
states: 5,300,174,441,392,685,400 (18)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.698sec

checking: EF [3<=cAMP__1_4_]
normalized: E [true U 3<=cAMP__1_4_]

abstracting: (3<=cAMP__1_4_)
states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: EF [2<=cAMP__2_5_]
normalized: E [true U 2<=cAMP__2_5_]

abstracting: (2<=cAMP__2_5_)
states: 7,950,261,662,089,028,100 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.956sec

checking: AG [~ [[~ [3<=cAMP__3_3_] & 1<=cAMP__4_1_]]]
normalized: ~ [E [true U [~ [3<=cAMP__3_3_] & 1<=cAMP__4_1_]]]

abstracting: (1<=cAMP__4_1_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (3<=cAMP__3_3_)
states: 5,300,174,441,392,685,400 (18)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.259sec

checking: EF [~ [~ [[3<=cAMP__2_1_ & 3<=cAMP__3_2_]]]]
normalized: E [true U [3<=cAMP__2_1_ & 3<=cAMP__3_2_]]

abstracting: (3<=cAMP__3_2_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (3<=cAMP__2_1_)
states: 5,300,174,441,392,685,400 (18)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.500sec

checking: AG [[2<=cAMP__3_3_ | cAMP__2_4_<=cAMP__3_4_]]
normalized: ~ [E [true U ~ [[2<=cAMP__3_3_ | cAMP__2_4_<=cAMP__3_4_]]]]

abstracting: (cAMP__2_4_<=cAMP__3_4_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__3_3_)
states: 7,950,261,662,089,028,100 (18)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.889sec

checking: AG [[[~ [1<=cAMP__3_5_] & ~ [3<=cAMP__3_4_]] | 1<=cAMP__3_3_]]
normalized: ~ [E [true U ~ [[1<=cAMP__3_3_ | [~ [3<=cAMP__3_4_] & ~ [1<=cAMP__3_5_]]]]]]

abstracting: (1<=cAMP__3_5_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (3<=cAMP__3_4_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (1<=cAMP__3_3_)
states: 11,844,267,374,132,633,700 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.280sec

checking: EF [[~ [cAMP__3_4_<=cAMP__5_4_] & [cAMP__3_3_<=cAMP__3_1_ & [3<=cAMP__1_3_ & 2<=cAMP__1_5_]]]]
normalized: E [true U [[cAMP__3_3_<=cAMP__3_1_ & [3<=cAMP__1_3_ & 2<=cAMP__1_5_]] & ~ [cAMP__3_4_<=cAMP__5_4_]]]

abstracting: (cAMP__3_4_<=cAMP__5_4_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__1_5_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (3<=cAMP__1_3_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__3_3_<=cAMP__3_1_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m30.419sec

checking: AG [[[[2<=cAMP__1_3_ & cAMP__4_1_<=cAMP__1_3_] | ~ [1<=cAMP__1_4_]] | ~ [[cAMP__2_3_<=cAMP__4_3_ & 1<=cAMP__4_5_]]]]
normalized: ~ [E [true U ~ [[~ [[cAMP__2_3_<=cAMP__4_3_ & 1<=cAMP__4_5_]] | [~ [1<=cAMP__1_4_] | [2<=cAMP__1_3_ & cAMP__4_1_<=cAMP__1_3_]]]]]]

abstracting: (cAMP__4_1_<=cAMP__1_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__1_3_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (1<=cAMP__1_4_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (1<=cAMP__4_5_)
states: 11,844,267,374,132,633,700 (19)
abstracting: (cAMP__2_3_<=cAMP__4_3_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.007sec

checking: AG [[[~ [3<=cAMP__3_1_] | [2<=cAMP__1_4_ | cAMP__5_2_<=cAMP__3_3_]] | [~ [cAMP__4_3_<=cAMP__4_2_] & [cAMP__2_1_<=cAMP__4_1_ | 3<=cAMP__4_1_]]]]
normalized: ~ [E [true U ~ [[[[cAMP__2_1_<=cAMP__4_1_ | 3<=cAMP__4_1_] & ~ [cAMP__4_3_<=cAMP__4_2_]] | [[2<=cAMP__1_4_ | cAMP__5_2_<=cAMP__3_3_] | ~ [3<=cAMP__3_1_]]]]]]

abstracting: (3<=cAMP__3_1_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__5_2_<=cAMP__3_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__1_4_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__4_3_<=cAMP__4_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (3<=cAMP__4_1_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__2_1_<=cAMP__4_1_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is FALSE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.350sec

checking: EF [[[[cAMP__1_3_<=cAMP__1_5_ & 3<=cAMP__1_5_] & [2<=cAMP__2_4_ | cAMP__4_4_<=cAMP__5_2_]] & [~ [cAMP__5_2_<=cAMP__3_3_] | ~ [cAMP__2_2_<=cAMP__3_3_]]]]
normalized: E [true U [[~ [cAMP__2_2_<=cAMP__3_3_] | ~ [cAMP__5_2_<=cAMP__3_3_]] & [[2<=cAMP__2_4_ | cAMP__4_4_<=cAMP__5_2_] & [cAMP__1_3_<=cAMP__1_5_ & 3<=cAMP__1_5_]]]]

abstracting: (3<=cAMP__1_5_)
states: 5,300,174,441,392,685,400 (18)
abstracting: (cAMP__1_3_<=cAMP__1_5_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__4_4_<=cAMP__5_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__2_4_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__5_2_<=cAMP__3_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__2_2_<=cAMP__3_3_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.894sec

checking: AG [[[[cAMP__5_2_<=cAMP__3_1_ & 2<=cAMP__3_1_] | cAMP__1_1_<=cAMP__2_1_] | [[cAMP__2_1_<=cAMP__4_3_ | 2<=cAMP__2_1_] | [cAMP__4_3_<=cAMP__5_4_ | cAMP__1_4_<=cAMP__1_2_]]]]
normalized: ~ [E [true U ~ [[[[cAMP__4_3_<=cAMP__5_4_ | cAMP__1_4_<=cAMP__1_2_] | [cAMP__2_1_<=cAMP__4_3_ | 2<=cAMP__2_1_]] | [cAMP__1_1_<=cAMP__2_1_ | [cAMP__5_2_<=cAMP__3_1_ & 2<=cAMP__3_1_]]]]]]

abstracting: (2<=cAMP__3_1_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__5_2_<=cAMP__3_1_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__1_1_<=cAMP__2_1_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (2<=cAMP__2_1_)
states: 7,950,261,662,089,028,100 (18)
abstracting: (cAMP__2_1_<=cAMP__4_3_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__1_4_<=cAMP__1_2_)
states: 10,450,079,192,611,522,356 (19)
abstracting: (cAMP__4_3_<=cAMP__5_4_)
states: 10,450,079,192,611,522,356 (19)
-> the formula is TRUE

FORMULA Diffusion2D-PT-D05N050-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.359sec

totally nodes used: 4412527 (4.4e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1329089966 75352683 1404442649
used/not used/entry size/cache size: 46319385 20789479 16 1024MB
basic ops cache: hits/miss/sum: 93683950 5055212 98739162
used/not used/entry size/cache size: 5342464 11434752 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: 2000577 92291 2092868
used/not used/entry size/cache size: 91866 8296742 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 63192019
1 3764581
2 120406
3 6706
4 1708
5 1415
6 1401
7 1372
8 1339
9 1363
>= 10 16554

Total processing time: 4m 8.077sec


BK_STOP 1495057243054

--------------------
content from stderr:

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

ptnet_zbdd.cc:255: Boundedness exception: net is not 1-bounded!

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.001sec


iterations count:42944 (298), effective:1200 (8)

initing FirstDep: 0m 0.000sec


iterations count:2724 (18), effective:72 (0)

iterations count:2724 (18), effective:72 (0)

iterations count:2724 (18), effective:72 (0)

iterations count:2730 (18), effective:72 (0)

iterations count:240 (1), effective:48 (0)

iterations count:2730 (18), effective:72 (0)

iterations count:1864 (12), effective:48 (0)

iterations count:1098 (7), effective:71 (0)

iterations count:5313 (36), effective:144 (1)

iterations count:3097 (21), effective:217 (1)

iterations count:1348 (9), effective:94 (0)

iterations count:23727 (164), effective:694 (4)

iterations count:3571 (24), effective:143 (0)

iterations count:14004 (97), effective:572 (3)

iterations count:7105 (49), effective:339 (2)

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="S_Diffusion2D-PT-D05N050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/S_Diffusion2D-PT-D05N050.tgz
mv S_Diffusion2D-PT-D05N050 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is S_Diffusion2D-PT-D05N050, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r091-ebro-149488438600367"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
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 ;