About the Execution of MARCIE for S_PaceMaker-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7905.960 | 25480.00 | 25000.00 | 19.80 | TTFFFTFTTTFTTTTT | normal |
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_PaceMaker-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r111-blw7-149441637100304
=====================================================================
--------------------
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 PaceMaker-PT-none-ReachabilityCardinality-0
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-1
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-10
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-11
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-12
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-13
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-14
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-15
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-2
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-3
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-4
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-5
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-6
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-7
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-8
FORMULA_NAME PaceMaker-PT-none-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494786427724
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: PaceMaker_PT_none
(NrP: 70 NrTr: 164 NrArc: 954)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec
net check time: 0m 0.000sec
init dd package: 0m 1.121sec
parse successfull
net created successfully
Net: PaceMaker_PT_none
(NrP: 70 NrTr: 164 NrArc: 954)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.763sec
RS generation: 0m 0.794sec
-> reachability set: #nodes 776 (7.8e+02) #states 368,026,085,700,403,200 (17)
starting MCC model checker
--------------------------
checking: AG [1<=SANode]
normalized: ~ [E [true U ~ [1<=SANode]]]
abstracting: (1<=SANode)
states: 368,026,085,700,403,200 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [3<=A_VtrNoiseGenerator]
normalized: ~ [E [true U ~ [3<=A_VtrNoiseGenerator]]]
abstracting: (3<=A_VtrNoiseGenerator)
states: 368,026,085,700,403,200 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [1<=A_VRP]
normalized: ~ [E [true U ~ [1<=A_VRP]]]
abstracting: (1<=A_VRP)
states: 368,026,085,700,403,200 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [2<=A_SIG_VS]
normalized: E [true U 2<=A_SIG_VS]
abstracting: (2<=A_SIG_VS)
states: 0
-> the formula is FALSE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [A_SIG_Clk0<=SIG_VP]
normalized: E [true U A_SIG_Clk0<=SIG_VP]
abstracting: (A_SIG_Clk0<=SIG_VP)
states: 276,019,564,275,302,400 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.798sec
checking: AG [AVJOut<=URI]
normalized: ~ [E [true U ~ [AVJOut<=URI]]]
abstracting: (AVJOut<=URI)
states: 279,093,929,154,969,600 (17)
-> the formula is FALSE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.087sec
checking: AG [RVConductor<=A_SANodeEctopic]
normalized: ~ [E [true U ~ [RVConductor<=A_SANodeEctopic]]]
abstracting: (RVConductor<=A_SANodeEctopic)
states: 297,650,554,719,436,800 (17)
-> the formula is FALSE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.899sec
checking: AG [AVJOut<=A_AtrNoiseGenerator]
normalized: ~ [E [true U ~ [AVJOut<=A_AtrNoiseGenerator]]]
abstracting: (AVJOut<=A_AtrNoiseGenerator)
states: 301,326,968,291,328,000 (17)
-> the formula is FALSE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.125sec
checking: AG [[A_RAConductor<=AVJ | 2<=SANode]]
normalized: ~ [E [true U ~ [[A_RAConductor<=AVJ | 2<=SANode]]]]
abstracting: (2<=SANode)
states: 368,026,085,700,403,200 (17)
abstracting: (A_RAConductor<=AVJ)
states: 138,245,956,750,540,800 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.067sec
checking: AG [~ [~ [[A_VtrNoiseGenerator<=URIState | 2<=RAConductor]]]]
normalized: ~ [E [true U ~ [[A_VtrNoiseGenerator<=URIState | 2<=RAConductor]]]]
abstracting: (2<=RAConductor)
states: 368,026,085,700,403,200 (17)
abstracting: (A_VtrNoiseGenerator<=URIState)
states: 286,242,511,100,313,600 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.084sec
checking: AG [[[1<=A_VRP & 2<=A_Atrium] | SIG_Vbeat<=RAConductor]]
normalized: ~ [E [true U ~ [[SIG_Vbeat<=RAConductor | [1<=A_VRP & 2<=A_Atrium]]]]]
abstracting: (2<=A_Atrium)
states: 368,026,085,700,403,200 (17)
abstracting: (1<=A_VRP)
states: 368,026,085,700,403,200 (17)
abstracting: (SIG_Vbeat<=RAConductor)
states: 368,026,085,700,403,200 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.036sec
checking: AG [~ [[[VRP<=SIG_VPOut | 3<=A_RAConductor] & [2<=SIG_VP & 2<=A_SIG_AS]]]]
normalized: ~ [E [true U [[2<=SIG_VP & 2<=A_SIG_AS] & [VRP<=SIG_VPOut | 3<=A_RAConductor]]]]
abstracting: (3<=A_RAConductor)
states: 368,026,085,700,403,200 (17)
abstracting: (VRP<=SIG_VPOut)
states: 0
abstracting: (2<=A_SIG_AS)
states: 0
abstracting: (2<=SIG_VP)
states: 0
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.949sec
checking: AG [~ [[[3<=SIG_IncrClk | A_RVConductor<=A_SIG_AS] & [A_SIG_AgetOut<=A_AVJOut | 2<=A_SANodeEctopic]]]]
normalized: ~ [E [true U [[A_SIG_AgetOut<=A_AVJOut | 2<=A_SANodeEctopic] & [3<=SIG_IncrClk | A_RVConductor<=A_SIG_AS]]]]
abstracting: (A_RVConductor<=A_SIG_AS)
states: 0
abstracting: (3<=SIG_IncrClk)
states: 0
abstracting: (2<=A_SANodeEctopic)
states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_AgetOut<=A_AVJOut)
states: 368,026,085,700,403,200 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.916sec
checking: EF [[A_SIG_Clk0<=A_SANodeEctopic & [[VtrNoiseGenerator<=A_AVI & VRG<=A_RAConductor] & ~ [1<=SANodeEctopic]]]]
normalized: E [true U [A_SIG_Clk0<=A_SANodeEctopic & [~ [1<=SANodeEctopic] & [VtrNoiseGenerator<=A_AVI & VRG<=A_RAConductor]]]]
abstracting: (VRG<=A_RAConductor)
states: 153,212,555,781,734,400 (17)
abstracting: (VtrNoiseGenerator<=A_AVI)
states: 61,337,680,950,067,200 (16)
abstracting: (1<=SANodeEctopic)
states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_Clk0<=A_SANodeEctopic)
states: 368,026,085,700,403,200 (17)
-> the formula is FALSE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.387sec
checking: AG [[[A_SIG_AP<=A_AtrNoiseGenerator & 3<=A_SIG_State] | [[1<=A_SIG_NextVtrBeat | VRGEctopic<=VRGEctopic] | 1<=A_SIG_NextVtrBeat]]]
normalized: ~ [E [true U ~ [[[1<=A_SIG_NextVtrBeat | [1<=A_SIG_NextVtrBeat | VRGEctopic<=VRGEctopic]] | [A_SIG_AP<=A_AtrNoiseGenerator & 3<=A_SIG_State]]]]]
abstracting: (3<=A_SIG_State)
states: 0
abstracting: (A_SIG_AP<=A_AtrNoiseGenerator)
states: 368,026,085,700,403,200 (17)
abstracting: (VRGEctopic<=VRGEctopic)
states: 368,026,085,700,403,200 (17)
abstracting: (1<=A_SIG_NextVtrBeat)
states: 184,079,839,710,412,800 (17)
abstracting: (1<=A_SIG_NextVtrBeat)
states: 184,079,839,710,412,800 (17)
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.081sec
checking: AG [[[SIG_AS<=A_AVJOut & [A_SIG_AP<=A_AVJOut & A_SIG_APOut<=A_Atrium]] & [[2<=A_URI & A_SIG_IncrClk<=AVJOut] | [AVJ<=A_SIG_VP & 2<=A_VRG]]]]
normalized: ~ [E [true U ~ [[[[AVJ<=A_SIG_VP & 2<=A_VRG] | [2<=A_URI & A_SIG_IncrClk<=AVJOut]] & [SIG_AS<=A_AVJOut & [A_SIG_AP<=A_AVJOut & A_SIG_APOut<=A_Atrium]]]]]]
abstracting: (A_SIG_APOut<=A_Atrium)
states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_AP<=A_AVJOut)
states: 368,026,085,700,403,200 (17)
abstracting: (SIG_AS<=A_AVJOut)
states: 368,026,085,700,403,200 (17)
abstracting: (A_SIG_IncrClk<=AVJOut)
states: 368,026,085,700,403,200 (17)
abstracting: (2<=A_URI)
states: 368,026,085,700,403,200 (17)
abstracting: (2<=A_VRG)
states: 368,026,085,700,403,200 (17)
abstracting: (AVJ<=A_SIG_VP)
states: 0
-> the formula is TRUE
FORMULA PaceMaker-PT-none-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.050sec
totally nodes used: 3140174 (3.1e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2906139 3363005 6269144
used/not used/entry size/cache size: 3940456 63168408 16 1024MB
basic ops cache: hits/miss/sum: 824132 3170476 3994608
used/not used/entry size/cache size: 5834404 10942812 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: 3749 4264 8013
used/not used/entry size/cache size: 4263 8384345 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 66313573
1 777437
2 12054
3 1301
4 479
5 305
6 145
7 159
8 75
9 112
>= 10 3224
Total processing time: 0m25.368sec
BK_STOP 1494786453204
--------------------
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.000sec
iterations count:22234 (135), effective:1515 (9)
initing FirstDep: 0m 0.000sec
iterations count:2165 (13), effective:46 (0)
iterations count:5159 (31), effective:279 (1)
iterations count:7276 (44), effective:594 (3)
iterations count:5151 (31), effective:278 (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_PaceMaker-PT-none"
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_PaceMaker-PT-none.tgz
mv S_PaceMaker-PT-none 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_PaceMaker-PT-none, 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 r111-blw7-149441637100304"
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 '
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 ;