About the Execution of MARCIE for IBM5964-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
7484.370 | 5953.00 | 5980.00 | 20.00 | TFFTFTFTTFFFTFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
.......
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is IBM5964-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473800084
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME IBM5964-PT-none-CTLCardinality-0
FORMULA_NAME IBM5964-PT-none-CTLCardinality-1
FORMULA_NAME IBM5964-PT-none-CTLCardinality-10
FORMULA_NAME IBM5964-PT-none-CTLCardinality-11
FORMULA_NAME IBM5964-PT-none-CTLCardinality-12
FORMULA_NAME IBM5964-PT-none-CTLCardinality-13
FORMULA_NAME IBM5964-PT-none-CTLCardinality-14
FORMULA_NAME IBM5964-PT-none-CTLCardinality-15
FORMULA_NAME IBM5964-PT-none-CTLCardinality-2
FORMULA_NAME IBM5964-PT-none-CTLCardinality-3
FORMULA_NAME IBM5964-PT-none-CTLCardinality-4
FORMULA_NAME IBM5964-PT-none-CTLCardinality-5
FORMULA_NAME IBM5964-PT-none-CTLCardinality-6
FORMULA_NAME IBM5964-PT-none-CTLCardinality-7
FORMULA_NAME IBM5964-PT-none-CTLCardinality-8
FORMULA_NAME IBM5964-PT-none-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1494452225579
timeout --kill-after=10s --signal=SIGINT 1m for testing only
Marcie rev. 8852M (built: crohr on 2017-05-03)
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 --mcc-file=CTLCardinality.xml --memory=6
parse successfull
net created successfully
Net: IBM5964_PT_none
(NrP: 263 NrTr: 139 NrArc: 541)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.004sec
net check time: 0m 0.000sec
init dd package: 0m 0.983sec
RS generation: 0m 0.010sec
-> last computed set: #nodes 19 (1.9e+01) #states 3
parse successfull
net created successfully
Net: IBM5964_PT_none
(NrP: 263 NrTr: 139 NrArc: 541)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec
net check time: 0m 0.000sec
init dd package: 0m 3.366sec
RS generation: 0m 0.043sec
-> reachability set: #nodes 1027 (1.0e+03) #states 15,546 (4)
starting MCC model checker
--------------------------
checking: EF [3<=callToTask_s00002185_output_s00000956]
normalized: E [true U 3<=callToTask_s00002185_output_s00000956]
abstracting: (3<=callToTask_s00002185_output_s00000956)
states: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AF [EX [~ [callToTask_s00005970_input_s00000935<=callToTask_s00002185_input_s00000950]]]
normalized: ~ [EG [~ [EX [~ [callToTask_s00005970_input_s00000935<=callToTask_s00002185_input_s00000950]]]]]
abstracting: (callToTask_s00005970_input_s00000935<=callToTask_s00002185_input_s00000950)
states: 15,546 (4)
.
EG iterations: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: ~ [~ [[AF [1<=merge_s00000945_activated] | EG [2<=callToTask_s00002427_input_s00001203]]]]
normalized: [~ [EG [~ [1<=merge_s00000945_activated]]] | EG [2<=callToTask_s00002427_input_s00001203]]
abstracting: (2<=callToTask_s00002427_input_s00001203)
states: 0
.
EG iterations: 1
abstracting: (1<=merge_s00000945_activated)
states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: AG [AF [[1<=callToTask_s00002427_input_s00001013 | callToProcess_s00002411_output_s00000981<=callToTask_s00005972_input_s00000950]]]
normalized: ~ [E [true U EG [~ [[1<=callToTask_s00002427_input_s00001013 | callToProcess_s00002411_output_s00000981<=callToTask_s00005972_input_s00000950]]]]]
abstracting: (callToProcess_s00002411_output_s00000981<=callToTask_s00005972_input_s00000950)
states: 15,546 (4)
abstracting: (1<=callToTask_s00002427_input_s00001013)
states: 763
.
EG iterations: 1
-> the formula is TRUE
FORMULA IBM5964-PT-none-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: E [decision_s00000999_activated<=callToTask_s00005972_output_s00000979 U 3<=callToTask_s00002185_input_s00000952]
normalized: E [decision_s00000999_activated<=callToTask_s00005972_output_s00000979 U 3<=callToTask_s00002185_input_s00000952]
abstracting: (3<=callToTask_s00002185_input_s00000952)
states: 0
abstracting: (decision_s00000999_activated<=callToTask_s00005972_output_s00000979)
states: 15,546 (4)
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [A [process_s00000383__s00005964_outputCriterion_s00000939_omega<=callToProcess_s00004075_input_s00000950 U 2<=callToTask_s00005849_input_s00000950]]
normalized: E [true U [~ [E [~ [2<=callToTask_s00005849_input_s00000950] U [~ [process_s00000383__s00005964_outputCriterion_s00000939_omega<=callToProcess_s00004075_input_s00000950] & ~ [2<=callToTask_s00005849_input_s00000950]]]] & ~ [EG [~ [2<=callToTask_s00005849_input_s00000950]]]]]
abstracting: (2<=callToTask_s00005849_input_s00000950)
states: 0
EG iterations: 0
abstracting: (2<=callToTask_s00005849_input_s00000950)
states: 0
abstracting: (process_s00000383__s00005964_outputCriterion_s00000939_omega<=callToProcess_s00004075_input_s00000950)
states: 15,546 (4)
abstracting: (2<=callToTask_s00005849_input_s00000950)
states: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [1<=process_s00000383__s00005964_input_s00000936 | AG [EG [callToTask_s00005972_input_s00001009<=callToTask_s00002190_output_s00000956]]]
normalized: [~ [E [true U ~ [EG [callToTask_s00005972_input_s00001009<=callToTask_s00002190_output_s00000956]]]] | 1<=process_s00000383__s00005964_input_s00000936]
abstracting: (1<=process_s00000383__s00005964_input_s00000936)
states: 15,545 (4)
abstracting: (callToTask_s00005972_input_s00001009<=callToTask_s00002190_output_s00000956)
states: 15,546 (4)
EG iterations: 0
-> the formula is TRUE
FORMULA IBM5964-PT-none-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [[[~ [2<=callToTask_s00005972_output_s00000979] | ~ [callToProcess_s00002411_input_s00000950<=callToTask_s00002427_output_s00000979]] & AG [merge_s00000945_input_s00000986<=callToTask_s00005849_input_s00000952]]]
normalized: ~ [EG [~ [[[~ [callToProcess_s00002411_input_s00000950<=callToTask_s00002427_output_s00000979] | ~ [2<=callToTask_s00005972_output_s00000979]] & ~ [E [true U ~ [merge_s00000945_input_s00000986<=callToTask_s00005849_input_s00000952]]]]]]]
abstracting: (merge_s00000945_input_s00000986<=callToTask_s00005849_input_s00000952)
states: 15,546 (4)
abstracting: (2<=callToTask_s00005972_output_s00000979)
states: 0
abstracting: (callToProcess_s00002411_input_s00000950<=callToTask_s00002427_output_s00000979)
states: 15,546 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA IBM5964-PT-none-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EF [[[callToTask_s00005897_inputCriterion_s00000937_used<=callToProcess_s00004075_input_s00000950 & 3<=callToTask_s00002741_output_s00000960] | [3<=endNode_s00000942_input_default | 1<=callToTask_s00002427_output_s00000938]]]]
normalized: ~ [E [true U [[3<=endNode_s00000942_input_default | 1<=callToTask_s00002427_output_s00000938] | [callToTask_s00005897_inputCriterion_s00000937_used<=callToProcess_s00004075_input_s00000950 & 3<=callToTask_s00002741_output_s00000960]]]]
abstracting: (3<=callToTask_s00002741_output_s00000960)
states: 0
abstracting: (callToTask_s00005897_inputCriterion_s00000937_used<=callToProcess_s00004075_input_s00000950)
states: 10,618 (4)
abstracting: (1<=callToTask_s00002427_output_s00000938)
states: 0
abstracting: (3<=endNode_s00000942_input_default)
states: 0
-> the formula is TRUE
FORMULA IBM5964-PT-none-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [~ [[[callToProcess_s00002411_input_s00000935<=callToProcess_s00002316_inputCriterion_s00000937_used & 2<=callToTask_s00005970_output_s00000956] & ~ [fork_s00001067_input_s00000950<=callToTask_s00005969_output_s00000938]]]]
normalized: ~ [E [true U [[callToProcess_s00002411_input_s00000935<=callToProcess_s00002316_inputCriterion_s00000937_used & 2<=callToTask_s00005970_output_s00000956] & ~ [fork_s00001067_input_s00000950<=callToTask_s00005969_output_s00000938]]]]
abstracting: (fork_s00001067_input_s00000950<=callToTask_s00005969_output_s00000938)
states: 15,546 (4)
abstracting: (2<=callToTask_s00005970_output_s00000956)
states: 0
abstracting: (callToProcess_s00002411_input_s00000935<=callToProcess_s00002316_inputCriterion_s00000937_used)
states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [EF [[[3<=callToTask_s00005968_output_s00000979 | 2<=callToTask_s00002181_output_s00000979] & [1<=callToTask_s00002189_output_s00000960 & process_s00000383__s00005964_input_s00001609<=callToTask_s00005969_input_s00000935]]] | 2<=callToTask_s00005972_input_s00001009]
normalized: [E [true U [[1<=callToTask_s00002189_output_s00000960 & process_s00000383__s00005964_input_s00001609<=callToTask_s00005969_input_s00000935] & [3<=callToTask_s00005968_output_s00000979 | 2<=callToTask_s00002181_output_s00000979]]] | 2<=callToTask_s00005972_input_s00001009]
abstracting: (2<=callToTask_s00005972_input_s00001009)
states: 0
abstracting: (2<=callToTask_s00002181_output_s00000979)
states: 0
abstracting: (3<=callToTask_s00005968_output_s00000979)
states: 0
abstracting: (process_s00000383__s00005964_input_s00001609<=callToTask_s00005969_input_s00000935)
states: 4,579 (3)
abstracting: (1<=callToTask_s00002189_output_s00000960)
states: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [merge_s00000945_input_s00000987<=callToTask_s00005897_output_s00000938 U ~ [[callToTask_s00002741_inputCriterion_s00000937_used<=fork_s00001067_activated_s00000991 | callToTask_s00001632_output_s00000959<=callToProcess_s00002538_input_s00001011]]]
normalized: E [merge_s00000945_input_s00000987<=callToTask_s00005897_output_s00000938 U ~ [[callToTask_s00002741_inputCriterion_s00000937_used<=fork_s00001067_activated_s00000991 | callToTask_s00001632_output_s00000959<=callToProcess_s00002538_input_s00001011]]]
abstracting: (callToTask_s00001632_output_s00000959<=callToProcess_s00002538_input_s00001011)
states: 15,546 (4)
abstracting: (callToTask_s00002741_inputCriterion_s00000937_used<=fork_s00001067_activated_s00000991)
states: 15,546 (4)
abstracting: (merge_s00000945_input_s00000987<=callToTask_s00005897_output_s00000938)
states: 15,546 (4)
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[[callToTask_s00002526_output_s00000981<=callToTask_s00001971_output_s00000938 & merge_s00001290_input_s00000950<=decision_s00001618_activated] | merge_s00001120_input_s00000950<=merge_s00001120_input_s00001010] & EX [2<=process_s00000383__s00005964_output_s00001463]]]
normalized: E [true U [[[callToTask_s00002526_output_s00000981<=callToTask_s00001971_output_s00000938 & merge_s00001290_input_s00000950<=decision_s00001618_activated] | merge_s00001120_input_s00000950<=merge_s00001120_input_s00001010] & EX [2<=process_s00000383__s00005964_output_s00001463]]]
abstracting: (2<=process_s00000383__s00005964_output_s00001463)
states: 0
.abstracting: (merge_s00001120_input_s00000950<=merge_s00001120_input_s00001010)
states: 15,546 (4)
abstracting: (merge_s00001290_input_s00000950<=decision_s00001618_activated)
states: 10,709 (4)
abstracting: (callToTask_s00002526_output_s00000981<=callToTask_s00001971_output_s00000938)
states: 15,546 (4)
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [[~ [[[callToTask_s00002186_input_s00001011<=callToTask_s00005967_input_s00000952 & 1<=callToTask_s00002427_output_s00000938] & 3<=callToProcess_s00002538_inputCriterion_s00000937_used]] & E [2<=process_s00000383__s00005964_outputCriterion_s00000939_omega U callToTask_s00002183_output_s00000938<=callToTask_s00005972_input_s00000935]] & AG [~ [[fork_s00001536_activated_s00000993<=process_s00000383__s00005964_output_s00001463 & 2<=callToTask_s00002186_inputCriterion_s00000937_used]]]]
normalized: [~ [E [true U [fork_s00001536_activated_s00000993<=process_s00000383__s00005964_output_s00001463 & 2<=callToTask_s00002186_inputCriterion_s00000937_used]]] & [~ [[[callToTask_s00002186_input_s00001011<=callToTask_s00005967_input_s00000952 & 1<=callToTask_s00002427_output_s00000938] & 3<=callToProcess_s00002538_inputCriterion_s00000937_used]] & E [2<=process_s00000383__s00005964_outputCriterion_s00000939_omega U callToTask_s00002183_output_s00000938<=callToTask_s00005972_input_s00000935]]]
abstracting: (callToTask_s00002183_output_s00000938<=callToTask_s00005972_input_s00000935)
states: 15,546 (4)
abstracting: (2<=process_s00000383__s00005964_outputCriterion_s00000939_omega)
states: 0
abstracting: (3<=callToProcess_s00002538_inputCriterion_s00000937_used)
states: 0
abstracting: (1<=callToTask_s00002427_output_s00000938)
states: 0
abstracting: (callToTask_s00002186_input_s00001011<=callToTask_s00005967_input_s00000952)
states: 15,546 (4)
abstracting: (2<=callToTask_s00002186_inputCriterion_s00000937_used)
states: 0
abstracting: (fork_s00001536_activated_s00000993<=process_s00000383__s00005964_output_s00001463)
states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: [AF [[~ [decision_s00001288_activated<=merge_s00001120_input_s00001010] & ~ [callToTask_s00005849_output_s00000960<=fork_s00001293_activated_s00000993]]] & ~ [[[[1<=callToTask_s00001971_input_s00000985 | 3<=callToTask_s00005965_input_s00000950] & [callToTask_s00001632_output_s00000979<=callToTask_s00002181_output_s00000938 | callToTask_s00002185_output_s00000956<=callToTask_s00005969_input_s00000935]] & merge_s00001066_activated<=callToTask_s00001971_output_s00000938]]]
normalized: [~ [[[[1<=callToTask_s00001971_input_s00000985 | 3<=callToTask_s00005965_input_s00000950] & [callToTask_s00001632_output_s00000979<=callToTask_s00002181_output_s00000938 | callToTask_s00002185_output_s00000956<=callToTask_s00005969_input_s00000935]] & merge_s00001066_activated<=callToTask_s00001971_output_s00000938]] & ~ [EG [~ [[~ [callToTask_s00005849_output_s00000960<=fork_s00001293_activated_s00000993] & ~ [decision_s00001288_activated<=merge_s00001120_input_s00001010]]]]]]
abstracting: (decision_s00001288_activated<=merge_s00001120_input_s00001010)
states: 15,546 (4)
abstracting: (callToTask_s00005849_output_s00000960<=fork_s00001293_activated_s00000993)
states: 15,546 (4)
EG iterations: 0
abstracting: (merge_s00001066_activated<=callToTask_s00001971_output_s00000938)
states: 15,546 (4)
abstracting: (callToTask_s00002185_output_s00000956<=callToTask_s00005969_input_s00000935)
states: 15,546 (4)
abstracting: (callToTask_s00001632_output_s00000979<=callToTask_s00002181_output_s00000938)
states: 15,546 (4)
abstracting: (3<=callToTask_s00005965_input_s00000950)
states: 0
abstracting: (1<=callToTask_s00001971_input_s00000985)
states: 0
-> the formula is FALSE
FORMULA IBM5964-PT-none-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [[[AG [callToTask_s00001971_output_s00000979<=callToTask_s00001632_inputCriterion_s00000937_used] | [callToTask_s00005967_output_s00000938<=process_s00000383__s00005964_input_s00001512 & 1<=merge_s00001290_activated]] & EF [[callToTask_s00002427_output_s00000979<=callToTask_s00005965_input_s00000950 & callToProcess_s00004075_input_s00000950<=callToTask_s00002741_input_s00000986]]] | [[[callToTask_s00005967_inputCriterion_s00000937_used<=callToTask_s00005970_output_s00000979 | [callToTask_s00002190_output_s00000979<=callToTask_s00002427_input_s00000952 & 2<=merge_s00000945_input_s00000935]] | ~ [[2<=callToTask_s00001746_output_s00000956 | merge_s00001290_input_s00001009<=callToTask_s00005967_output_s00000938]]] & [EG [callToTask_s00001632_output_s00000979<=process_s00000383__s00005964_output_s00001610] | EF [1<=callToTask_s00005967_output_s00000979]]]]
normalized: [[E [true U [callToTask_s00002427_output_s00000979<=callToTask_s00005965_input_s00000950 & callToProcess_s00004075_input_s00000950<=callToTask_s00002741_input_s00000986]] & [~ [E [true U ~ [callToTask_s00001971_output_s00000979<=callToTask_s00001632_inputCriterion_s00000937_used]]] | [callToTask_s00005967_output_s00000938<=process_s00000383__s00005964_input_s00001512 & 1<=merge_s00001290_activated]]] | [[[[callToTask_s00002190_output_s00000979<=callToTask_s00002427_input_s00000952 & 2<=merge_s00000945_input_s00000935] | callToTask_s00005967_inputCriterion_s00000937_used<=callToTask_s00005970_output_s00000979] | ~ [[2<=callToTask_s00001746_output_s00000956 | merge_s00001290_input_s00001009<=callToTask_s00005967_output_s00000938]]] & [E [true U 1<=callToTask_s00005967_output_s00000979] | EG [callToTask_s00001632_output_s00000979<=process_s00000383__s00005964_output_s00001610]]]]
abstracting: (callToTask_s00001632_output_s00000979<=process_s00000383__s00005964_output_s00001610)
states: 15,546 (4)
EG iterations: 0
abstracting: (1<=callToTask_s00005967_output_s00000979)
states: 0
abstracting: (merge_s00001290_input_s00001009<=callToTask_s00005967_output_s00000938)
states: 13,355 (4)
abstracting: (2<=callToTask_s00001746_output_s00000956)
states: 0
abstracting: (callToTask_s00005967_inputCriterion_s00000937_used<=callToTask_s00005970_output_s00000979)
states: 15,546 (4)
abstracting: (2<=merge_s00000945_input_s00000935)
states: 0
abstracting: (callToTask_s00002190_output_s00000979<=callToTask_s00002427_input_s00000952)
states: 15,546 (4)
abstracting: (1<=merge_s00001290_activated)
states: 2,888 (3)
abstracting: (callToTask_s00005967_output_s00000938<=process_s00000383__s00005964_input_s00001512)
states: 15,546 (4)
abstracting: (callToTask_s00001971_output_s00000979<=callToTask_s00001632_inputCriterion_s00000937_used)
states: 15,546 (4)
abstracting: (callToProcess_s00004075_input_s00000950<=callToTask_s00002741_input_s00000986)
states: 15,546 (4)
abstracting: (callToTask_s00002427_output_s00000979<=callToTask_s00005965_input_s00000950)
states: 15,546 (4)
-> the formula is TRUE
FORMULA IBM5964-PT-none-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
totally nodes used: 65498 (6.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 13925 140986 154911
used/not used/entry size/cache size: 165499 66943365 16 1024MB
basic ops cache: hits/miss/sum: 3981 56605 60586
used/not used/entry size/cache size: 133148 16644068 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: 1310 3929 5239
used/not used/entry size/cache size: 3929 8384679 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67043822
1 64609
2 424
3 2
4 3
5 1
6 3
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.873sec
BK_STOP 1494452231532
--------------------
content from stderr:
check for maximal unmarked siphon
ok
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.001sec
zbdd.cc:1122: Boundedness exception: net is not 1-bounded!
check for maximal unmarked siphon
ok
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.001sec
iterations count:378 (2), effective:51 (0)
initing FirstDep: 0m 0.000sec
iterations count:139 (1), effective:0 (0)
iterations count:139 (1), effective:0 (0)
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="IBM5964-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# 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
tar xzf /home/mcc/BenchKit/INPUTS/IBM5964-PT-none.tgz
mv IBM5964-PT-none execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is IBM5964-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r031-blw7-149440473800084"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '
echo "FORMULA_NAME $x"
done
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 ;