Introduction
This page shows the outputs produced by the execution of marcie on IBMB2S565S3960/none (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 | |
1360.72 | 1344.71 | 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=IBMB2S565S3960-PT-none
export BK_EXAMINATION=ReachabilityPlaceComparison
export BK_TOOL=marcie
export BK_RESULT_DIR=/tmp
export BK_LOG_FILE=/tmp/BenchKit_head_log_file.1662
export BIN_DIR=/home/mcc/BenchKit/bin
cd /home/mcc/BenchKit/INPUTS/IBMB2S565S3960-PT-none
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is IBMB2S565S3960-PT-none, examination is ReachabilityPlaceComparison'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo
bash /home/mcc/BenchKit/BenchKit_head.sh
Execution Outputs of marcie for IBMB2S565S3960/none (P/T)
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
execution on node 1: quadhexa-2.u-paris10.fr (runId=137107412400049_n_1)
=====================================================================
runnning marcie on IBMB2S565S3960-PT-none (ReachabilityPlaceComparison)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is IBMB2S565S3960-PT-none, examination is ReachabilityPlaceComparison
=====================================================================
--------------------
content from stdout:
START 1371118265
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=ReachabilityPlaceComparison.txt
constant oo registered with value < INFINITY >
parse successfull!
(NrP: 273 NrTr: 179)
net check time: 0m0sec
parse mcc successfull!
place and transition orderings generation:0m0sec
init dd package: 0m5sec
RS generation: 3m21sec
-> reachability set: #nodes 706208 (7.1e+05) #states 15,510,635,947,410,534 (16)
before gc: list nodes free: 2169234
after gc: idd nodes used:1329516, unused:14670484; list nodes free:93170596
before gc: list nodes free: 5814919
after gc: idd nodes used:1649209, unused:14350791; list nodes free:91132737
starting CTL model checker
--------------------------
before gc: list nodes free: 3998115
after gc: idd nodes used:1327713, unused:14672287; list nodes free:93182602
before gc: list nodes free: 6365254
after gc: idd nodes used:1445509, unused:14554491; list nodes free:92452364
checking: AG [[callToTask.s00003967.output.s00001054=decision.s00002762.activated & callToTask.s00003976.output.s00001054=decision.s00002760.activated]]
normalized: ~ [E [true U ~ [[callToTask.s00003967.output.s00001054=decision.s00002762.activated & callToTask.s00003976.output.s00001054=decision.s00002760.activated]]]]
-> the formula is FALSE
FORMULA p_7_placecomparison_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 2m6sec
checking: AG [[callToTask.s00003967.output.s00001054=decision.s00002762.activated | callToTask.s00003976.output.s00001054=decision.s00002760.activated]]
normalized: ~ [E [true U ~ [[callToTask.s00003967.output.s00001054=decision.s00002762.activated | callToTask.s00003976.output.s00001054=decision.s00002760.activated]]]]
-> the formula is FALSE
FORMULA p_8_placecomparison_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 1m52sec
checking: AG [[callToTask.s00003967.output.s00001054=decision.s00002762.activated & callToTask.s00003976.output.s00001054=decision.s00002760.activated]]
normalized: ~ [E [true U ~ [[callToTask.s00003967.output.s00001054=decision.s00002762.activated & callToTask.s00003976.output.s00001054=decision.s00002760.activated]]]]
-> the formula is FALSE
FORMULA p_9_placecomparison_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 2m14sec
checking: AG [[callToTask.s00003967.output.s00001054=decision.s00002762.activated | callToTask.s00003976.output.s00001054=decision.s00002760.activated]]
normalized: ~ [E [true U ~ [[callToTask.s00003967.output.s00001054=decision.s00002762.activated | callToTask.s00003976.output.s00001054=decision.s00002760.activated]]]]
-> the formula is FALSE
FORMULA p_10_placecomparison_eq_or_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 2m21sec
checking: AG [[callToTask.s00003967.output.s00001054=decision.s00002762.activated -> callToTask.s00003976.output.s00001054=decision.s00002760.activated]]
normalized: ~ [E [true U ~ [[callToTask.s00003976.output.s00001054=decision.s00002760.activated | ~ [callToTask.s00003967.output.s00001054=decision.s00002762.activated]]]]]
-> the formula is TRUE
FORMULA p_11_placecomparison_eq_x TRUE TECHNIQUES DECISION_DIAGRAMS
mc time: 0m0sec
checking: AG [[callToProcess.s00003859.input.s00001068
-> the formula is FALSE
FORMULA p_12_placecomparison_full_and FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 2m12sec
checking: AG [[callToProcess.s00003859.input.s00001068
-> the formula is FALSE
FORMULA p_13_placecomparison_full_or FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 2m5sec
checking: AG [[~ [callToProcess.s00003859.input.s00001068
-> the formula is FALSE
FORMULA p_14_placecomparison_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS
mc time: 1m39sec
total processing time: 23m15sec
STOP 1371119660
--------------------
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
9992 98130 413220 397904 408268 412808 413977 412183 411173 646589
iterations count:10659 (59), effective:1584 (8)
initing FirstDep: 0m0sec
iterations count:179 (1), effective:0 (0)
iterations count:179 (1), effective:0 (0)
iterations count:179 (1), effective:0 (0)
iterations count:179 (1), effective:0 (0)
iterations count:179 (1), effective:0 (0)
iterations count:179 (1), effective:0 (0)
iterations count:179 (1), effective:0 (0)
--------------------
content from /tmp/BenchKit_head_log_file.1662: