fond
Model Checking Contest @ Petri Nets 2013
Milano, Italy, June 25, 2013
marcie: ReachabilityFireability on Ring/none (P/T)
Last Updated
Apr. 26, 2013

Introduction

This page shows the outputs produced by the execution of marcie on Ring/none (P/T). We provide:

About the Execution

Execution Summary
Memory (MB) CPU (s) End
706.59 2.84 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=Ring-PT-none
export BK_EXAMINATION=ReachabilityFireability
export BK_TOOL=marcie
export BK_RESULT_DIR=/tmp
export BK_LOG_FILE=/tmp/BenchKit_head_log_file.1656
export BIN_DIR=/home/mcc/BenchKit/bin
cd /home/mcc/BenchKit/INPUTS/Ring-PT-none
echo =====================================================================
echo ' Generated by BenchKit 1.0'
echo ' Executing tool marcie:'
echo ' Test is Ring-PT-none, examination is ReachabilityFireability'
echo =====================================================================
echo
echo --------------------
echo 'content from stdout:'
echo
bash /home/mcc/BenchKit/BenchKit_head.sh

Execution Outputs of marcie for Ring/none (P/T)

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


execution on node 26: cluster1u28.lip6.fr (runId=136980626601353_n_26)
=====================================================================
runnning marcie on Ring-PT-none (ReachabilityFireability)
We got on stdout:
Probing ssh
Waiting ssh to respond
Ssh up and responding
=====================================================================
Generated by BenchKit 1.0
Executing tool marcie:
Test is Ring-PT-none, examination is ReachabilityFireability
=====================================================================

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

START 1369819299

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

constant oo registered with value < INFINITY >
parse successfull!


(NrP: 139 NrTr: 87)

net check time: 0m0sec

parse mcc successfull!

place and transition orderings generation:0m0sec

init dd package: 0m1sec


RS generation: 0m0sec


-> reachability set: #nodes 3458 (3.5e+03) #states 902,651,904,000 (11)



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

checking: AG [[P53 \in [1, oo) && P46 \in [1, oo) && P50 \in [1, oo) & P104 \in [1, oo) && P60 \in [1, oo)]]
normalized: ~ [E [true U ~ [[P46 \in [1, oo) && P50 \in [1, oo) && P53 \in [1, oo) & P104 \in [1, oo) && P60 \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_2_fireability_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[P53 \in [1, oo) && P50 \in [1, oo) && P46 \in [1, oo) | P104 \in [1, oo) && P60 \in [1, oo)]]
normalized: ~ [E [true U ~ [[P104 \in [1, oo) && P60 \in [1, oo) | P53 \in [1, oo) && P50 \in [1, oo) && P46 \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_3_fireability_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[P46 \in [1, oo) && P50 \in [1, oo) && P53 \in [1, oo) & P60 \in [1, oo) && P104 \in [1, oo)]]
normalized: ~ [E [true U ~ [[P53 \in [1, oo) && P46 \in [1, oo) && P50 \in [1, oo) & P60 \in [1, oo) && P104 \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_4_fireability_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[P60 \in [1, oo) && P104 \in [1, oo) | P53 \in [1, oo) && P50 \in [1, oo) && P46 \in [1, oo)]]
normalized: ~ [E [true U ~ [[P60 \in [1, oo) && P104 \in [1, oo) | P50 \in [1, oo) && P46 \in [1, oo) && P53 \in [1, oo)]]]]

-> the formula is FALSE

FORMULA p_5_fireability_or_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec

checking: AG [[~ [P53 \in [1, oo) && P50 \in [1, oo) && P46 \in [1, oo)] xor P60 \in [1, oo) && P104 \in [1, oo)]]
normalized: ~ [E [true U ~ [[[! (P60 \in [1, oo) && P104 \in [1, oo)) & ! (P53 \in [1, oo) && P50 \in [1, oo) && P46 \in [1, oo))] | [P53 \in [1, oo) && P50 \in [1, oo) && P46 \in [1, oo) & P60 \in [1, oo) && P104 \in [1, oo)]]]]]

-> the formula is FALSE

FORMULA p_6_fireability_x FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m1sec

checking: ~ [EF [[P62 \in [1, oo) && P49 \in [1, oo) && P46 \in [1, oo) & P137 \in [1, oo) && P133 \in [1, oo)]]]
normalized: ~ [E [true U [P62 \in [1, oo) && P49 \in [1, oo) && P46 \in [1, oo) & P137 \in [1, oo) && P133 \in [1, oo)]]]

-> the formula is FALSE

FORMULA p_38_fireability_and FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m2sec

checking: ~ [EF [[P137 \in [1, oo) && P133 \in [1, oo) | P62 \in [1, oo) && P49 \in [1, oo) && P46 \in [1, oo)]]]
normalized: ~ [E [true U [P137 \in [1, oo) && P133 \in [1, oo) | P62 \in [1, oo) && P49 \in [1, oo) && P46 \in [1, oo)]]]

-> the formula is FALSE

FORMULA p_39_fireability_or FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m1sec

checking: ~ [EF [[P133 \in [1, oo) && P137 \in [1, oo) & ~ [P62 \in [1, oo) && P49 \in [1, oo) && P46 \in [1, oo)]]]]
normalized: ~ [E [true U [P133 \in [1, oo) && P137 \in [1, oo) & ! (P62 \in [1, oo) && P49 \in [1, oo) && P46 \in [1, oo))]]]

-> the formula is FALSE

FORMULA p_40_fireability_and_notx FALSE TECHNIQUES DECISION_DIAGRAMS

mc time: 0m0sec


total processing time: 0m8sec

STOP 1369819308

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

301 1108 682 2399 3284 2324
iterations count:6694 (76), effective:924 (10)

initing FirstDep: 0m0sec


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

iterations count:100 (1), effective:2 (0)

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

iterations count:100 (1), effective:2 (0)
5739 8188 7790
iterations count:3766 (43), effective:457 (5)
6320 9908 9476 4257
iterations count:4346 (49), effective:546 (6)
8100 9816
iterations count:2707 (31), effective:315 (3)
7659
iterations count:1885 (21), effective:202 (2)

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