About the Execution of Marcie for IBM319-PT-none
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3996.070 | 6374.00 | 5990.00 | 30.00 | FFFTFFTTFTTTFTTF | 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-2270
Executing tool marcie
Input is IBM319-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700041
=====================================================================
--------------------
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 IBM319-PT-none-CTLCardinality-0
FORMULA_NAME IBM319-PT-none-CTLCardinality-1
FORMULA_NAME IBM319-PT-none-CTLCardinality-10
FORMULA_NAME IBM319-PT-none-CTLCardinality-11
FORMULA_NAME IBM319-PT-none-CTLCardinality-12
FORMULA_NAME IBM319-PT-none-CTLCardinality-13
FORMULA_NAME IBM319-PT-none-CTLCardinality-14
FORMULA_NAME IBM319-PT-none-CTLCardinality-15
FORMULA_NAME IBM319-PT-none-CTLCardinality-2
FORMULA_NAME IBM319-PT-none-CTLCardinality-3
FORMULA_NAME IBM319-PT-none-CTLCardinality-4
FORMULA_NAME IBM319-PT-none-CTLCardinality-5
FORMULA_NAME IBM319-PT-none-CTLCardinality-6
FORMULA_NAME IBM319-PT-none-CTLCardinality-7
FORMULA_NAME IBM319-PT-none-CTLCardinality-8
FORMULA_NAME IBM319-PT-none-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433633089290
Model: IBM319-PT-none
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5
Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 253 NrTr: 178 NrArc: 526)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m0sec
-> reachability set: #nodes 1063 (1.1e+03) #states 2,482 (3)
starting MCC model checker
--------------------------
checking: [[[[[callToTask_s00002951_output_s00001054<=callToTask_s00002952_output_s00001077 & 1<=callToTask_s00002869_output_s00001077] | [callToTask_s00002963_input_s00001066<=callToProcess_s00002121_output_s00001054 | 1<=callToProcess_s00002038_output_s00001077]] & ~ [callToProcess_s00002943_inputCriterion_s00001053_used<=callToTask_s00002063_input_s00001052]] | A [callToTask_s00002063_inputCriterion_s00001053_used<=decision_s00001841_input_s00001052 U 3<=merge_s00001160_activated]] | E [[merge_s00002240_input_s00001052<=callToTask_s00002965_input_s00001066 & callToTask_s00002958_output_s00001077<=callToTask_s00001406_output_s00001077] U [3<=callToTask_s00001406_input_s00001066 | 3<=callToTask_s00002961_output_s00001077]]]
normalized: [[[[[callToTask_s00002951_output_s00001054<=callToTask_s00002952_output_s00001077 & 1<=callToTask_s00002869_output_s00001077] | [callToTask_s00002963_input_s00001066<=callToProcess_s00002121_output_s00001054 | 1<=callToProcess_s00002038_output_s00001077]] & ~ [callToProcess_s00002943_inputCriterion_s00001053_used<=callToTask_s00002063_input_s00001052]] | [~ [E [~ [callToTask_s00002063_inputCriterion_s00001053_used<=decision_s00001841_input_s00001052] U [~ [3<=merge_s00001160_activated] & ~ [callToTask_s00002063_inputCriterion_s00001053_used<=decision_s00001841_input_s00001052]]]] & ~ [EG [~ [3<=merge_s00001160_activated]]]]] | E [[merge_s00002240_input_s00001052<=callToTask_s00002965_input_s00001066 & callToTask_s00002958_output_s00001077<=callToTask_s00001406_output_s00001077] U [3<=callToTask_s00001406_input_s00001066 | 3<=callToTask_s00002961_output_s00001077]]]
abstracting: (3<=callToTask_s00002961_output_s00001077) states: 0
abstracting: (3<=callToTask_s00001406_input_s00001066) states: 0
abstracting: (callToTask_s00002958_output_s00001077<=callToTask_s00001406_output_s00001077) states: 2,479 (3)
abstracting: (merge_s00002240_input_s00001052<=callToTask_s00002965_input_s00001066) states: 2,437 (3)
abstracting: (3<=merge_s00001160_activated) states: 0
EG iterations: 0
abstracting: (callToTask_s00002063_inputCriterion_s00001053_used<=decision_s00001841_input_s00001052) states: 2,479 (3)
abstracting: (3<=merge_s00001160_activated) states: 0
abstracting: (callToTask_s00002063_inputCriterion_s00001053_used<=decision_s00001841_input_s00001052) states: 2,479 (3)
abstracting: (callToProcess_s00002943_inputCriterion_s00001053_used<=callToTask_s00002063_input_s00001052) states: 2,479 (3)
abstracting: (1<=callToProcess_s00002038_output_s00001077) states: 3
abstracting: (callToTask_s00002963_input_s00001066<=callToProcess_s00002121_output_s00001054) states: 2,479 (3)
abstracting: (1<=callToTask_s00002869_output_s00001077) states: 1
abstracting: (callToTask_s00002951_output_s00001054<=callToTask_s00002952_output_s00001077) states: 2,479 (3)
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[EG [3<=callToTask_s00002955_inputCriterion_s00001053_used] | A [callToTask_s00002951_inputCriterion_s00001053_used<=callToTask_s00002955_output_s00001054 U 2<=callToTask_s00002964_input_s00001066]] | E [[1<=callToTask_s00002931_inputCriterion_s00001053_used | 3<=merge_s00001162_activated] U ~ [callToProcess_s00002038_output_s00001077<=callToProcess_s00002944_output_s00001054]]]
normalized: [E [[1<=callToTask_s00002931_inputCriterion_s00001053_used | 3<=merge_s00001162_activated] U ~ [callToProcess_s00002038_output_s00001077<=callToProcess_s00002944_output_s00001054]] | [EG [3<=callToTask_s00002955_inputCriterion_s00001053_used] | [~ [E [~ [callToTask_s00002951_inputCriterion_s00001053_used<=callToTask_s00002955_output_s00001054] U [~ [2<=callToTask_s00002964_input_s00001066] & ~ [callToTask_s00002951_inputCriterion_s00001053_used<=callToTask_s00002955_output_s00001054]]]] & ~ [EG [~ [2<=callToTask_s00002964_input_s00001066]]]]]]
abstracting: (2<=callToTask_s00002964_input_s00001066) states: 0
EG iterations: 0
abstracting: (callToTask_s00002951_inputCriterion_s00001053_used<=callToTask_s00002955_output_s00001054) states: 2,479 (3)
abstracting: (2<=callToTask_s00002964_input_s00001066) states: 0
abstracting: (callToTask_s00002951_inputCriterion_s00001053_used<=callToTask_s00002955_output_s00001054) states: 2,479 (3)
abstracting: (3<=callToTask_s00002955_inputCriterion_s00001053_used) states: 0
.
EG iterations: 1
abstracting: (callToProcess_s00002038_output_s00001077<=callToProcess_s00002944_output_s00001054) states: 2,479 (3)
abstracting: (3<=merge_s00001162_activated) states: 0
abstracting: (1<=callToTask_s00002931_inputCriterion_s00001053_used) states: 150
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [EG [1<=callToProcess_s00002499_input_s00001052]]
normalized: ~ [EG [~ [EG [1<=callToProcess_s00002499_input_s00001052]]]]
abstracting: (1<=callToProcess_s00002499_input_s00001052) states: 3
...
EG iterations: 3
EG iterations: 0
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [AF [~ [callToTask_s00002964_input_s00001066<=callToTask_s00002959_output_s00001077]]] | [callToTask_s00002964_output_s00001054<=join_s00001164_input_s00001068 & [[[3<=callToTask_s00002965_input_s00001066 | 2<=callToTask_s00002957_output_s00001054] | [callToTask_s00002952_output_s00001077<=callToTask_s00002951_input_s00001066 & 2<=callToTask_s00002932_input_s00001066]] & 3<=callToTask_s00002952_inputCriterion_s00001053_used]]]
normalized: [[callToTask_s00002964_output_s00001054<=join_s00001164_input_s00001068 & [3<=callToTask_s00002952_inputCriterion_s00001053_used & [[callToTask_s00002952_output_s00001077<=callToTask_s00002951_input_s00001066 & 2<=callToTask_s00002932_input_s00001066] | [3<=callToTask_s00002965_input_s00001066 | 2<=callToTask_s00002957_output_s00001054]]]] | EG [callToTask_s00002964_input_s00001066<=callToTask_s00002959_output_s00001077]]
abstracting: (callToTask_s00002964_input_s00001066<=callToTask_s00002959_output_s00001077) states: 2,437 (3)
.
EG iterations: 1
abstracting: (2<=callToTask_s00002957_output_s00001054) states: 0
abstracting: (3<=callToTask_s00002965_input_s00001066) states: 0
abstracting: (2<=callToTask_s00002932_input_s00001066) states: 0
abstracting: (callToTask_s00002952_output_s00001077<=callToTask_s00002951_input_s00001066) states: 2,479 (3)
abstracting: (3<=callToTask_s00002952_inputCriterion_s00001053_used) states: 0
abstracting: (callToTask_s00002964_output_s00001054<=join_s00001164_input_s00001068) states: 2,440 (3)
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [AF [[merge_s00002238_input_s00001068<=callToTask_s00002044_output_s00001077 | 1<=callToTask_s00002063_input_s00001052]]]
normalized: EG [~ [EG [~ [[merge_s00002238_input_s00001068<=callToTask_s00002044_output_s00001077 | 1<=callToTask_s00002063_input_s00001052]]]]]
abstracting: (1<=callToTask_s00002063_input_s00001052) states: 3
abstracting: (merge_s00002238_input_s00001068<=callToTask_s00002044_output_s00001077) states: 2,479 (3)
...
EG iterations: 3
EG iterations: 0
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [[~ [[1<=callToProcess_s00002882_inputCriterion_s00001053_used | 1<=callToTask_s00002962_output_s00001077]] & ~ [[3<=callToTask_s00002954_input_s00001066 & callToTask_s00002951_output_s00001077<=merge_s00001160_input_s00001129]]]]
normalized: EG [[~ [[3<=callToTask_s00002954_input_s00001066 & callToTask_s00002951_output_s00001077<=merge_s00001160_input_s00001129]] & ~ [[1<=callToProcess_s00002882_inputCriterion_s00001053_used | 1<=callToTask_s00002962_output_s00001077]]]]
abstracting: (1<=callToTask_s00002962_output_s00001077) states: 3
abstracting: (1<=callToProcess_s00002882_inputCriterion_s00001053_used) states: 3
abstracting: (callToTask_s00002951_output_s00001077<=merge_s00001160_input_s00001129) states: 2,479 (3)
abstracting: (3<=callToTask_s00002954_input_s00001066) states: 0
.............
EG iterations: 13
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: A [EF [3<=merge_s00002238_activated] U [[merge_s00002238_input_s00001068<=decision_s00002056_activated & 1<=decision_s00003022_activated] & ~ [1<=callToTask_s00002957_input_s00001052]]]
normalized: [~ [EG [~ [[~ [1<=callToTask_s00002957_input_s00001052] & [merge_s00002238_input_s00001068<=decision_s00002056_activated & 1<=decision_s00003022_activated]]]]] & ~ [E [~ [E [true U 3<=merge_s00002238_activated]] U [~ [E [true U 3<=merge_s00002238_activated]] & ~ [[~ [1<=callToTask_s00002957_input_s00001052] & [merge_s00002238_input_s00001068<=decision_s00002056_activated & 1<=decision_s00003022_activated]]]]]]]
abstracting: (1<=decision_s00003022_activated) states: 0
abstracting: (merge_s00002238_input_s00001068<=decision_s00002056_activated) states: 2,479 (3)
abstracting: (1<=callToTask_s00002957_input_s00001052) states: 3
abstracting: (3<=merge_s00002238_activated) states: 0
abstracting: (3<=merge_s00002238_activated) states: 0
abstracting: (1<=decision_s00003022_activated) states: 0
abstracting: (merge_s00002238_input_s00001068<=decision_s00002056_activated) states: 2,479 (3)
abstracting: (1<=callToTask_s00002957_input_s00001052) states: 3
EG iterations: 0
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [1<=callToTask_s00002956_output_s00001054]
normalized: E [true U 1<=callToTask_s00002956_output_s00001054]
abstracting: (1<=callToTask_s00002956_output_s00001054) states: 3
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [AF [EX [1<=callToTask_s00002953_inputCriterion_s00001053_used]]]
normalized: EG [~ [EX [1<=callToTask_s00002953_inputCriterion_s00001053_used]]]
abstracting: (1<=callToTask_s00002953_inputCriterion_s00001053_used) states: 3
..
EG iterations: 1
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[AX [merge_s00002241_input_s00001127<=decision_s00001841_activated] | EX [2<=decision_s00001123_activated]]]
normalized: ~ [E [true U ~ [[EX [2<=decision_s00001123_activated] | ~ [EX [~ [merge_s00002241_input_s00001127<=decision_s00001841_activated]]]]]]]
abstracting: (merge_s00002241_input_s00001127<=decision_s00001841_activated) states: 2,437 (3)
.abstracting: (2<=decision_s00001123_activated) states: 0
.-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [E [~ [callToTask_s00002950_input_s00001066<=callToTask_s00002950_output_s00001054] U ~ [join_s00001164_input_s00001052<=decision_s00002761_activated]] | EX [EF [3<=callToTask_s00002044_inputCriterion_s00001053_used]]]
normalized: [EX [E [true U 3<=callToTask_s00002044_inputCriterion_s00001053_used]] | E [~ [callToTask_s00002950_input_s00001066<=callToTask_s00002950_output_s00001054] U ~ [join_s00001164_input_s00001052<=decision_s00002761_activated]]]
abstracting: (join_s00001164_input_s00001052<=decision_s00002761_activated) states: 2,437 (3)
abstracting: (callToTask_s00002950_input_s00001066<=callToTask_s00002950_output_s00001054) states: 2,479 (3)
abstracting: (3<=callToTask_s00002044_inputCriterion_s00001053_used) states: 0
.-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[~ [[callToTask_s00002958_output_s00001077<=callToTask_s00002667_input_s00001052 & join_s00001164_input_s00001068<=decision_s00002056_activated]] | EG [callToTask_s00002954_output_s00001054<=fork_s00001071_activated_s00001073]]]
normalized: E [true U [~ [[callToTask_s00002958_output_s00001077<=callToTask_s00002667_input_s00001052 & join_s00001164_input_s00001068<=decision_s00002056_activated]] | EG [callToTask_s00002954_output_s00001054<=fork_s00001071_activated_s00001073]]]
abstracting: (callToTask_s00002954_output_s00001054<=fork_s00001071_activated_s00001073) states: 2,479 (3)
....
EG iterations: 4
abstracting: (join_s00001164_input_s00001068<=decision_s00002056_activated) states: 2,437 (3)
abstracting: (callToTask_s00002958_output_s00001077<=callToTask_s00002667_input_s00001052) states: 2,479 (3)
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[~ [callToTask_s00002869_output_s00001077<=merge_s00002241_input_s00001052] & merge_s00001161_input_s00001052<=merge_s00001160_activated] & AG [3<=callToTask_s00002951_input_s00001066]]]
normalized: E [true U [~ [E [true U ~ [3<=callToTask_s00002951_input_s00001066]]] & [merge_s00001161_input_s00001052<=merge_s00001160_activated & ~ [callToTask_s00002869_output_s00001077<=merge_s00002241_input_s00001052]]]]
abstracting: (callToTask_s00002869_output_s00001077<=merge_s00002241_input_s00001052) states: 2,481 (3)
abstracting: (merge_s00001161_input_s00001052<=merge_s00001160_activated) states: 2,332 (3)
abstracting: (3<=callToTask_s00002951_input_s00001066) states: 0
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[[decision_s00001841_activated<=callToTask_s00002869_output_s00001054 & [alpha<=callToTask_s00001168_input_s00001127 & 2<=callToProcess_s00002943_inputCriterion_s00001053_used]] & AG [2<=callToTask_s00002931_inputCriterion_s00001053_used]] | EF [~ [callToTask_s00002957_input_s00001066<=callToTask_s00002957_input_s00001052]]] | [EG [[callToTask_s00002961_output_s00001077<=join_s00001163_input_s00001052 | 3<=callToTask_s00002964_input_s00001066]] & [[~ [callToTask_s00002962_input_s00001052<=callToTask_s00002932_input_s00001066] & [2<=decision_s00003020_activated & callToProcess_s00002499_input_s00001066<=callToProcess_s00002499_output_s00001083]] | [[callToProcess_s00002943_inputCriterion_s00001053_used<=merge_s00001061_input_s00001068 & 2<=merge_s00001162_input_s00001052] & [3<=callToTask_s00002964_inputCriterion_s00001053_used | 2<=callToTask_s00002965_input_s00001066]]]]]
normalized: [[[[[2<=decision_s00003020_activated & callToProcess_s00002499_input_s00001066<=callToProcess_s00002499_output_s00001083] & ~ [callToTask_s00002962_input_s00001052<=callToTask_s00002932_input_s00001066]] | [[3<=callToTask_s00002964_inputCriterion_s00001053_used | 2<=callToTask_s00002965_input_s00001066] & [callToProcess_s00002943_inputCriterion_s00001053_used<=merge_s00001061_input_s00001068 & 2<=merge_s00001162_input_s00001052]]] & EG [[callToTask_s00002961_output_s00001077<=join_s00001163_input_s00001052 | 3<=callToTask_s00002964_input_s00001066]]] | [E [true U ~ [callToTask_s00002957_input_s00001066<=callToTask_s00002957_input_s00001052]] | [~ [E [true U ~ [2<=callToTask_s00002931_inputCriterion_s00001053_used]]] & [decision_s00001841_activated<=callToTask_s00002869_output_s00001054 & [alpha<=callToTask_s00001168_input_s00001127 & 2<=callToProcess_s00002943_inputCriterion_s00001053_used]]]]]
abstracting: (2<=callToProcess_s00002943_inputCriterion_s00001053_used) states: 0
abstracting: (alpha<=callToTask_s00001168_input_s00001127) states: 2,481 (3)
abstracting: (decision_s00001841_activated<=callToTask_s00002869_output_s00001054) states: 2,332 (3)
abstracting: (2<=callToTask_s00002931_inputCriterion_s00001053_used) states: 0
abstracting: (callToTask_s00002957_input_s00001066<=callToTask_s00002957_input_s00001052) states: 2,482 (3)
abstracting: (3<=callToTask_s00002964_input_s00001066) states: 0
abstracting: (callToTask_s00002961_output_s00001077<=join_s00001163_input_s00001052) states: 2,479 (3)
....
EG iterations: 4
abstracting: (2<=merge_s00001162_input_s00001052) states: 0
abstracting: (callToProcess_s00002943_inputCriterion_s00001053_used<=merge_s00001061_input_s00001068) states: 2,479 (3)
abstracting: (2<=callToTask_s00002965_input_s00001066) states: 0
abstracting: (3<=callToTask_s00002964_inputCriterion_s00001053_used) states: 0
abstracting: (callToTask_s00002962_input_s00001052<=callToTask_s00002932_input_s00001066) states: 2,479 (3)
abstracting: (callToProcess_s00002499_input_s00001066<=callToProcess_s00002499_output_s00001083) states: 2,479 (3)
abstracting: (2<=decision_s00003020_activated) states: 0
-> the formula is FALSE
FORMULA IBM319-PT-none-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [callToTask_s00002963_output_s00001054<=callToTask_s00002955_inputCriterion_s00001053_used]
normalized: EG [callToTask_s00002963_output_s00001054<=callToTask_s00002955_inputCriterion_s00001053_used]
abstracting: (callToTask_s00002963_output_s00001054<=callToTask_s00002955_inputCriterion_s00001053_used) states: 2,479 (3)
....
EG iterations: 4
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [[callToProcess_s00002038_output_s00001077<=decision_s00002761_activated | AF [2<=callToTask_s00001406_output_s00001054]]]
normalized: EG [[callToProcess_s00002038_output_s00001077<=decision_s00002761_activated | ~ [EG [~ [2<=callToTask_s00001406_output_s00001054]]]]]
abstracting: (2<=callToTask_s00001406_output_s00001054) states: 0
EG iterations: 0
abstracting: (callToProcess_s00002038_output_s00001077<=decision_s00002761_activated) states: 2,479 (3)
......
EG iterations: 6
-> the formula is TRUE
FORMULA IBM319-PT-none-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m6sec
BK_STOP 1433633095664
--------------------
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:981 (5), effective:161 (0)
initing FirstDep: 0m0sec
iterations count:178 (1), effective:0 (0)
iterations count:178 (1), effective:0 (0)
iterations count:178 (1), effective:0 (0)
iterations count:178 (1), effective:0 (0)
iterations count:614 (3), effective:128 (0)
iterations count:485 (2), effective:91 (0)
iterations count:178 (1), effective:0 (0)
iterations count:189 (1), effective:3 (0)
iterations count:178 (1), effective:0 (0)
iterations count:178 (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="IBM319-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/IBM319-PT-none.tgz
mv IBM319-PT-none execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is IBM319-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 r232su-smll-143354324700041"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;