fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r225-tall-167856407500365
Last Updated
May 14, 2023

About the Execution of Marcie for LamportFastMutEx-COL-5

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5950.964 229443.00 229089.00 0.00 4 5 4 5 4 4 5 1 20 5 5 4 5 4 1 1 normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r225-tall-167856407500365.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is LamportFastMutEx-COL-5, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r225-tall-167856407500365
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 6.4K Feb 25 13:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 25 13:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 13:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 13:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:20 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:20 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:20 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:20 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 13:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 25 13:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 13:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 13:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 16:20 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:20 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 equiv_pt
-rw-r--r-- 1 mcc users 2 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 41K Mar 5 18:22 model.pnml

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

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-00
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-01
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-02
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-03
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-04
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-05
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-06
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-07
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-08
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-09
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-10
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-11
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-12
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-13
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-14
FORMULA_NAME LamportFastMutEx-COL-5-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678618811156

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marcie
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LamportFastMutEx-COL-5
Not applying reductions.
Model is COL
UpperBounds COL
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
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: /home/mcc/BenchKit/bin//../marcie/bin/marcie --net-file=model.pnml --mcc-file=UpperBounds.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Unfolding complete |P|=174|T|=318|A|=1380
Time for unfolding: 0m 1.370sec

Net: LamportFastMutEx_COL_5
(NrP: 174 NrTr: 318 NrArc: 1380)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.006sec

net check time: 0m 0.000sec

init dd package: 0m 2.858sec


RS generation: 3m35.744sec


-> reachability set: #nodes 668389 (6.7e+05) #states 530,682,432 (8)



starting MCC model checker
--------------------------

checking: place_bound(P_await_13_C_pid_0,P_await_13_C_pid_1,P_await_13_C_pid_2,P_await_13_C_pid_3,P_await_13_C_pid_4,P_await_13_C_pid_5)
normalized: place_bound(P_await_13_C_pid_0,P_await_13_C_pid_1,P_await_13_C_pid_2,P_await_13_C_pid_3,P_await_13_C_pid_4,P_await_13_C_pid_5)

-> the formula is 4

FORMULA LamportFastMutEx-COL-5-UpperBounds-00 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_ifxi_10_C_pid_0,P_ifxi_10_C_pid_1,P_ifxi_10_C_pid_2,P_ifxi_10_C_pid_3,P_ifxi_10_C_pid_4,P_ifxi_10_C_pid_5)
normalized: place_bound(P_ifxi_10_C_pid_0,P_ifxi_10_C_pid_1,P_ifxi_10_C_pid_2,P_ifxi_10_C_pid_3,P_ifxi_10_C_pid_4,P_ifxi_10_C_pid_5)

-> the formula is 5

FORMULA LamportFastMutEx-COL-5-UpperBounds-01 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_awaity_C_pid_0,P_awaity_C_pid_1,P_awaity_C_pid_2,P_awaity_C_pid_3,P_awaity_C_pid_4,P_awaity_C_pid_5)
normalized: place_bound(P_awaity_C_pid_0,P_awaity_C_pid_1,P_awaity_C_pid_2,P_awaity_C_pid_3,P_awaity_C_pid_4,P_awaity_C_pid_5)

-> the formula is 4

FORMULA LamportFastMutEx-COL-5-UpperBounds-02 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_setx_3_C_pid_0,P_setx_3_C_pid_1,P_setx_3_C_pid_2,P_setx_3_C_pid_3,P_setx_3_C_pid_4,P_setx_3_C_pid_5)
normalized: place_bound(P_setx_3_C_pid_0,P_setx_3_C_pid_1,P_setx_3_C_pid_2,P_setx_3_C_pid_3,P_setx_3_C_pid_4,P_setx_3_C_pid_5)

-> the formula is 5

FORMULA LamportFastMutEx-COL-5-UpperBounds-03 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_setbi_11_C_pid_0,P_setbi_11_C_pid_1,P_setbi_11_C_pid_2,P_setbi_11_C_pid_3,P_setbi_11_C_pid_4,P_setbi_11_C_pid_5)
normalized: place_bound(P_setbi_11_C_pid_0,P_setbi_11_C_pid_1,P_setbi_11_C_pid_2,P_setbi_11_C_pid_3,P_setbi_11_C_pid_4,P_setbi_11_C_pid_5)

-> the formula is 4

FORMULA LamportFastMutEx-COL-5-UpperBounds-04 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_setbi_5_C_pid_0,P_setbi_5_C_pid_1,P_setbi_5_C_pid_2,P_setbi_5_C_pid_3,P_setbi_5_C_pid_4,P_setbi_5_C_pid_5)
normalized: place_bound(P_setbi_5_C_pid_0,P_setbi_5_C_pid_1,P_setbi_5_C_pid_2,P_setbi_5_C_pid_3,P_setbi_5_C_pid_4,P_setbi_5_C_pid_5)

-> the formula is 4

FORMULA LamportFastMutEx-COL-5-UpperBounds-05 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_ify0_4_C_pid_0,P_ify0_4_C_pid_1,P_ify0_4_C_pid_2,P_ify0_4_C_pid_3,P_ify0_4_C_pid_4,P_ify0_4_C_pid_5)
normalized: place_bound(P_ify0_4_C_pid_0,P_ify0_4_C_pid_1,P_ify0_4_C_pid_2,P_ify0_4_C_pid_3,P_ify0_4_C_pid_4,P_ify0_4_C_pid_5)

-> the formula is 5

FORMULA LamportFastMutEx-COL-5-UpperBounds-06 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_CS_21_C_pid_0,P_CS_21_C_pid_1,P_CS_21_C_pid_2,P_CS_21_C_pid_3,P_CS_21_C_pid_4,P_CS_21_C_pid_5)
normalized: place_bound(P_CS_21_C_pid_0,P_CS_21_C_pid_1,P_CS_21_C_pid_2,P_CS_21_C_pid_3,P_CS_21_C_pid_4,P_CS_21_C_pid_5)

-> the formula is 1

FORMULA LamportFastMutEx-COL-5-UpperBounds-07 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_setbi_24_C_pid_0,P_setbi_24_C_pid_1,P_setbi_24_C_pid_2,P_setbi_24_C_pid_3,P_setbi_24_C_pid_4,P_setbi_24_C_pid_5)
normalized: place_bound(P_setbi_24_C_pid_0,P_setbi_24_C_pid_1,P_setbi_24_C_pid_2,P_setbi_24_C_pid_3,P_setbi_24_C_pid_4,P_setbi_24_C_pid_5)

-> the formula is 5

FORMULA LamportFastMutEx-COL-5-UpperBounds-10 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_fordo_12_C_pid_0,P_fordo_12_C_pid_1,P_fordo_12_C_pid_2,P_fordo_12_C_pid_3,P_fordo_12_C_pid_4,P_fordo_12_C_pid_5)
normalized: place_bound(P_fordo_12_C_pid_0,P_fordo_12_C_pid_1,P_fordo_12_C_pid_2,P_fordo_12_C_pid_3,P_fordo_12_C_pid_4,P_fordo_12_C_pid_5)

-> the formula is 4

FORMULA LamportFastMutEx-COL-5-UpperBounds-11 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_sety_9_C_pid_0,P_sety_9_C_pid_1,P_sety_9_C_pid_2,P_sety_9_C_pid_3,P_sety_9_C_pid_4,P_sety_9_C_pid_5)
normalized: place_bound(P_sety_9_C_pid_0,P_sety_9_C_pid_1,P_sety_9_C_pid_2,P_sety_9_C_pid_3,P_sety_9_C_pid_4,P_sety_9_C_pid_5)

-> the formula is 5

FORMULA LamportFastMutEx-COL-5-UpperBounds-12 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_ifyi_15_C_pid_0,P_ifyi_15_C_pid_1,P_ifyi_15_C_pid_2,P_ifyi_15_C_pid_3,P_ifyi_15_C_pid_4,P_ifyi_15_C_pid_5)
normalized: place_bound(P_ifyi_15_C_pid_0,P_ifyi_15_C_pid_1,P_ifyi_15_C_pid_2,P_ifyi_15_C_pid_3,P_ifyi_15_C_pid_4,P_ifyi_15_C_pid_5)

-> the formula is 4

FORMULA LamportFastMutEx-COL-5-UpperBounds-13 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(y_C_pid_0,y_C_pid_1,y_C_pid_2,y_C_pid_3,y_C_pid_4,y_C_pid_5)
normalized: place_bound(y_C_pid_0,y_C_pid_1,y_C_pid_2,y_C_pid_3,y_C_pid_4,y_C_pid_5)

-> the formula is 1

FORMULA LamportFastMutEx-COL-5-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(x_C_pid_0,x_C_pid_1,x_C_pid_2,x_C_pid_3,x_C_pid_4,x_C_pid_5)
normalized: place_bound(x_C_pid_0,x_C_pid_1,x_C_pid_2,x_C_pid_3,x_C_pid_4,x_C_pid_5)

-> the formula is 1

FORMULA LamportFastMutEx-COL-5-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_b_C_pid_0_C_bool_false,P_b_C_pid_0_C_bool_true,P_b_C_pid_1_C_bool_false,P_b_C_pid_1_C_bool_true,P_b_C_pid_2_C_bool_false,P_b_C_pid_2_C_bool_true,P_b_C_pid_3_C_bool_false,P_b_C_pid_3_C_bool_true,P_b_C_pid_4_C_bool_false,P_b_C_pid_4_C_bool_true,P_b_C_pid_5_C_bool_false,P_b_C_pid_5_C_bool_true)
normalized: place_bound(P_b_C_pid_0_C_bool_false,P_b_C_pid_0_C_bool_true,P_b_C_pid_1_C_bool_false,P_b_C_pid_1_C_bool_true,P_b_C_pid_2_C_bool_false,P_b_C_pid_2_C_bool_true,P_b_C_pid_3_C_bool_false,P_b_C_pid_3_C_bool_true,P_b_C_pid_4_C_bool_false,P_b_C_pid_4_C_bool_true,P_b_C_pid_5_C_bool_false,P_b_C_pid_5_C_bool_true)

-> the formula is 5

FORMULA LamportFastMutEx-COL-5-UpperBounds-09 5 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(P_done_C_pid_0_C_pid_0,P_done_C_pid_0_C_pid_1,P_done_C_pid_0_C_pid_2,P_done_C_pid_0_C_pid_3,P_done_C_pid_0_C_pid_4,P_done_C_pid_0_C_pid_5,P_done_C_pid_1_C_pid_0,P_done_C_pid_1_C_pid_1,P_done_C_pid_1_C_pid_2,P_done_C_pid_1_C_pid_3,P_done_C_pid_1_C_pid_4,P_done_C_pid_1_C_pid_5,P_done_C_pid_2_C_pid_0,P_done_C_pid_2_C_pid_1,P_done_C_pid_2_C_pid_2,P_done_C_pid_2_C_pid_3,P_done_C_pid_2_C_pid_4,P_done_C_pid_2_C_pid_5,P_done_C_pid_3_C_pid_0,P_done_C_pid_3_C_pid_1,P_done_C_pid_3_C_pid_2,P_done_C_pid_3_C_pid_3,P_done_C_pid_3_C_pid_4,P_done_C_pid_3_C_pid_5,P_done_C_pid_4_C_pid_0,P_done_C_pid_4_C_pid_1,P_done_C_pid_4_C_pid_2,P_done_C_pid_4_C_pid_3,P_done_C_pid_4_C_pid_4,P_done_C_pid_4_C_pid_5,P_done_C_pid_5_C_pid_0,P_done_C_pid_5_C_pid_1,P_done_C_pid_5_C_pid_2,P_done_C_pid_5_C_pid_3,P_done_C_pid_5_C_pid_4,P_done_C_pid_5_C_pid_5)
normalized: place_bound(P_done_C_pid_0_C_pid_0,P_done_C_pid_0_C_pid_1,P_done_C_pid_0_C_pid_2,P_done_C_pid_0_C_pid_3,P_done_C_pid_0_C_pid_4,P_done_C_pid_0_C_pid_5,P_done_C_pid_1_C_pid_0,P_done_C_pid_1_C_pid_1,P_done_C_pid_1_C_pid_2,P_done_C_pid_1_C_pid_3,P_done_C_pid_1_C_pid_4,P_done_C_pid_1_C_pid_5,P_done_C_pid_2_C_pid_0,P_done_C_pid_2_C_pid_1,P_done_C_pid_2_C_pid_2,P_done_C_pid_2_C_pid_3,P_done_C_pid_2_C_pid_4,P_done_C_pid_2_C_pid_5,P_done_C_pid_3_C_pid_0,P_done_C_pid_3_C_pid_1,P_done_C_pid_3_C_pid_2,P_done_C_pid_3_C_pid_3,P_done_C_pid_3_C_pid_4,P_done_C_pid_3_C_pid_5,P_done_C_pid_4_C_pid_0,P_done_C_pid_4_C_pid_1,P_done_C_pid_4_C_pid_2,P_done_C_pid_4_C_pid_3,P_done_C_pid_4_C_pid_4,P_done_C_pid_4_C_pid_5,P_done_C_pid_5_C_pid_0,P_done_C_pid_5_C_pid_1,P_done_C_pid_5_C_pid_2,P_done_C_pid_5_C_pid_3,P_done_C_pid_5_C_pid_4,P_done_C_pid_5_C_pid_5)

-> the formula is 20

FORMULA LamportFastMutEx-COL-5-UpperBounds-08 20 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 6694586 (6.7e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 177314886 611073073 788387959
used/not used/entry size/cache size: 67083454 25410 16 1024MB
basic ops cache: hits/miss/sum: 612654 2613384 3226038
used/not used/entry size/cache size: 3379986 13397230 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 162021 669112 831133
used/not used/entry size/cache size: 643505 7745103 32 256MB
max state cache: hits/miss/sum: 2592336 10705792 13298128
used/not used/entry size/cache size: 643505 7745103 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 61363775
1 4946186
2 668406
3 112715
4 15795
5 1807
6 166
7 13
8 1
9 0
>= 10 0

Total processing time: 3m49.393sec


BK_STOP 1678619040599

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
P_await_13_C_pid_0
P_fordo_12_C_pid_0
P_CS_21_C_pid_0
P_done_C_pid_4_C_pid_0
P_done_C_pid_1_C_pid_0
P_done_C_pid_0_C_pid_5
P_done_C_pid_2_C_pid_0
P_ifxi_10_C_pid_0
P_done_C_pid_3_C_pid_0
P_done_C_pid_0_C_pid_2
P_done_C_pid_0_C_pid_0
P_done_C_pid_0_C_pid_1
P_b_C_pid_0_C_bool_true
P_b_C_pid_0_C_bool_false
P_awaity_C_pid_0
P_done_C_pid_0_C_pid_4
P_done_C_pid_0_C_pid_3
P_wait_C_pid_0_C_pid_3
P_done_C_pid_5_C_pid_0
P_wait_C_pid_0_C_pid_4
P_wait_C_pid_0_C_pid_5
P_wait_C_pid_1_C_pid_0
P_wait_C_pid_2_C_pid_0
P_wait_C_pid_3_C_pid_0
P_ify0_4_C_pid_0
P_ifyi_15_C_pid_0
P_setbi_5_C_pid_0
P_setbi_11_C_pid_0
P_setbi_24_C_pid_0
P_setx_3_C_pid_0
P_sety_9_C_pid_0
P_start_1_C_pid_0
P_wait_C_pid_0_C_pid_0
P_wait_C_pid_0_C_pid_1
P_wait_C_pid_0_C_pid_2
P_wait_C_pid_4_C_pid_0
P_wait_C_pid_5_C_pid_0

The net has transition(s) that can never fire:
T_setbi_2_0_0
T_setbi_2_1_0
T_setx_3_0_5
T_setx_3_0_0
T_setx_3_0_1
T_setx_3_0_2
T_setx_3_0_3
T_setx_3_0_4
T_yne0_4_0_1
T_yne0_4_0_2
T_yne0_4_0_3
T_yne0_4_0_4
T_yne0_4_0_5
T_yeqi_15_0_0
T_ynei_15_0_5
T_setbi_5_0_0
T_setbi_5_1_0
T_awaity_0
T_yeq0_4_0
T_sety_9_0_0
T_sety_9_0_1
T_sety_9_0_2
T_sety_9_0_3
T_sety_9_0_4
T_sety_9_0_5
T_xeqi_10_0_0
T_xnei_10_0_1
T_xnei_10_0_2
T_xnei_10_0_3
T_xnei_10_0_4
T_xnei_10_0_5
T_setbi_11_0_0
T_setbi_11_1_0
T_fordo_12_0
T_await_13_0_0
T_await_13_0_1
T_await_13_0_2
T_await_13_0_3
T_await_13_0_4
T_await_13_0_5
T_await_13_1_0
T_await_13_2_0
T_await_13_3_0
T_await_13_4_0
T_await_13_5_0
T_forod_13_0
T_ynei_15_0_1
T_ynei_15_0_2
T_ynei_15_0_3
T_ynei_15_0_4
T_sety0_23_0_0
T_sety0_23_0_1
T_sety0_23_0_2
T_sety0_23_0_3
T_sety0_23_0_4
T_sety0_23_0_5
T_setbi_24_0_0
T_setbi_24_1_0

check for constant places
ok
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: 0m 0.000sec

55913 114389 151004 161858 283801 546251 608617 611911 689516
iterations count:908426 (2856), effective:13861 (43)

initing FirstDep: 0m 0.001sec

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.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="LamportFastMutEx-COL-5"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool marcie"
echo " Input is LamportFastMutEx-COL-5, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r225-tall-167856407500365"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/LamportFastMutEx-COL-5.tgz
mv LamportFastMutEx-COL-5 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;