Introduction

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=QuasiCertifProtocol-PT-06
export BK_EXAMINATION=CTLMix
export BK_TOOL=marcie
export BK_RESULT_DIR=/tmp
export BK_LOG_FILE=/tmp/BenchKit_head_log_file.1649
export BIN_DIR=/home/mcc/BenchKit/bin
cd /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-06
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is QuasiCertifProtocol-PT-06, examination is CTLMix'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo
bash /home/mcc/BenchKit/BenchKit_head.sh

Execution Outputs of marcie for QuasiCertifProtocol/06 (P/T)

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

execution on node 2: quadhexa-2.u-paris10.fr (runId=137107412700186_n_2)
=====================================================================
runnning marcie on QuasiCertifProtocol-PT-06 (CTLMix)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is QuasiCertifProtocol-PT-06, examination is CTLMix
=====================================================================

--------------------
content from stdout:

START 1371122265

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=CTLMix.txt

constant oo registered with value < INFINITY >
parse successfull!


(NrP: 270 NrTr: 116)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m36sec


-> reachability set: #nodes 218170 (2.2e+05) #states 2,271,960 (6)



starting CTL model checker
--------------------------

checking: EF [[ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) & [a1=a5 & true]]]
normalized: E [true U [ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) & [a1=a5 & true]]]

-> the formula is FALSE

FORMULA p_1876_mix_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EF [[ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) | [a1=a5 & true]]]
normalized: E [true U [ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) | [a1=a5 & true]]]

-> the formula is FALSE

FORMULA p_1877_mix_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) & [a1=a5 & true]]]
normalized: ~ [E [true U ~ [[ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) & [a1=a5 & true]]]]]

-> the formula is FALSE

FORMULA p_1878_mix_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m36sec

checking: EF [[ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) | [a1=a5 & true]]]
normalized: E [true U [[a1=a5 & true] | ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) ]]

-> the formula is FALSE

FORMULA p_1879_mix_eq_or_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: EG [A [EF [[true & a1=a5]] U AF [ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) ]]]
normalized: EG [[~ [E [~ [E [true U [true & a1=a5]]] U [EG [~ [ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) ]] & ~ [E [true U [true & a1=a5]]]]]] & ~ [EG [EG [~ [ ( ( ( ( ( ( Sstart_3 + Sstart_6 ) + Sstart_0 ) + Sstart_1 ) + Sstart_2 ) + Sstart_4 ) + Sstart_5 ) = ( ( ( ( ( ( n6_6 + n6_1 ) + n6_2 ) + n6_3 ) + n6_0 ) + n6_5 ) + n6_4 ) ]]]]]]


EG iterations: 0

EG iterations: 0

EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE

FORMULA p_1880_mix_eq_x FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[AstopAbort<=a2 & ["malicious_reservoir" \in [1, oo) && "Sstart_6" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_1" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_2" \in [1, oo) | ["Sstart_5" \in [1, oo) && "malicious_reservoir" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_0" \in [1, oo) | ["Sstart_4" \in [1, oo) && "malicious_reservoir" \in [1, oo) | "malicious_reservoir" \in [1, oo) && "Sstart_3" \in [1, oo)]]]]]]]]
normalized: ~ [E [true U ~ [[AstopAbort<=a2 & [[[[[["Sstart_4" \in [1, oo) && "malicious_reservoir" \in [1, oo) | "malicious_reservoir" \in [1, oo) && "Sstart_3" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_0" \in [1, oo)] | "Sstart_5" \in [1, oo) && "malicious_reservoir" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_2" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_1" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_6" \in [1, oo)]]]]]

-> the formula is FALSE

FORMULA p_1881_mix_full_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m1sec

checking: EG [[AstopAbort<=a2 | ["malicious_reservoir" \in [1, oo) && "Sstart_6" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_1" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_2" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_5" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_0" \in [1, oo) | ["Sstart_4" \in [1, oo) && "malicious_reservoir" \in [1, oo) | "Sstart_3" \in [1, oo) && "malicious_reservoir" \in [1, oo)]]]]]]]]
normalized: EG [[AstopAbort<=a2 | [[[[[["Sstart_3" \in [1, oo) && "malicious_reservoir" \in [1, oo) | "Sstart_4" \in [1, oo) && "malicious_reservoir" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_0" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_5" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_2" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_1" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_6" \in [1, oo)]]]

............
EG iterations: 12
-> the formula is FALSE

FORMULA p_1882_mix_full_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m1sec

checking: EF [[~ [["malicious_reservoir" \in [1, oo) && "Sstart_6" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_1" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_2" \in [1, oo) | ["Sstart_5" \in [1, oo) && "malicious_reservoir" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_0" \in [1, oo) | ["malicious_reservoir" \in [1, oo) && "Sstart_4" \in [1, oo) | "malicious_reservoir" \in [1, oo) && "Sstart_3" \in [1, oo)]]]]]]] & AstopAbort<=a2]]
normalized: E [true U [AstopAbort<=a2 & ~ [[[[[[["malicious_reservoir" \in [1, oo) && "Sstart_3" \in [1, oo) | "malicious_reservoir" \in [1, oo) && "Sstart_4" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_0" \in [1, oo)] | "Sstart_5" \in [1, oo) && "malicious_reservoir" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_2" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_1" \in [1, oo)] | "malicious_reservoir" \in [1, oo) && "Sstart_6" \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_1883_mix_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 2m8sec

STOP 1371122394

--------------------
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

84051 117217 137672 218170
iterations count:4067 (35), effective:116 (1)

initing FirstDep: 0m0sec


iterations count:116 (1), effective:0 (0)

iterations count:116 (1), effective:0 (0)

iterations count:116 (1), effective:0 (0)

--------------------
content from /tmp/BenchKit_head_log_file.1649: