Introduction
This page shows the outputs produced by the execution of marcie on SimpleLoadBal/05 (P/T). We provide:
- A short summary,
- the execution chart (evolution of CPU and memory over the execution),
- the sequence of actions to be executed by the VM,
- the results of these actions.
About the Execution
Execution Summary | |||
Memory (MB) | CPU (s) | End | |
667.08 | 1.05 | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
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.
export BK_INPUT=SimpleLoadBal-PT-05
export BK_EXAMINATION=ReachabilityMarkingComparison
export BK_TOOL=marcie
export BK_RESULT_DIR=/tmp
export BK_LOG_FILE=/tmp/BenchKit_head_log_file.1661
export BIN_DIR=/home/mcc/BenchKit/bin
cd /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-05
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is SimpleLoadBal-PT-05, examination is ReachabilityMarkingComparison'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo
bash /home/mcc/BenchKit/BenchKit_head.sh
Execution Outputs of marcie for SimpleLoadBal/05 (P/T)
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
execution on node 38: cluster1u40.lip6.fr (runId=136983930001185_n_38)
=====================================================================
runnning marcie on SimpleLoadBal-PT-05 (ReachabilityMarkingComparison)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is SimpleLoadBal-PT-05, examination is ReachabilityMarkingComparison
=====================================================================
--------------------
content from stdout:
START 1369877682
Marcie rev. 1103M (build: rohrch on 2013-02-17)
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 --mem=4 --mcc-file=ReachabilityMarkingComparison.txt
constant oo registered with value < INFINITY >
parse successfull!
(NrP: 59 NrTr: 180)
net check time: 0m0sec
parse mcc successfull!
place and transition orderings generation:0m0sec
init dd package: 0m1sec
RS generation: 0m0sec
-> reachability set: #nodes 8102 (8.1e+03) #states 116,176 (5)
starting CTL model checker
--------------------------
checking: AG [[[server_notification_2!=0.000000000000000 & [1.000000000000000!=server_notification_1 & true]] & [server_notification_1=0.000000000000000 & [1.000000000000000=server_notification_2 & true]]]]
normalized: ~ [E [true U ~ [[[server_notification_2!=0.000000000000000 & [1.000000000000000!=server_notification_1 & true]] & [server_notification_1=0.000000000000000 & [1.000000000000000=server_notification_2 & true]]]]]]
-> the formula is FALSE
FORMULA p_27_markingcomparison_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[server_notification_2!=0.000000000000000 & [1.000000000000000!=server_notification_1 & true]] | [server_notification_1=0.000000000000000 & [1.000000000000000=server_notification_2 & true]]]]
normalized: ~ [E [true U ~ [[[server_notification_1=0.000000000000000 & [1.000000000000000=server_notification_2 & true]] | [server_notification_2!=0.000000000000000 & [1.000000000000000!=server_notification_1 & true]]]]]]
-> the formula is FALSE
FORMULA p_28_markingcomparison_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[server_notification_1=0.000000000000000 & [1.000000000000000=server_notification_2 & true]] & [server_notification_2!=0.000000000000000 & [true & 1.000000000000000!=server_notification_1]]]]
normalized: ~ [E [true U ~ [[[server_notification_1=0.000000000000000 & [1.000000000000000=server_notification_2 & true]] & [[1.000000000000000!=server_notification_1 & true] & server_notification_2!=0.000000000000000]]]]]
-> the formula is FALSE
FORMULA p_29_markingcomparison_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[server_notification_2!=0.000000000000000 & [1.000000000000000!=server_notification_1 & true]] | [server_notification_1=0.000000000000000 & [1.000000000000000=server_notification_2 & true]]]]
normalized: ~ [E [true U ~ [[[[true & 1.000000000000000!=server_notification_1] & server_notification_2!=0.000000000000000] | [[true & 1.000000000000000=server_notification_2] & server_notification_1=0.000000000000000]]]]]
-> the formula is FALSE
FORMULA p_30_markingcomparison_eq_or_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[server_notification_2!=0.000000000000000 & [1.000000000000000!=server_notification_1 & true]] <-> [server_notification_1=0.000000000000000 & [1.000000000000000=server_notification_2 & true]]]]
normalized: ~ [E [true U ~ [[[[[true & 1.000000000000000=server_notification_2] & server_notification_1=0.000000000000000] & [[true & 1.000000000000000!=server_notification_1] & server_notification_2!=0.000000000000000]] | [~ [[[true & 1.000000000000000=server_notification_2] & server_notification_1=0.000000000000000]] & ~ [[[true & 1.000000000000000!=server_notification_1] & server_notification_2!=0.000000000000000]]]]]]]
-> the formula is TRUE
FORMULA p_31_markingcomparison_eq_x TRUE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[[false | [1.000000000000000>server_notification_2 | false]] & [[1.000000000000000>server_notification_2 & true] & [server_notification_1=0.000000000000000 & true]]] & [server_waiting_2!=0.000000000000000 & [1.000000000000000!=server_waiting_1 & true]]]]
normalized: ~ [E [true U ~ [[[[false | [1.000000000000000>server_notification_2 | false]] & [[1.000000000000000>server_notification_2 & true] & [server_notification_1=0.000000000000000 & true]]] & [server_waiting_2!=0.000000000000000 & [1.000000000000000!=server_waiting_1 & true]]]]]]
-> the formula is FALSE
FORMULA p_32_markingcomparison_full_and FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[[1.000000000000000!=server_waiting_1 & true] & server_waiting_2!=0.000000000000000] | [[[true & server_notification_1=0.000000000000000] & [true & 1.000000000000000>server_notification_2]] & [[1.000000000000000>server_notification_2 | false] | false]]]]
normalized: ~ [E [true U ~ [[[server_waiting_2!=0.000000000000000 & [1.000000000000000!=server_waiting_1 & true]] | [[[1.000000000000000>server_notification_2 & true] & [server_notification_1=0.000000000000000 & true]] & [[1.000000000000000>server_notification_2 | false] | false]]]]]]
-> the formula is FALSE
FORMULA p_33_markingcomparison_full_or FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[[true & 1.000000000000000!=server_waiting_1] & server_waiting_2!=0.000000000000000] & ~ [[[[1.000000000000000>server_notification_2 | false] | false] & [[true & server_notification_1=0.000000000000000] & [true & 1.000000000000000>server_notification_2]]]]]]
normalized: ~ [E [true U ~ [[[[true & 1.000000000000000!=server_waiting_1] & server_waiting_2!=0.000000000000000] & ~ [[[false | [false | 1.000000000000000>server_notification_2]] & [[true & 1.000000000000000>server_notification_2] & [true & server_notification_1=0.000000000000000]]]]]]]]
-> the formula is FALSE
FORMULA p_34_markingcomparison_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
total processing time: 0m3sec
STOP 1369877685
--------------------
content from stderr:
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: 0m0sec
1273 1923 2067 2183 3251 3407 3562 3668 4010 4144 4123 5463 5624 5744 5946 6016 6156 6373 6548 6676 6704 8111 7881 7661 7746 7740 7678 7799 7789 7814 8046 8101
iterations count:32689 (181), effective:1905 (10)
initing FirstDep: 0m0sec
iterations count:180 (1), effective:0 (0)
iterations count:180 (1), effective:0 (0)
iterations count:180 (1), effective:0 (0)
iterations count:180 (1), effective:0 (0)
iterations count:180 (1), effective:0 (0)
iterations count:180 (1), effective:0 (0)
iterations count:180 (1), effective:0 (0)
--------------------
content from /tmp/BenchKit_head_log_file.1661: