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-2979
Executing tool marcie
Input is S_ResAllocation-PT-R003C050, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128600331
=====================================================================

--------------------
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 ResAllocation-PT-R003C050-ReachabilityCardinality-0
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-1
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-15
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-2
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-3
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-4
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-5
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-6
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-7
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-8
FORMULA_NAME ResAllocation-PT-R003C050-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1464598588923


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: ResAllocation_PT_R003C050
(NrP: 300 NrTr: 200 NrArc: 894)

net check time: 0m 0.000sec

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

init dd package: 0m 3.859sec


RS generation: 0m 0.102sec


-> reachability set: #nodes 2056 (2.1e+03) #states 48,717,538,008,124,384,423,924,727,808 (28)



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

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

abstracting: (3<=r_42_0) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (3<=r_9_2) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

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

abstracting: (3<=p_7_0) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (3<=p_8_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (2<=r_37_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=r_16_1) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [p_22_1<=r_21_2]
normalized: ~ [E [true U ~ [p_22_1<=r_21_2]]]

abstracting: (p_22_1<=r_21_2) states: 41,655,449,811,849,904,832,341,082,112 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.220sec

checking: EF [[1<=p_34_0 & [~ [1<=r_42_0] & 2<=p_10_1]]]
normalized: E [true U [1<=p_34_0 & [2<=p_10_1 & ~ [1<=r_42_0]]]]

abstracting: (1<=r_42_0) states: 23,359,919,470,154,834,322,086,952,960 (28)
abstracting: (2<=p_10_1) states: 0
abstracting: (1<=p_34_0) states: 18,902,053,313,150,653,501,240,508,416 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [~ [[2<=p_6_1 & [1<=p_44_2 | r_21_0<=p_1_2]]]]
normalized: ~ [E [true U [2<=p_6_1 & [1<=p_44_2 | r_21_0<=p_1_2]]]]

abstracting: (r_21_0<=p_1_2) states: 32,606,018,672,649,350,310,837,354,496 (28)
abstracting: (1<=p_44_2) states: 6,131,904,548,197,852,224,207,978,496 (27)
abstracting: (2<=p_6_1) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: AG [~ [[[1<=p_1_0 | p_18_1<=r_1_2] & ~ [p_27_0<=p_7_0]]]]
normalized: ~ [E [true U [~ [p_27_0<=p_7_0] & [1<=p_1_0 | p_18_1<=r_1_2]]]]

abstracting: (p_18_1<=r_1_2) states: 42,690,819,382,520,682,858,086,924,288 (28)
abstracting: (1<=p_1_0) states: 3,818,370,801,320,606,588,343,418,880 (27)
abstracting: (p_27_0<=p_7_0) states: 43,160,171,480,777,508,406,975,004,672 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.279sec

checking: AG [[[1<=p_38_0 & [r_48_1<=r_15_1 & 1<=r_15_1]] | ~ [~ [r_44_1<=r_12_1]]]]
normalized: ~ [E [true U ~ [[r_44_1<=r_12_1 | [1<=p_38_0 & [r_48_1<=r_15_1 & 1<=r_15_1]]]]]]

abstracting: (1<=r_15_1) states: 23,681,266,198,585,664,425,196,257,280 (28)
abstracting: (r_48_1<=r_15_1) states: 37,876,446,123,157,559,403,224,236,032 (28)
abstracting: (1<=p_38_0) states: 18,896,658,837,318,720,107,105,484,800 (28)
abstracting: (r_44_1<=r_12_1) states: 36,696,810,158,108,597,122,563,571,712 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.335sec

checking: AG [~ [[[r_11_2<=p_37_0 & p_8_0<=p_36_2] & ~ [p_41_0<=p_41_0]]]]
normalized: ~ [E [true U [~ [p_41_0<=p_41_0] & [r_11_2<=p_37_0 & p_8_0<=p_36_2]]]]

abstracting: (p_8_0<=p_36_2) states: 32,258,984,199,973,773,831,267,418,112 (28)
abstracting: (r_11_2<=p_37_0) states: 28,356,808,390,075,153,728,866,877,440 (28)
abstracting: (p_41_0<=p_41_0) states: 48,717,538,008,124,384,423,924,727,808 (28)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: EF [[p_40_2<=r_14_0 & [[2<=r_26_0 & 1<=p_27_1] & [2<=p_23_1 & r_17_0<=r_21_1]]]]
normalized: E [true U [p_40_2<=r_14_0 & [[2<=p_23_1 & r_17_0<=r_21_1] & [2<=r_26_0 & 1<=p_27_1]]]]

abstracting: (1<=p_27_1) states: 12,518,312,463,622,497,408,464,715,776 (28)
abstracting: (2<=r_26_0) states: 0
abstracting: (r_17_0<=r_21_1) states: 36,618,352,256,524,092,204,084,363,264 (28)
abstracting: (2<=p_23_1) states: 0
abstracting: (p_40_2<=r_14_0) states: 45,415,042,608,035,502,161,638,981,632 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AG [[p_39_2<=p_8_0 | [p_43_1<=r_35_1 | [2<=r_6_1 & p_27_2<=p_30_2]]]]
normalized: ~ [E [true U ~ [[p_39_2<=p_8_0 | [p_43_1<=r_35_1 | [2<=r_6_1 & p_27_2<=p_30_2]]]]]]

abstracting: (p_27_2<=p_30_2) states: 31,809,260,664,102,929,672,280,473,600 (28)
abstracting: (2<=r_6_1) states: 0
abstracting: (p_43_1<=r_35_1) states: 42,216,709,081,707,963,754,154,557,440 (28)
abstracting: (p_39_2<=p_8_0) states: 37,157,044,847,916,596,571,181,940,736 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.162sec

checking: EF [[[p_28_1<=r_26_2 & [p_18_2<=r_7_0 & 2<=p_45_2]] | [~ [p_12_2<=r_36_1] & 1<=p_37_1]]]
normalized: E [true U [[1<=p_37_1 & ~ [p_12_2<=r_36_1]] | [p_28_1<=r_26_2 & [p_18_2<=r_7_0 & 2<=p_45_2]]]]

abstracting: (2<=p_45_2) states: 0
abstracting: (p_18_2<=r_7_0) states: 45,406,577,259,230,067,915,090,821,120 (28)
abstracting: (p_28_1<=r_26_2) states: 42,333,298,906,799,830,533,618,532,352 (28)
abstracting: (p_12_2<=r_36_1) states: 45,434,546,724,716,397,074,873,057,280 (28)
abstracting: (1<=p_37_1) states: 12,522,936,677,166,565,244,956,311,552 (28)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.226sec

checking: AG [[[[r_36_2<=r_12_1 & 2<=r_39_0] | [1<=r_32_0 & r_49_1<=r_31_1]] | [~ [1<=r_40_1] | p_0_2<=p_48_0]]]
normalized: ~ [E [true U ~ [[[p_0_2<=p_48_0 | ~ [1<=r_40_1]] | [[r_36_2<=r_12_1 & 2<=r_39_0] | [1<=r_32_0 & r_49_1<=r_31_1]]]]]]

abstracting: (r_49_1<=r_31_1) states: 33,541,011,910,338,934,931,544,080,384 (28)
abstracting: (1<=r_32_0) states: 23,430,595,412,366,784,507,240,513,536 (28)
abstracting: (2<=r_39_0) states: 0
abstracting: (r_36_2<=r_12_1) states: 36,675,815,553,898,615,750,239,715,328 (28)
abstracting: (1<=r_40_1) states: 23,655,724,879,341,101,341,359,472,640 (28)
abstracting: (p_0_2<=p_48_0) states: 38,978,470,005,811,778,804,246,380,544 (28)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C050-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.261sec


Total processing time: 0m 7.241sec


BK_STOP 1464598596200

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

check for maximal unmarked siphon
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

1458
iterations count:1526 (7), effective:300 (1)

initing FirstDep: 0m 0.000sec


iterations count:263 (1), effective:10 (0)

iterations count:344 (1), effective:21 (0)

iterations count:372 (1), effective:27 (0)

iterations count:354 (1), effective:24 (0)

iterations count:353 (1), effective:23 (0)

iterations count:327 (1), effective:23 (0)

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_ResAllocation-PT-R003C050"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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_ResAllocation-PT-R003C050.tgz
mv S_ResAllocation-PT-R003C050 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is S_ResAllocation-PT-R003C050, 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 r185kn-smll-146444128600331"
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 ;