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 ResAllocation-PT-R100C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r061-csrt-149440955200124
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494705881980

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_R100C002
(NrP: 400 NrTr: 202 NrArc: 1000)

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

net check time: 0m 0.000sec

init dd package: 0m 1.242sec


RS generation: 0m 1.601sec


-> reachability set: #nodes 605 (6.0e+02) #states 64,650,180,611,639,699,476,331,863,474,176 (31)



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

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

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

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [1<=r_1_30]
normalized: ~ [E [true U ~ [1<=r_1_30]]]

abstracting: (1<=r_1_30)
states: 54,508,975,809,813,864,264,358,237,831,168 (31)
-> the formula is FALSE

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

MC time: 0m 1.459sec

checking: EF [~ [~ [~ [r_1_58<=r_0_59]]]]
normalized: E [true U ~ [r_1_58<=r_0_59]]

abstracting: (r_1_58<=r_0_59)
states: 41,515,557,157,474,512,899,017,029,976,064 (31)
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.683sec

checking: EF [[1<=p_1_3 | ~ [~ [2<=r_1_68]]]]
normalized: E [true U [1<=p_1_3 | 2<=r_1_68]]

abstracting: (2<=r_1_68)
states: 0
abstracting: (1<=p_1_3)
states: 1,584,563,250,285,286,751,870,879,006,720 (30)
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.027sec

checking: AG [~ [r_1_69<=p_1_54]]
normalized: ~ [E [true U r_1_69<=p_1_54]]

abstracting: (r_1_69<=p_1_54)
states: 31,374,352,355,648,677,687,043,404,333,056 (31)
-> the formula is FALSE

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

MC time: 0m 0.468sec

checking: EF [r_0_62<=p_0_58]
normalized: E [true U r_0_62<=p_0_58]

abstracting: (r_0_62<=p_0_58)
states: 39,297,168,607,075,111,446,397,799,366,656 (31)
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.591sec

checking: AG [p_1_51<=r_1_89]
normalized: ~ [E [true U ~ [p_1_51<=r_1_89]]]

abstracting: (p_1_51<=r_1_89)
states: 56,251,995,385,127,679,691,416,204,738,560 (31)
-> the formula is FALSE

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

MC time: 0m 0.806sec

checking: EF [r_0_59<=p_1_34]
normalized: E [true U r_0_59<=p_1_34]

abstracting: (r_0_59<=p_1_34)
states: 38,346,430,656,903,939,395,275,271,962,624 (31)

after gc: zbdd nodes used:3556, unused:18746444-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.318sec

checking: AG [~ [[3<=p_0_78 & [3<=r_0_75 | 3<=r_0_87]]]]
normalized: ~ [E [true U [[3<=r_0_75 | 3<=r_0_87] & 3<=p_0_78]]]

abstracting: (3<=p_0_78)
states: 0
abstracting: (3<=r_0_87)
states: 0
abstracting: (3<=r_0_75)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[2<=p_0_25 | p_0_20<=p_0_75]]
normalized: ~ [E [true U ~ [[2<=p_0_25 | p_0_20<=p_0_75]]]]

abstracting: (p_0_20<=p_0_75)
states: 43,100,120,407,759,799,650,887,908,982,784 (31)
abstracting: (2<=p_0_25)
states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: AG [~ [[~ [2<=r_0_0] & [1<=r_1_46 & 2<=r_1_42]]]]
normalized: ~ [E [true U [[1<=r_1_46 & 2<=r_1_42] & ~ [2<=r_0_0]]]]

abstracting: (2<=r_0_0)
states: 0
abstracting: (2<=r_1_42)
states: 0
abstracting: (1<=r_1_46)
states: 49,438,373,408,900,946,658,371,425,009,664 (31)
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [[3<=r_0_75 & ~ [[p_0_8<=p_0_25 | r_1_69<=r_0_18]]]]
normalized: E [true U [3<=r_0_75 & ~ [[p_0_8<=p_0_25 | r_1_69<=r_0_18]]]]

abstracting: (r_1_69<=r_0_18)
states: 43,417,033,057,816,857,001,262,084,784,128 (31)
abstracting: (p_0_8<=p_0_25)
states: 47,219,984,858,501,545,205,752,194,400,256 (31)
abstracting: (3<=r_0_75)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[[~ [p_1_42<=r_0_3] & [2<=r_0_62 | 1<=p_0_5]] & ~ [[3<=r_0_75 & r_0_6<=r_1_49]]]]
normalized: E [true U [~ [[3<=r_0_75 & r_0_6<=r_1_49]] & [[2<=r_0_62 | 1<=p_0_5] & ~ [p_1_42<=r_0_3]]]]

abstracting: (p_1_42<=r_0_3)
states: 57,519,645,985,355,909,092,912,907,943,936 (31)
abstracting: (1<=p_0_5)
states: 30,423,614,405,477,505,635,920,876,929,024 (31)
abstracting: (2<=r_0_62)
states: 0
abstracting: (r_0_6<=r_1_49)
states: 56,727,364,360,213,265,716,977,468,440,576 (31)
abstracting: (3<=r_0_75)
states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.072sec

checking: AG [[p_0_54<=r_0_13 | [[1<=r_0_21 | p_0_14<=r_0_58] | [r_1_40<=r_0_80 & p_0_88<=p_0_2]]]]
normalized: ~ [E [true U ~ [[[[r_1_40<=r_0_80 & p_0_88<=p_0_2] | [1<=r_0_21 | p_0_14<=r_0_58]] | p_0_54<=r_0_13]]]]

abstracting: (p_0_54<=r_0_13)
states: 57,202,733,335,298,851,742,538,732,142,592 (31)
abstracting: (p_0_14<=r_0_58)
states: 50,706,024,009,129,176,059,868,128,215,040 (31)
abstracting: (1<=r_0_21)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p_0_88<=p_0_2)
states: 62,590,248,386,268,826,698,899,720,765,440 (31)
abstracting: (r_1_40<=r_0_80)
states: 38,663,343,306,960,996,745,649,447,763,968 (31)
-> the formula is FALSE

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

MC time: 0m 1.736sec

checking: AG [[[[r_0_45<=r_0_88 & p_1_76<=r_1_40] & ~ [r_1_68<=p_1_27]] | [p_0_77<=p_0_31 | 1<=p_1_6]]]
normalized: ~ [E [true U ~ [[[p_0_77<=p_0_31 | 1<=p_1_6] | [[r_0_45<=r_0_88 & p_1_76<=r_1_40] & ~ [r_1_68<=p_1_27]]]]]]

abstracting: (r_1_68<=p_1_27)
states: 26,779,118,929,821,346,106,617,855,213,568 (31)
abstracting: (p_1_76<=r_1_40)
states: 57,995,014,960,441,495,118,474,171,645,952 (31)
abstracting: (r_0_45<=r_0_88)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
abstracting: (1<=p_1_6)
states: 2,535,301,200,456,458,802,993,406,410,752 (30)
abstracting: (p_0_77<=p_0_31)
states: 60,847,228,810,955,011,271,841,753,858,048 (31)
-> the formula is FALSE

FORMULA ResAllocation-PT-R100C002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.288sec

checking: AG [[[~ [r_0_46<=p_1_94] | [p_1_52<=r_1_22 | r_1_13<=p_0_15]] & [[r_0_38<=r_0_77 | 1<=p_0_51] | ~ [1<=r_1_76]]]]
normalized: ~ [E [true U ~ [[[[p_1_52<=r_1_22 | r_1_13<=p_0_15] | ~ [r_0_46<=p_1_94]] & [[r_0_38<=r_0_77 | 1<=p_0_51] | ~ [1<=r_1_76]]]]]]

abstracting: (1<=r_1_76)
states: 39,930,993,907,189,226,147,146,150,969,344 (31)
abstracting: (1<=p_0_51)
states: 15,845,632,502,852,867,518,708,790,067,200 (31)
abstracting: (r_0_38<=r_0_77)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
abstracting: (r_0_46<=p_1_94)
states: 47,695,353,833,587,131,231,313,458,102,272 (31)
abstracting: (r_1_13<=p_0_15)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p_1_52<=r_1_22)
states: 60,847,228,810,955,011,271,841,753,858,048 (31)
-> the formula is FALSE

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

MC time: 0m 0.646sec

totally nodes used: 17815621(1.8e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 7499001 14283308 21782309
used/not used/entry size/cache size: 5857433 61251431 16 1024MB
basic ops cache: hits/miss/sum: 10220223 24414398 34634621
used/not used/entry size/cache size: 13413000 3364216 12 192MB
unary ops cache: hits/miss/sum: 0 19900 19900
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: 4822 9552 14374
used/not used/entry size/cache size: 6838 2090314 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 59271433
1 7263925
2 541721
3 30376
4 1365
5 42
6 2
7 0
8 0
9 0
>= 10 0

Total processing time: 0m15.064sec


BK_STOP 1494705897068

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


iterations count:35849 (177), effective:10100 (50)

initing FirstDep: 0m 0.000sec


iterations count:10074 (49), effective:2555 (12)

iterations count:3864 (19), effective:980 (4)

iterations count:19119 (94), effective:4850 (24)

iterations count:2157 (10), effective:527 (2)

iterations count:3231 (15), effective:803 (3)

iterations count:5090 (25), effective:1285 (6)

iterations count:3688 (18), effective:921 (4)

iterations count:1055 (5), effective:277 (1)

iterations count:7089 (35), effective:1800 (8)

iterations count:9939 (49), effective:2906 (14)

iterations count:10767 (53), effective:3446 (17)

iterations count:2417 (11), effective:620 (3)

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="ResAllocation-PT-R100C002"
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/ResAllocation-PT-R100C002.tgz
mv ResAllocation-PT-R100C002 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 ResAllocation-PT-R100C002, 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 r061-csrt-149440955200124"
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 ;