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

Execution Outputs of marcie for QuasiCertifProtocol/02 (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=137107412400073_n_1)
=====================================================================
runnning marcie on QuasiCertifProtocol-PT-02 (ReachabilityCardinalityComparison)
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-02, examination is ReachabilityCardinalityComparison
=====================================================================

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

START 1371121972

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

constant oo registered with value < INFINITY >
parse successfull!


(NrP: 86 NrTr: 56)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m6sec


RS generation: 0m0sec


-> reachability set: #nodes 1881 (1.9e+03) #states 1,029 (3)



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

checking: AG [[ ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) & ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) ]]
normalized: ~ [E [true U ~ [[ ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) & ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) ]]]]

-> the formula is FALSE

FORMULA p_17_cardinalitycomparison_eq_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[ ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) | ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) ]]
normalized: ~ [E [true U ~ [[ ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) | ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) ]]]]

-> the formula is FALSE

FORMULA p_18_cardinalitycomparison_eq_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[ ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) & ~ [ ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) ]]]
normalized: ~ [E [true U ~ [[~ [ ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) ] & ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) ]]]]

-> the formula is FALSE

FORMULA p_19_cardinalitycomparison_eq_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[~ [ ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) ] | ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) ]]
normalized: ~ [E [true U ~ [[~ [ ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) ] | ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) ]]]]

-> the formula is TRUE

FORMULA p_20_cardinalitycomparison_eq_or_notx TRUE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[ ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) | ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) ]]
normalized: ~ [E [true U ~ [[ ( ( n6_0 + n6_1 ) + n6_2 ) = ( ( s3_2 + s3_1 ) + s3_0 ) | ( ( Cstart_2 + Cstart_1 ) + Cstart_0 ) = ( ( n4_1 + n4_2 ) + n4_0 ) ]]]]

-> the formula is FALSE

FORMULA p_21_cardinalitycomparison_eq_x FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[ ( ( s5_2 + s5_0 ) + s5_1 ) > ( ( Sstart_2 + Sstart_1 ) + Sstart_0 ) & ( ( ( ( ( ( ( ( n9_1_0 + n9_0_1 ) + n9_2_2 ) + n9_1_1 ) + n9_1_2 ) + n9_0_2 ) + n9_0_0 ) + n9_2_0 ) + n9_2_1 ) <= ( ( ( ( ( ( ( ( n7_0_0 + n7_0_2 ) + n7_1_2 ) + n7_1_0 ) + n7_0_1 ) + n7_2_2 ) + n7_1_1 ) + n7_2_1 ) + n7_2_0 ) ]]
normalized: ~ [E [true U ~ [[ ( ( s5_2 + s5_0 ) + s5_1 ) > ( ( Sstart_2 + Sstart_1 ) + Sstart_0 ) & ( ( ( ( ( ( ( ( n9_1_0 + n9_0_1 ) + n9_2_2 ) + n9_1_1 ) + n9_1_2 ) + n9_0_2 ) + n9_0_0 ) + n9_2_0 ) + n9_2_1 ) <= ( ( ( ( ( ( ( ( n7_0_0 + n7_0_2 ) + n7_1_2 ) + n7_1_0 ) + n7_0_1 ) + n7_2_2 ) + n7_1_1 ) + n7_2_1 ) + n7_2_0 ) ]]]]

-> the formula is FALSE

FORMULA p_22_cardinalitycomparison_full_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[ ( ( ( ( ( ( ( ( n9_1_0 + n9_0_1 ) + n9_2_2 ) + n9_1_1 ) + n9_1_2 ) + n9_0_2 ) + n9_0_0 ) + n9_2_0 ) + n9_2_1 ) <= ( ( ( ( ( ( ( ( n7_0_0 + n7_0_2 ) + n7_1_2 ) + n7_1_0 ) + n7_0_1 ) + n7_2_2 ) + n7_1_1 ) + n7_2_1 ) + n7_2_0 ) | ( ( s5_2 + s5_0 ) + s5_1 ) > ( ( Sstart_2 + Sstart_1 ) + Sstart_0 ) ]]
normalized: ~ [E [true U ~ [[ ( ( ( ( ( ( ( ( n9_1_0 + n9_0_1 ) + n9_2_2 ) + n9_1_1 ) + n9_1_2 ) + n9_0_2 ) + n9_0_0 ) + n9_2_0 ) + n9_2_1 ) <= ( ( ( ( ( ( ( ( n7_0_0 + n7_0_2 ) + n7_1_2 ) + n7_1_0 ) + n7_0_1 ) + n7_2_2 ) + n7_1_1 ) + n7_2_1 ) + n7_2_0 ) | ( ( s5_2 + s5_0 ) + s5_1 ) > ( ( Sstart_2 + Sstart_1 ) + Sstart_0 ) ]]]]

-> the formula is FALSE

FORMULA p_23_cardinalitycomparison_full_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[~ [ ( ( ( ( ( ( ( ( n9_1_0 + n9_0_1 ) + n9_2_2 ) + n9_1_1 ) + n9_1_2 ) + n9_0_2 ) + n9_0_0 ) + n9_2_0 ) + n9_2_1 ) <= ( ( ( ( ( ( ( ( n7_0_0 + n7_0_2 ) + n7_1_2 ) + n7_1_0 ) + n7_0_1 ) + n7_2_2 ) + n7_1_1 ) + n7_2_1 ) + n7_2_0 ) ] & ( ( s5_2 + s5_0 ) + s5_1 ) > ( ( Sstart_2 + Sstart_1 ) + Sstart_0 ) ]]
normalized: ~ [E [true U ~ [[~ [ ( ( ( ( ( ( ( ( n9_1_0 + n9_0_1 ) + n9_2_2 ) + n9_1_1 ) + n9_1_2 ) + n9_0_2 ) + n9_0_0 ) + n9_2_0 ) + n9_2_1 ) <= ( ( ( ( ( ( ( ( n7_0_0 + n7_0_2 ) + n7_1_2 ) + n7_1_0 ) + n7_0_1 ) + n7_2_2 ) + n7_1_1 ) + n7_2_1 ) + n7_2_0 ) ] & ( ( s5_2 + s5_0 ) + s5_1 ) > ( ( Sstart_2 + Sstart_1 ) + Sstart_0 ) ]]]]

-> the formula is FALSE

FORMULA p_24_cardinalitycomparison_full_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 0m7sec

STOP 1371121980

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


iterations count:913 (16), effective:56 (1)

initing FirstDep: 0m0sec


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

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

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

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

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

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

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

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