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-R100C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r141-csrt-149443423900120
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495085077908

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=CTLCardinality.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.413sec


RS generation: 0m 1.584sec


-> 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: ~ [EX [EF [2<=r_1_55]]]
normalized: ~ [EX [E [true U 2<=r_1_55]]]

abstracting: (2<=r_1_55)
states: 0
.-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EX [EG [~ [3<=r_1_79]]]
normalized: EX [EG [~ [3<=r_1_79]]]

abstracting: (3<=r_1_79)
states: 0

EG iterations: 0
.-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: EX [AG [r_0_85<=r_1_10]]
normalized: EX [~ [E [true U ~ [r_0_85<=r_1_10]]]]

abstracting: (r_0_85<=r_1_10)
states: 62,748,704,711,297,355,374,086,808,666,112 (31)
.-> the formula is FALSE

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

MC time: 0m 2.144sec

checking: EG [[AG [p_0_96<=r_1_49] | 1<=p_0_0]]
normalized: EG [[~ [E [true U ~ [p_0_96<=r_1_49]]] | 1<=p_0_0]]

abstracting: (1<=p_0_0)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (p_0_96<=r_1_49)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EG [AG [[2<=p_0_88 | r_0_73<=r_1_70]]]
normalized: EG [~ [E [true U ~ [[2<=p_0_88 | r_0_73<=r_1_70]]]]]

abstracting: (r_0_73<=r_1_70)
states: 53,241,325,209,585,634,862,861,534,625,792 (31)
abstracting: (2<=p_0_88)
states: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.549sec

checking: AF [[~ [2<=p_1_68] & [[1<=p_1_52 & 1<=p_0_92] & 3<=r_0_18]]]
normalized: ~ [EG [~ [[[[1<=p_1_52 & 1<=p_0_92] & 3<=r_0_18] & ~ [2<=p_1_68]]]]]

abstracting: (2<=p_1_68)
states: 0
abstracting: (3<=r_0_18)
states: 0
abstracting: (1<=p_0_92)
states: 2,852,213,850,513,516,153,367,582,212,096 (30)
abstracting: (1<=p_1_52)
states: 17,113,283,103,081,096,920,205,493,272,576 (31)

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [[3<=r_0_94 | EF [r_1_78<=r_0_76]] & EG [1<=r_1_22]]
normalized: [EG [1<=r_1_22] & [E [true U r_1_78<=r_0_76] | 3<=r_0_94]]

abstracting: (3<=r_0_94)
states: 0
abstracting: (r_1_78<=r_0_76)
states: 44,843,139,983,073,615,077,945,875,890,176 (31)
abstracting: (1<=r_1_22)
states: 57,044,277,010,270,323,067,351,644,241,920 (31)
............................
after gc: zbdd nodes used:59274, unused:18690726.................................
after gc: zbdd nodes used:195437, unused:37304563.................................
after gc: zbdd nodes used:313097, unused:74686903.........................................................
after gc: zbdd nodes used:412244, unused:149587756........................................................................................MC time: 6m 0.015sec

checking: AF [[r_1_56<=p_0_13 & ~ [[3<=p_0_7 | 2<=r_0_38]]]]
normalized: ~ [EG [~ [[~ [[3<=p_0_7 | 2<=r_0_38]] & r_1_56<=p_0_13]]]]

abstracting: (r_1_56<=p_0_13)
states: 39,297,168,607,075,111,446,397,799,366,656 (31)
abstracting: (2<=r_0_38)
states: 0
abstracting: (3<=p_0_7)
states: 0
...........................
after gc: zbdd nodes used:726584, unused:299273416........MC time: 5m24.086sec

checking: EF [[[[3<=r_1_50 | r_0_97<=r_0_81] & 2<=r_1_54] | AX [3<=r_0_80]]]
normalized: E [true U [~ [EX [~ [3<=r_0_80]]] | [[3<=r_1_50 | r_0_97<=r_0_81] & 2<=r_1_54]]]

abstracting: (2<=r_1_54)
states: 0
abstracting: (r_0_97<=r_0_81)
states: 48,487,635,458,729,774,607,248,897,605,632 (31)
abstracting: (3<=r_1_50)
states: 0
abstracting: (3<=r_0_80)
states: 0
.-> the formula is TRUE

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

MC time: 0m52.220sec

checking: AG [[EG [r_1_25<=r_0_78] | [1<=r_1_7 & [1<=p_1_3 & 3<=r_0_69]]]]
normalized: ~ [E [true U ~ [[[[1<=p_1_3 & 3<=r_0_69] & 1<=r_1_7] | EG [r_1_25<=r_0_78]]]]]

abstracting: (r_1_25<=r_0_78)
states: 36,286,498,431,533,066,617,843,129,253,888 (31)
....................................................................MC time: 5m18.027sec

checking: ~ [[~ [AF [2<=r_0_46]] & ~ [[[r_1_60<=r_0_70 & 3<=r_1_26] | ~ [p_1_22<=p_1_32]]]]]
normalized: ~ [[EG [~ [2<=r_0_46]] & ~ [[~ [p_1_22<=p_1_32] | [r_1_60<=r_0_70 & 3<=r_1_26]]]]]

abstracting: (3<=r_1_26)
states: 0
abstracting: (r_1_60<=r_0_70)
states: 41,832,469,807,531,570,249,391,205,777,408 (31)
abstracting: (p_1_22<=p_1_32)
states: 60,847,228,810,955,011,271,841,753,858,048 (31)
abstracting: (2<=r_0_46)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.006sec

checking: A [[[p_0_3<=r_0_87 | r_0_63<=r_1_23] | 3<=p_0_67] U ~ [1<=r_0_23]]
normalized: [~ [EG [1<=r_0_23]] & ~ [E [1<=r_0_23 U [~ [[[p_0_3<=r_0_87 | r_0_63<=r_1_23] | 3<=p_0_67]] & 1<=r_0_23]]]]

abstracting: (1<=r_0_23)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (3<=p_0_67)
states: 0
abstracting: (r_0_63<=r_1_23)
states: 60,688,772,485,926,482,596,654,665,957,376 (31)
abstracting: (p_0_3<=r_0_87)
states: 48,963,004,433,815,360,632,810,161,307,648 (31)
abstracting: (1<=r_0_23)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
abstracting: (1<=r_0_23)
states: 32,008,177,655,762,792,387,791,755,935,744 (31)
..................................................MC time: 5m18.201sec

checking: A [r_0_78<=r_1_59 U [[p_0_85<=r_1_53 | 2<=p_1_63] & ~ [p_1_1<=r_0_82]]]
normalized: [~ [E [~ [[~ [p_1_1<=r_0_82] & [p_0_85<=r_1_53 | 2<=p_1_63]]] U [~ [[~ [p_1_1<=r_0_82] & [p_0_85<=r_1_53 | 2<=p_1_63]]] & ~ [r_0_78<=r_1_59]]]] & ~ [EG [~ [[~ [p_1_1<=r_0_82] & [p_0_85<=r_1_53 | 2<=p_1_63]]]]]]

abstracting: (2<=p_1_63)
states: 0
abstracting: (p_0_85<=r_1_53)
states: 64,650,180,611,639,699,476,331,863,474,176 (31)
abstracting: (p_1_1<=r_0_82)
states: 64,174,811,636,554,113,450,770,599,772,160 (31)
........................................................................................MC time: 4m38.121sec

checking: [EG [EF [1<=p_0_26]] & E [[p_0_21<=r_1_97 & p_0_69<=p_0_82] U [r_1_49<=p_0_9 & r_0_71<=p_0_27]]]
normalized: [E [[p_0_21<=r_1_97 & p_0_69<=p_0_82] U [r_1_49<=p_0_9 & r_0_71<=p_0_27]] & EG [E [true U 1<=p_0_26]]]

abstracting: (1<=p_0_26)
states: 23,768,448,754,279,301,278,063,185,100,800 (31)
.
EG iterations: 1
abstracting: (r_0_71<=p_0_27)
states: 44,209,314,682,959,500,377,197,524,287,488 (31)
abstracting: (r_1_49<=p_0_9)
states: 38,821,799,631,989,525,420,836,535,664,640 (31)
abstracting: (p_0_69<=p_0_82)
states: 57,519,645,985,355,909,092,912,907,943,936 (31)
abstracting: (p_0_21<=r_1_97)
states: 52,449,043,584,442,991,486,926,095,122,432 (31)
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.561sec

checking: [~ [[AG [r_1_71<=p_1_33] | [[r_1_4<=p_0_49 & 3<=p_0_72] & [p_1_1<=p_0_12 & p_0_18<=r_1_47]]]] & EX [EF [3<=r_0_26]]]
normalized: [~ [[[[p_1_1<=p_0_12 & p_0_18<=r_1_47] & [r_1_4<=p_0_49 & 3<=p_0_72]] | ~ [E [true U ~ [r_1_71<=p_1_33]]]]] & EX [E [true U 3<=r_0_26]]]

abstracting: (3<=r_0_26)
states: 0
.abstracting: (r_1_71<=p_1_33)
states: 28,680,594,830,163,690,208,862,910,021,632 (31)
abstracting: (3<=p_0_72)
states: 0
abstracting: (r_1_4<=p_0_49)
states: 18,380,933,703,309,326,321,702,196,477,952 (31)
abstracting: (p_0_18<=r_1_47)
states: 59,896,490,860,783,839,220,719,226,454,016 (31)
abstracting: (p_1_1<=p_0_12)
states: 63,699,442,661,468,527,425,209,336,070,144 (31)
-> the formula is FALSE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.238sec

checking: [[[[r_1_91<=p_1_4 | 1<=p_1_33] | EF [r_0_76<=p_0_97]] | ~ [[[r_1_12<=r_1_4 | 3<=r_0_30] | [p_0_1<=r_0_16 | p_0_59<=r_0_38]]]] | [p_0_17<=r_0_57 & 3<=r_0_2]]
normalized: [[p_0_17<=r_0_57 & 3<=r_0_2] | [[E [true U r_0_76<=p_0_97] | [r_1_91<=p_1_4 | 1<=p_1_33]] | ~ [[[r_1_12<=r_1_4 | 3<=r_0_30] | [p_0_1<=r_0_16 | p_0_59<=r_0_38]]]]]

abstracting: (p_0_59<=r_0_38)
states: 57,995,014,960,441,495,118,474,171,645,952 (31)
abstracting: (p_0_1<=r_0_16)
states: 48,646,091,783,758,303,282,435,985,506,304 (31)
abstracting: (3<=r_0_30)
states: 0
abstracting: (r_1_12<=r_1_4)
states: 63,699,442,661,468,527,425,209,336,070,144 (31)
abstracting: (1<=p_1_33)
states: 11,091,942,751,997,007,263,096,153,047,040 (31)
abstracting: (r_1_91<=p_1_4)
states: 30,423,614,405,477,505,635,920,876,929,024 (31)
abstracting: (r_0_76<=p_0_97)
states: 33,275,828,255,991,021,789,288,459,141,120 (31)
abstracting: (3<=r_0_2)
states: 0
abstracting: (p_0_17<=r_0_57)
states: 51,181,392,984,214,762,085,429,391,917,056 (31)
-> the formula is TRUE

FORMULA ResAllocation-PT-R100C002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.331sec

checking: [[3<=r_0_94 | EF [r_1_78<=r_0_76]] & EG [1<=r_1_22]]
normalized: [EG [1<=r_1_22] & [E [true U r_1_78<=r_0_76] | 3<=r_0_94]]

abstracting: (3<=r_0_94)
states: 0
abstracting: (r_1_78<=r_0_76)
states: 44,843,139,983,073,615,077,945,875,890,176 (31)

BK_TIME_CONFINEMENT_REACHED

--------------------
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:16748 (82), effective:4270 (21)

iterations count:2252 (11), effective:568 (2)

iterations count:1283 (6), effective:297 (1)

net_ddint.h:596: Timeout: after 359 sec


net_ddint.h:596: Timeout: after 323 sec

817 915 1031 1051 1159 1087
iterations count:662149 (3277), effective:171503 (849)

net_ddint.h:596: Timeout: after 317 sec


net_ddint.h:596: Timeout: after 317 sec


net_ddint.h:596: Timeout: after 277 sec


iterations count:1418 (7), effective:405 (2)

iterations count:5180 (25), effective:1321 (6)

iterations count:518 (2), effective:106 (0)

iterations count:669 (3), effective:124 (0)

iterations count:1283 (6), effective:297 (1)

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-R100C002"
export BK_EXAMINATION="CTLCardinality"
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-R100C002.tgz
mv S_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 S_ResAllocation-PT-R100C002, examination is CTLCardinality"
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-149443423900120"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;