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-3254
Executing tool marcie
Input is S_ResAllocation-PT-R003C100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423900115
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495085073708

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: ResAllocation_PT_R003C100
(NrP: 600 NrTr: 400 NrArc: 1794)

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

net check time: 0m 0.000sec

init dd package: 0m 1.370sec


RS generation: 0m 0.158sec


-> reachability set: #nodes 2276 (2.3e+03) #states 1,419,511,971,601,939,502,357,423,537,093,994,181,923,624,388,856,767,315,968 (57)



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

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

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

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

MC time: 0m 0.002sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: EF [[3<=r_82_1 | ~ [~ [3<=p_63_1]]]]
normalized: E [true U [3<=r_82_1 | 3<=p_63_1]]

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

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

MC time: 0m 0.001sec

checking: AG [p_84_2<=r_2_0]
normalized: ~ [E [true U ~ [p_84_2<=r_2_0]]]

abstracting: (p_84_2<=r_2_0)
states: 1,321,083,146,711,953,182,925,869,168,008,299,842,734,512,203,272,162,377,728 (57)
-> the formula is FALSE

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

MC time: 0m 0.385sec

checking: AG [p_18_1<=r_85_0]
normalized: ~ [E [true U ~ [p_18_1<=r_85_0]]]

abstracting: (p_18_1<=r_85_0)
states: 1,230,190,729,002,845,749,973,722,852,887,503,666,928,383,540,355,561,160,704 (57)
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C100-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.453sec

checking: EF [[1<=p_6_2 | 3<=p_56_2]]
normalized: E [true U [1<=p_6_2 | 3<=p_56_2]]

abstracting: (3<=p_56_2)
states: 0
abstracting: (1<=p_6_2)
states: 190,137,465,533,559,217,590,733,810,143,465,733,208,610,458,347,713,331,200 (56)
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C100-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.567sec

checking: AG [~ [~ [[p_80_1<=r_47_1 | 2<=r_47_1]]]]
normalized: ~ [E [true U ~ [[p_80_1<=r_47_1 | 2<=r_47_1]]]]

abstracting: (2<=r_47_1)
states: 0
abstracting: (p_80_1<=r_47_1)
states: 1,232,061,214,801,648,591,420,956,110,485,299,372,515,901,855,036,715,565,056 (57)
-> the formula is FALSE

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

MC time: 0m 0.393sec

checking: EF [~ [[[3<=r_13_2 | 1<=r_45_0] | ~ [r_44_2<=p_32_2]]]]
normalized: E [true U ~ [[[3<=r_13_2 | 1<=r_45_0] | ~ [r_44_2<=p_32_2]]]]

abstracting: (r_44_2<=p_32_2)
states: 826,241,261,960,033,227,396,555,251,428,275,893,315,898,667,158,216,900,608 (56)
abstracting: (1<=r_45_0)
states: 682,715,450,820,474,988,332,760,544,512,160,715,061,228,824,861,144,514,560 (56)
abstracting: (3<=r_13_2)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R003C100-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.578sec

checking: AG [[r_26_1<=p_62_1 | p_9_2<=r_79_1]]
normalized: ~ [E [true U ~ [[r_26_1<=p_62_1 | p_9_2<=r_79_1]]]]

abstracting: (p_9_2<=r_79_1)
states: 1,136,765,854,483,224,328,423,878,750,851,366,454,197,507,407,713,279,148,032 (57)
abstracting: (r_26_1<=p_62_1)
states: 906,808,146,648,966,963,181,677,290,643,380,793,062,724,435,478,054,961,152 (56)
-> the formula is FALSE

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

MC time: 0m 0.519sec

checking: AG [[~ [p_99_0<=r_3_1] | [~ [1<=p_71_1] & p_29_0<=p_83_1]]]
normalized: ~ [E [true U ~ [[[~ [1<=p_71_1] & p_29_0<=p_83_1] | ~ [p_99_0<=r_3_1]]]]]

abstracting: (p_99_0<=r_3_1)
states: 1,212,185,575,681,052,700,971,938,682,230,184,112,228,198,039,116,069,208,064 (57)
abstracting: (p_29_0<=p_83_1)
states: 1,281,291,368,188,792,853,122,966,057,322,877,976,161,488,879,094,991,945,728 (57)
abstracting: (1<=p_71_1)
states: 364,753,278,387,159,405,231,928,557,384,328,107,023,090,214,346,573,217,792 (56)
-> the formula is FALSE

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

MC time: 0m 1.709sec

checking: EF [[[~ [1<=p_34_0] | 3<=p_76_1] & [~ [r_71_2<=p_18_1] & 2<=r_64_1]]]
normalized: E [true U [[~ [1<=p_34_0] | 3<=p_76_1] & [~ [r_71_2<=p_18_1] & 2<=r_64_1]]]

abstracting: (2<=r_64_1)
states: 0
abstracting: (r_71_2<=p_18_1)
states: 912,226,499,005,636,210,868,270,729,401,158,149,661,087,934,581,431,074,816 (56)
abstracting: (3<=p_76_1)
states: 0
abstracting: (1<=p_34_0)
states: 550,774,896,255,009,136,587,715,891,158,868,491,178,882,508,009,129,377,792 (56)
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: AG [[[[r_12_1<=p_60_0 | r_9_0<=p_53_0] | ~ [2<=p_89_0]] | ~ [[1<=p_85_0 | 1<=r_89_2]]]]
normalized: ~ [E [true U ~ [[[[r_12_1<=p_60_0 | r_9_0<=p_53_0] | ~ [2<=p_89_0]] | ~ [[1<=p_85_0 | 1<=r_89_2]]]]]]

abstracting: (1<=r_89_2)
states: 683,032,251,582,690,482,256,105,783,148,576,659,724,045,179,046,120,652,800 (56)
abstracting: (1<=p_85_0)
states: 186,050,608,319,685,883,510,650,587,827,683,022,995,170,733,370,325,860,352 (56)
abstracting: (2<=p_89_0)
states: 0
abstracting: (r_9_0<=p_53_0)
states: 825,988,488,993,823,052,196,907,374,861,845,318,273,886,785,280,942,276,608 (56)
abstracting: (r_12_1<=p_60_0)
states: 997,268,782,958,300,089,441,748,144,245,143,433,703,497,735,611,588,018,176 (56)
-> the formula is TRUE

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

MC time: 0m 0.012sec

checking: EF [[[[1<=p_72_0 | p_91_1<=r_45_2] & p_10_1<=r_8_1] & [~ [1<=p_94_2] & ~ [p_38_0<=r_34_1]]]]
normalized: E [true U [[~ [p_38_0<=r_34_1] & ~ [1<=p_94_2]] & [[1<=p_72_0 | p_91_1<=r_45_2] & p_10_1<=r_8_1]]]

abstracting: (p_10_1<=r_8_1)
states: 1,280,159,290,070,867,094,015,070,968,148,502,194,588,013,276,375,189,291,008 (57)
abstracting: (p_91_1<=r_45_2)
states: 1,229,358,632,898,704,564,368,318,863,590,231,846,615,244,816,840,063,451,136 (57)
abstracting: (1<=p_72_0)
states: 550,774,887,390,978,723,620,061,542,188,579,029,572,282,802,537,167,323,136 (56)
abstracting: (1<=p_94_2)
states: 178,668,961,338,385,993,314,216,832,825,782,384,440,096,337,425,980,194,816 (56)
abstracting: (p_38_0<=r_34_1)
states: 1,141,780,125,847,615,768,381,447,552,522,835,826,196,171,198,763,630,592,000 (57)

after gc: zbdd nodes used:36174, unused:18713826-> the formula is TRUE

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

MC time: 0m 1.611sec

checking: EF [[[[r_25_1<=p_88_1 & 3<=p_83_0] | [p_80_1<=p_61_0 & 2<=r_63_0]] & [~ [r_21_1<=p_91_2] | ~ [p_46_1<=r_49_0]]]]
normalized: E [true U [[[p_80_1<=p_61_0 & 2<=r_63_0] | [r_25_1<=p_88_1 & 3<=p_83_0]] & [~ [p_46_1<=r_49_0] | ~ [r_21_1<=p_91_2]]]]

abstracting: (r_21_1<=p_91_2)
states: 997,758,563,380,987,022,648,626,717,664,572,938,213,227,767,739,019,427,840 (56)
abstracting: (p_46_1<=r_49_0)
states: 1,237,947,611,039,355,230,687,206,361,837,927,100,286,585,971,610,574,913,536 (57)
abstracting: (3<=p_83_0)
states: 0
abstracting: (r_25_1<=p_88_1)
states: 906,686,385,323,863,313,651,931,875,325,817,388,958,614,207,974,667,714,560 (56)
abstracting: (2<=r_63_0)
states: 0
abstracting: (p_80_1<=p_61_0)
states: 1,102,558,971,932,275,265,675,104,512,366,980,940,139,442,961,240,096,243,712 (57)
-> the formula is FALSE

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

MC time: 0m 0.018sec

checking: AG [[[[2<=r_37_0 & r_67_2<=p_46_2] | ~ [p_45_1<=r_21_1]] | [[r_36_0<=p_61_1 | 1<=p_26_0] | ~ [r_10_1<=p_46_2]]]]
normalized: ~ [E [true U ~ [[[[r_36_0<=p_61_1 | 1<=p_26_0] | ~ [r_10_1<=p_46_2]] | [~ [p_45_1<=r_21_1] | [2<=r_37_0 & r_67_2<=p_46_2]]]]]]

abstracting: (r_67_2<=p_46_2)
states: 826,263,841,049,583,492,678,553,682,609,659,404,076,376,073,405,743,497,216 (56)
abstracting: (2<=r_37_0)
states: 0
abstracting: (p_45_1<=r_21_1)
states: 1,232,060,399,757,608,784,346,880,291,933,154,565,923,699,522,886,889,897,984 (57)
abstracting: (r_10_1<=p_46_2)
states: 820,114,942,560,195,280,586,528,500,562,408,848,804,400,995,334,944,194,560 (56)
abstracting: (1<=p_26_0)
states: 550,774,912,363,691,299,442,970,696,095,881,754,758,963,951,746,146,107,392 (56)
abstracting: (r_36_0<=p_61_1)
states: 912,224,888,497,162,063,664,983,384,214,647,029,036,727,694,249,101,885,440 (56)
-> the formula is FALSE

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

MC time: 0m 1.014sec

totally nodes used: 13019134(1.3e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 2144690 7569028 9713718
used/not used/entry size/cache size: 2018414 65090450 16 1024MB
basic ops cache: hits/miss/sum: 4231228 14236911 18468139
used/not used/entry size/cache size: 7551084 9226132 12 192MB
unary ops cache: hits/miss/sum: 0 44850 44850
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 15056 48943 63999
used/not used/entry size/cache size: 15454 2081698 32 64MB
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 63517833
1 3503049
2 86694
3 1281
4 7
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 9.775sec


BK_STOP 1495085083514

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


initing FirstDep: 0m 0.001sec


iterations count:3051 (7), effective:600 (1)

initing FirstDep: 0m 0.001sec


iterations count:506 (1), effective:17 (0)

iterations count:521 (1), effective:19 (0)

iterations count:499 (1), effective:15 (0)

iterations count:513 (1), effective:18 (0)

iterations count:636 (1), effective:37 (0)

iterations count:525 (1), effective:19 (0)

iterations count:606 (1), effective:30 (0)

iterations count:561 (1), effective:25 (0)

iterations count:667 (1), effective:40 (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-R003C100"
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_ResAllocation-PT-R003C100.tgz
mv S_ResAllocation-PT-R003C100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is S_ResAllocation-PT-R003C100, 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 r141-csrt-149443423900115"
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 ;