Introduction
This page shows the outputs produced by the execution of marcie on Peterson/3 (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 | |
| 1161.65 | 138.00 | 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=Peterson-PT-3
export BK_EXAMINATION=ReachabilityMix
export BK_TOOL=marcie
export BK_RESULT_DIR=/tmp
export BK_LOG_FILE=/tmp/BenchKit_head_log_file.1654
export BIN_DIR=/home/mcc/BenchKit/bin
cd /home/mcc/BenchKit/INPUTS/Peterson-PT-3
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is Peterson-PT-3, examination is ReachabilityMix'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo
bash /home/mcc/BenchKit/BenchKit_head.sh
Execution Outputs of marcie for Peterson/3 (P/T)
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
execution on node 31: cluster1u33.lip6.fr (runId=136966892501304_n_31)
=====================================================================
runnning marcie on Peterson-PT-3 (ReachabilityMix)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is Peterson-PT-3, examination is ReachabilityMix
=====================================================================
--------------------
content from stdout:
START 1369683182
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=ReachabilityMix.txt
constant oo registered with value < INFINITY >
parse successfull!
(NrP: 244 NrTr: 332)
net check time: 0m0sec
parse mcc successfull!
place and transition orderings generation:0m0sec
init dd package: 0m1sec
RS generation: 0m48sec
-> reachability set: #nodes 56076 (5.6e+04) #states 3,407,946 (6)
starting CTL model checker
--------------------------
checking: AG [[[["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | ["WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo) | "CS_2" \in [1, oo) && "WantSection_2_T" \in [1, oo)]] | "WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo)] & [TestTurn_2_1=EndTurn_2_1 & [TestTurn_1_0=EndTurn_1_0 & [[[TestTurn_0_1=EndTurn_0_1 & [TestTurn_1_2=EndTurn_1_2 & [[TestTurn_2_0=EndTurn_2_0 & [[[TestTurn_1_1=EndTurn_1_1 & [true & TestTurn_3_1=EndTurn_3_1]] & TestTurn_2_2=EndTurn_2_2] & TestTurn_0_2=EndTurn_0_2]] & TestTurn_3_0=EndTurn_3_0]]] & TestTurn_3_2=EndTurn_3_2] & TestTurn_0_0=EndTurn_0_0]]]]]
normalized: ~ [E [true U ~ [[[["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | ["WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo) | "CS_2" \in [1, oo) && "WantSection_2_T" \in [1, oo)]] | "WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo)] & [TestTurn_2_1=EndTurn_2_1 & [TestTurn_1_0=EndTurn_1_0 & [TestTurn_0_0=EndTurn_0_0 & [TestTurn_3_2=EndTurn_3_2 & [TestTurn_0_1=EndTurn_0_1 & [TestTurn_1_2=EndTurn_1_2 & [TestTurn_3_0=EndTurn_3_0 & [TestTurn_2_0=EndTurn_2_0 & [TestTurn_0_2=EndTurn_0_2 & [TestTurn_2_2=EndTurn_2_2 & [TestTurn_1_1=EndTurn_1_1 & [TestTurn_3_1=EndTurn_3_1 & true]]]]]]]]]]]]]]]]
-> the formula is FALSE
FORMULA p_37_mix_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m7sec
checking: AG [[["WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo) | ["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | ["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo)]]] | [[[[[[[TestTurn_3_0=EndTurn_3_0 & [[[[TestTurn_1_1=EndTurn_1_1 & [true & TestTurn_3_1=EndTurn_3_1]] & TestTurn_2_2=EndTurn_2_2] & TestTurn_0_2=EndTurn_0_2] & TestTurn_2_0=EndTurn_2_0]] & TestTurn_1_2=EndTurn_1_2] & TestTurn_0_1=EndTurn_0_1] & TestTurn_3_2=EndTurn_3_2] & TestTurn_0_0=EndTurn_0_0] & TestTurn_1_0=EndTurn_1_0] & TestTurn_2_1=EndTurn_2_1]]]
normalized: ~ [E [true U ~ [[["WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo) | ["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | ["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo)]]] | [TestTurn_2_1=EndTurn_2_1 & [TestTurn_1_0=EndTurn_1_0 & [TestTurn_0_0=EndTurn_0_0 & [TestTurn_3_2=EndTurn_3_2 & [TestTurn_0_1=EndTurn_0_1 & [TestTurn_1_2=EndTurn_1_2 & [TestTurn_3_0=EndTurn_3_0 & [TestTurn_2_0=EndTurn_2_0 & [TestTurn_0_2=EndTurn_0_2 & [TestTurn_2_2=EndTurn_2_2 & [TestTurn_1_1=EndTurn_1_1 & [TestTurn_3_1=EndTurn_3_1 & true]]]]]]]]]]]]]]]]
-> the formula is FALSE
FORMULA p_38_mix_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | ["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo)]] | "WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo)] & [[TestTurn_1_0=EndTurn_1_0 & [[TestTurn_3_2=EndTurn_3_2 & [[[[[TestTurn_0_2=EndTurn_0_2 & [[[true & TestTurn_3_1=EndTurn_3_1] & TestTurn_1_1=EndTurn_1_1] & TestTurn_2_2=EndTurn_2_2]] & TestTurn_2_0=EndTurn_2_0] & TestTurn_3_0=EndTurn_3_0] & TestTurn_1_2=EndTurn_1_2] & TestTurn_0_1=EndTurn_0_1]] & TestTurn_0_0=EndTurn_0_0]] & TestTurn_2_1=EndTurn_2_1]]]
normalized: ~ [E [true U ~ [[["WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo) | ["WantSection_1_T" \in [1, oo) && "CS_1" \in [1, oo) | ["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo)]]] & [[[[[[[[[TestTurn_0_2=EndTurn_0_2 & [[TestTurn_1_1=EndTurn_1_1 & [TestTurn_3_1=EndTurn_3_1 & true]] & TestTurn_2_2=EndTurn_2_2]] & TestTurn_2_0=EndTurn_2_0] & TestTurn_3_0=EndTurn_3_0] & TestTurn_1_2=EndTurn_1_2] & TestTurn_0_1=EndTurn_0_1] & TestTurn_3_2=EndTurn_3_2] & TestTurn_0_0=EndTurn_0_0] & TestTurn_1_0=EndTurn_1_0] & TestTurn_2_1=EndTurn_2_1]]]]]
-> the formula is FALSE
FORMULA p_39_mix_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[["WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo) | [["WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo) | "WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo)] | "CS_1" \in [1, oo) && "WantSection_1_T" \in [1, oo)]] | [[[[[[[TestTurn_3_0=EndTurn_3_0 & [TestTurn_2_0=EndTurn_2_0 & [TestTurn_0_2=EndTurn_0_2 & [TestTurn_2_2=EndTurn_2_2 & [[TestTurn_3_1=EndTurn_3_1 & true] & TestTurn_1_1=EndTurn_1_1]]]]] & TestTurn_1_2=EndTurn_1_2] & TestTurn_0_1=EndTurn_0_1] & TestTurn_3_2=EndTurn_3_2] & TestTurn_0_0=EndTurn_0_0] & TestTurn_1_0=EndTurn_1_0] & TestTurn_2_1=EndTurn_2_1]]]
normalized: ~ [E [true U ~ [[[["CS_1" \in [1, oo) && "WantSection_1_T" \in [1, oo) | ["WantSection_0_T" \in [1, oo) && "CS_0" \in [1, oo) | "WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo)]] | "WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo)] | [[TestTurn_1_0=EndTurn_1_0 & [[[[[[[[[[true & TestTurn_3_1=EndTurn_3_1] & TestTurn_1_1=EndTurn_1_1] & TestTurn_2_2=EndTurn_2_2] & TestTurn_0_2=EndTurn_0_2] & TestTurn_2_0=EndTurn_2_0] & TestTurn_3_0=EndTurn_3_0] & TestTurn_1_2=EndTurn_1_2] & TestTurn_0_1=EndTurn_0_1] & TestTurn_3_2=EndTurn_3_2] & TestTurn_0_0=EndTurn_0_0]] & TestTurn_2_1=EndTurn_2_1]]]]]
-> the formula is FALSE
FORMULA p_40_mix_eq_or_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[~ [[["CS_1" \in [1, oo) && "WantSection_1_T" \in [1, oo) | ["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "CS_0" \in [1, oo) && "WantSection_0_T" \in [1, oo)]] | "WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo)]] xor [[TestTurn_1_0=EndTurn_1_0 & [[TestTurn_3_2=EndTurn_3_2 & [TestTurn_0_1=EndTurn_0_1 & [TestTurn_1_2=EndTurn_1_2 & [[TestTurn_2_0=EndTurn_2_0 & [TestTurn_0_2=EndTurn_0_2 & [TestTurn_2_2=EndTurn_2_2 & [[TestTurn_3_1=EndTurn_3_1 & true] & TestTurn_1_1=EndTurn_1_1]]]] & TestTurn_3_0=EndTurn_3_0]]]] & TestTurn_0_0=EndTurn_0_0]] & TestTurn_2_1=EndTurn_2_1]]]
normalized: ~ [E [true U ~ [[[~ [[TestTurn_2_1=EndTurn_2_1 & [TestTurn_1_0=EndTurn_1_0 & [TestTurn_0_0=EndTurn_0_0 & [TestTurn_3_2=EndTurn_3_2 & [TestTurn_0_1=EndTurn_0_1 & [TestTurn_1_2=EndTurn_1_2 & [TestTurn_3_0=EndTurn_3_0 & [TestTurn_2_0=EndTurn_2_0 & [TestTurn_0_2=EndTurn_0_2 & [TestTurn_2_2=EndTurn_2_2 & [TestTurn_1_1=EndTurn_1_1 & [TestTurn_3_1=EndTurn_3_1 & true]]]]]]]]]]]]] & ~ [["WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo) | [["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "CS_0" \in [1, oo) && "WantSection_0_T" \in [1, oo)] | "CS_1" \in [1, oo) && "WantSection_1_T" \in [1, oo)]]]] | [[TestTurn_2_1=EndTurn_2_1 & [TestTurn_1_0=EndTurn_1_0 & [TestTurn_0_0=EndTurn_0_0 & [TestTurn_3_2=EndTurn_3_2 & [TestTurn_0_1=EndTurn_0_1 & [TestTurn_1_2=EndTurn_1_2 & [TestTurn_3_0=EndTurn_3_0 & [TestTurn_2_0=EndTurn_2_0 & [TestTurn_0_2=EndTurn_0_2 & [TestTurn_2_2=EndTurn_2_2 & [TestTurn_1_1=EndTurn_1_1 & [TestTurn_3_1=EndTurn_3_1 & true]]]]]]]]]]]] & ["WantSection_3_T" \in [1, oo) && "CS_3" \in [1, oo) | [["WantSection_2_T" \in [1, oo) && "CS_2" \in [1, oo) | "CS_0" \in [1, oo) && "WantSection_0_T" \in [1, oo)] | "CS_1" \in [1, oo) && "WantSection_1_T" \in [1, oo)]]]]]]]
before gc: list nodes free: 473196
after gc: idd nodes used:73653, unused:15926347; list nodes free:70984755
-> the formula is FALSE
FORMULA p_41_mix_eq_x FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 1m28sec
checking: AG [[[[[Idle_1<=CS_1 & [Idle_3<=CS_3 & [[true & Idle_0<=CS_0] & Idle_2<=CS_2]]] & true] & [false | [Idle_1
normalized: ~ [E [true U ~ [[[true & [[[[[[[[[[[[true & EndTurn_1_1>AskForSection_1_1] & EndTurn_0_1>AskForSection_0_1] & EndTurn_3_2>AskForSection_3_2] & EndTurn_2_1>AskForSection_2_1] & EndTurn_1_0>AskForSection_1_0] & EndTurn_3_0>AskForSection_3_0] & EndTurn_1_2>AskForSection_1_2] & EndTurn_2_0>AskForSection_2_0] & EndTurn_0_0>AskForSection_0_0] & EndTurn_3_1>AskForSection_3_1] & EndTurn_2_2>AskForSection_2_2] & EndTurn_0_2>AskForSection_0_2]] & [[[Idle_1
-> the formula is FALSE
FORMULA p_42_mix_full_and FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[[[Idle_1
normalized: ~ [E [true U ~ [[[[EndTurn_0_2>AskForSection_0_2 & [EndTurn_2_2>AskForSection_2_2 & [EndTurn_3_1>AskForSection_3_1 & [EndTurn_0_0>AskForSection_0_0 & [EndTurn_2_0>AskForSection_2_0 & [EndTurn_1_2>AskForSection_1_2 & [EndTurn_3_0>AskForSection_3_0 & [EndTurn_1_0>AskForSection_1_0 & [EndTurn_2_1>AskForSection_2_1 & [EndTurn_3_2>AskForSection_3_2 & [EndTurn_0_1>AskForSection_0_1 & [EndTurn_1_1>AskForSection_1_1 & true]]]]]]]]]]]] & true] | [[true & [Idle_1<=CS_1 & [Idle_3<=CS_3 & [Idle_2<=CS_2 & [Idle_0<=CS_0 & true]]]]] & [false | [Idle_1
-> the formula is FALSE
FORMULA p_43_mix_full_or FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[[[[[[Idle_2
normalized: ~ [E [true U ~ [[[[EndTurn_0_2>AskForSection_0_2 & [EndTurn_2_2>AskForSection_2_2 & [EndTurn_3_1>AskForSection_3_1 & [EndTurn_0_0>AskForSection_0_0 & [EndTurn_2_0>AskForSection_2_0 & [EndTurn_1_2>AskForSection_1_2 & [EndTurn_3_0>AskForSection_3_0 & [EndTurn_1_0>AskForSection_1_0 & [EndTurn_2_1>AskForSection_2_1 & [EndTurn_3_2>AskForSection_3_2 & [EndTurn_0_1>AskForSection_0_1 & [EndTurn_1_1>AskForSection_1_1 & true]]]]]]]]]]]] & true] & [[[Idle_1<=CS_1 & [Idle_3<=CS_3 & [Idle_2<=CS_2 & [Idle_0<=CS_0 & true]]]] & true] & [false | [Idle_1
-> the formula is FALSE
FORMULA p_44_mix_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
total processing time: 2m41sec
STOP 1369683344
--------------------
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
633 1596 2359 3260 4030 4745 5395 5268 5363 5197 10231 10760 11988 12164 12339 13954 15752 17708 17776 18119 18284 20091 20351 20958 22021 22277 22184 22386 23588 23796 24542 24489 24569 24632 24528 25073 25474 26124 26152 26515 26970 26085 27293 26796 26505 27159 26730 26707 26663 26179 27117 26757 26824 26709 26489 27157 26575 26908 27001 27821 27297 27086 27011 29890 29301 29338 29416 29650 30098 30129 30044 31896 32095 32222 32095 35948 35529 35601 35435 35084 36613 37080 37460 37496 37015 37495 38594 39102 39547 40202 40108 40227 40240 40370 40099 40373 40039 39221 39582 39816 40126 39435 39297 39507 38191 39371 38666 38484 39001 38457 38357 38359 37889 38602 38229 38293 38385 38035 37253 40710 40353 41378 41282 41116 41863 41434 41411 41367 40877 44207 44349 45477 45872 46113 47887 48131 48671 48526 48426 48022 47947 47545 47293 47551 49400 50333 50800 50838 50744 50945 51697 51303 51296 51100 52698 52745 52547 52693 52478 51841 51432 51808 51627 51111 50660 49667 49397 48821 48632 48207 48353 47605 47123 47839 47316 46909 47560 47115 47091 47048 47501 47460 47087 47046 46870 46650 46124 50091 50167 50288 50286 50899 50672 51550 51471 51231 51239 51077 50739 52485 55138 55303 55904 58419 58246 58265 58197 57537 57346 58197 58317 58976 59198 59100 59502 59731 60464 61156 61167 60796 60910 61018 60733 62364 62295 62253 62218 62626 61365 61403 61248 61471 60764 60006 58111 58373 58413 57508 57312 57061 55940 56452 56105 55729 56183 55748 55824 55848 55417 56115 55775 55704 55877 55712 54777 55744
iterations count:256454 (772), effective:11356 (34)
initing FirstDep: 0m0sec
iterations count:332 (1), effective:0 (0)
iterations count:427 (1), effective:4 (0)
iterations count:332 (1), effective:0 (0)
iterations count:427 (1), effective:4 (0)
23452 23544 24098 24687 26006 26447 26379 26167 26352 28909 29802 30542 31217 32211 33211 33428 32684 34821 36695 37533 37659 38852 38896 38948 37395 37498 38467 39597 39655 41158 42727 43487 43691 44066 48019 47309 47550 45398 45051 45924 45879 45406 45399 46354 46955 46894 47295 47881 47001 47186 48909 50864 51221 51138 51595 53261 53445 53543 52249 52871 52951 53289 52726 53054 53151 53161 53214 52832 52366 49585 51243 53037 54924 55105 55800 56812 56788 58617 60372 60698 60980 61765 60174 59382 60171 59886 60150 60093 59005 56889 54950 55512 55499 55187 55788 56306 56606 56628 56912 57156 57246 56799 57080 57392 57324 56868 57824 60378 60777 60541 60307 59996 59504 59816 59872 59795 60181 60285 60643 59897 60393 60655 60490 60352 59810 58336 59003 58700 59087 58259 58357 58054 57937 57266
iterations count:134873 (406), effective:3455 (10)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
iterations count:332 (1), effective:0 (0)
--------------------
content from /tmp/BenchKit_head_log_file.1654: