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 S_IBM703-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r111-blw7-149441636800075
=====================================================================

--------------------
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 IBM703-PT-none-CTLCardinality-0
FORMULA_NAME IBM703-PT-none-CTLCardinality-1
FORMULA_NAME IBM703-PT-none-CTLCardinality-10
FORMULA_NAME IBM703-PT-none-CTLCardinality-11
FORMULA_NAME IBM703-PT-none-CTLCardinality-12
FORMULA_NAME IBM703-PT-none-CTLCardinality-13
FORMULA_NAME IBM703-PT-none-CTLCardinality-14
FORMULA_NAME IBM703-PT-none-CTLCardinality-15
FORMULA_NAME IBM703-PT-none-CTLCardinality-2
FORMULA_NAME IBM703-PT-none-CTLCardinality-3
FORMULA_NAME IBM703-PT-none-CTLCardinality-4
FORMULA_NAME IBM703-PT-none-CTLCardinality-5
FORMULA_NAME IBM703-PT-none-CTLCardinality-6
FORMULA_NAME IBM703-PT-none-CTLCardinality-7
FORMULA_NAME IBM703-PT-none-CTLCardinality-8
FORMULA_NAME IBM703-PT-none-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1494775439300

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: IBM703_PT_none
(NrP: 262 NrTr: 284 NrArc: 572)

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

net check time: 0m 0.000sec

init dd package: 0m 1.083sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 316 (3.2e+02) #states 8,370 (3)



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

checking: ~ [EF [2<=task_s00000731_inputCriterion_s00000257_used]]
normalized: ~ [E [true U 2<=task_s00000731_inputCriterion_s00000257_used]]

abstracting: (2<=task_s00000731_inputCriterion_s00000257_used)
states: 0
-> the formula is TRUE

FORMULA IBM703-PT-none-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [1<=merge_s00000283_input_s00000263]
normalized: ~ [EG [~ [1<=merge_s00000283_input_s00000263]]]

abstracting: (1<=merge_s00000283_input_s00000263)
states: 5
.
EG iterations: 1
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.056sec

checking: ~ [EG [AX [decision_s00000783_input_s00000263<=decision_s00000793_input_s00000263]]]
normalized: ~ [EG [~ [EX [~ [decision_s00000783_input_s00000263<=decision_s00000793_input_s00000263]]]]]

abstracting: (decision_s00000783_input_s00000263<=decision_s00000793_input_s00000263)
states: 8,365 (3)
............
EG iterations: 11
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.268sec

checking: E [2<=task_s00000763_inputCriterion_s00000257_used U AF [2<=task_s00000756_input_s00000263]]
normalized: E [2<=task_s00000763_inputCriterion_s00000257_used U ~ [EG [~ [2<=task_s00000756_input_s00000263]]]]

abstracting: (2<=task_s00000756_input_s00000263)
states: 0

EG iterations: 0
abstracting: (2<=task_s00000763_inputCriterion_s00000257_used)
states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: ~ [EG [~ [[2<=task_s00000714_output_s00000264 & 3<=task_s00000717_inputCriterion_s00000257_used]]]]
normalized: ~ [EG [~ [[2<=task_s00000714_output_s00000264 & 3<=task_s00000717_inputCriterion_s00000257_used]]]]

abstracting: (3<=task_s00000717_inputCriterion_s00000257_used)
states: 0
abstracting: (2<=task_s00000714_output_s00000264)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [E [task_s00000722_output_s00000264<=merge_s00000449_activated U 3<=merge_s00000453_activated]]
normalized: ~ [EX [~ [E [task_s00000722_output_s00000264<=merge_s00000449_activated U 3<=merge_s00000453_activated]]]]

abstracting: (3<=merge_s00000453_activated)
states: 0
abstracting: (task_s00000722_output_s00000264<=merge_s00000449_activated)
states: 8,365 (3)
.-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: A [EF [task_s00000710_output_s00000264<=task_s00000742_output_s00000264] U 3<=task_s00000729_output_s00000264]
normalized: [~ [E [~ [3<=task_s00000729_output_s00000264] U [~ [E [true U task_s00000710_output_s00000264<=task_s00000742_output_s00000264]] & ~ [3<=task_s00000729_output_s00000264]]]] & ~ [EG [~ [3<=task_s00000729_output_s00000264]]]]

abstracting: (3<=task_s00000729_output_s00000264)
states: 0

EG iterations: 0
abstracting: (3<=task_s00000729_output_s00000264)
states: 0
abstracting: (task_s00000710_output_s00000264<=task_s00000742_output_s00000264)
states: 8,369 (3)
abstracting: (3<=task_s00000729_output_s00000264)
states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: [EF [EX [2<=task_s00000718_output_s00000264]] & task_s00000758_output_s00000264<=task_s00000745_output_s00000264]
normalized: [E [true U EX [2<=task_s00000718_output_s00000264]] & task_s00000758_output_s00000264<=task_s00000745_output_s00000264]

abstracting: (task_s00000758_output_s00000264<=task_s00000745_output_s00000264)
states: 8,245 (3)
abstracting: (2<=task_s00000718_output_s00000264)
states: 0
.-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [task_s00000717_output_s00000264<=task_s00000713_inputCriterion_s00000257_used & EG [EX [merge_s00000319_activated<=fork_s00000465_activated_s00000272]]]
normalized: [task_s00000717_output_s00000264<=task_s00000713_inputCriterion_s00000257_used & EG [EX [merge_s00000319_activated<=fork_s00000465_activated_s00000272]]]

abstracting: (merge_s00000319_activated<=fork_s00000465_activated_s00000272)
states: 8,225 (3)
.............................................................................................................
EG iterations: 108
abstracting: (task_s00000717_output_s00000264<=task_s00000713_inputCriterion_s00000257_used)
states: 8,366 (3)
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.717sec

checking: [EF [AF [3<=task_s00000710_inputCriterion_s00000257_used]] & [~ [AG [2<=task_s00000754_input_s00000263]] | E [3<=decision_s00000783_input_s00000263 U task_s00000725_input_s00000263<=task_s00000741_output_s00000264]]]
normalized: [E [true U ~ [EG [~ [3<=task_s00000710_inputCriterion_s00000257_used]]]] & [E [true U ~ [2<=task_s00000754_input_s00000263]] | E [3<=decision_s00000783_input_s00000263 U task_s00000725_input_s00000263<=task_s00000741_output_s00000264]]]

abstracting: (task_s00000725_input_s00000263<=task_s00000741_output_s00000264)
states: 8,225 (3)
abstracting: (3<=decision_s00000783_input_s00000263)
states: 0
abstracting: (2<=task_s00000754_input_s00000263)
states: 0
abstracting: (3<=task_s00000710_inputCriterion_s00000257_used)
states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: AF [[EX [1<=task_s00000732_inputCriterion_s00000257_used] | [3<=task_s00000710_inputCriterion_s00000257_used | [merge_s00000452_input_s00000285<=task_s00000749_inputCriterion_s00000257_used & 2<=merge_s00000462_input_s00000285]]]]
normalized: ~ [EG [~ [[[[merge_s00000452_input_s00000285<=task_s00000749_inputCriterion_s00000257_used & 2<=merge_s00000462_input_s00000285] | 3<=task_s00000710_inputCriterion_s00000257_used] | EX [1<=task_s00000732_inputCriterion_s00000257_used]]]]]

abstracting: (1<=task_s00000732_inputCriterion_s00000257_used)
states: 270
.abstracting: (3<=task_s00000710_inputCriterion_s00000257_used)
states: 0
abstracting: (2<=merge_s00000462_input_s00000285)
states: 0
abstracting: (merge_s00000452_input_s00000285<=task_s00000749_inputCriterion_s00000257_used)
states: 8,365 (3)
.....................................................
EG iterations: 53
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.674sec

checking: AF [[EF [2<=merge_s00000446_input_s00000290] | [[callToProcess_s00000348_output_s00000264<=merge_s00000461_input_s00000263 & 3<=process_s00000030__s00000703_input_s00000263] & decision_s00000802_activated<=task_s00000758_output_s00000264]]]
normalized: ~ [EG [~ [[[[callToProcess_s00000348_output_s00000264<=merge_s00000461_input_s00000263 & 3<=process_s00000030__s00000703_input_s00000263] & decision_s00000802_activated<=task_s00000758_output_s00000264] | E [true U 2<=merge_s00000446_input_s00000290]]]]]

abstracting: (2<=merge_s00000446_input_s00000290)
states: 0
abstracting: (decision_s00000802_activated<=task_s00000758_output_s00000264)
states: 8,365 (3)
abstracting: (3<=process_s00000030__s00000703_input_s00000263)
states: 0
abstracting: (callToProcess_s00000348_output_s00000264<=merge_s00000461_input_s00000263)
states: 8,245 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [AF [~ [task_s00000753_input_s00000263<=task_s00000741_output_s00000264]] | A [[2<=task_s00000725_output_s00000264 | task_s00000731_output_s00000264<=merge_s00000453_input_s00000290] U 2<=task_s00000735_inputCriterion_s00000257_used]]
normalized: [[~ [E [~ [2<=task_s00000735_inputCriterion_s00000257_used] U [~ [[2<=task_s00000725_output_s00000264 | task_s00000731_output_s00000264<=merge_s00000453_input_s00000290]] & ~ [2<=task_s00000735_inputCriterion_s00000257_used]]]] & ~ [EG [~ [2<=task_s00000735_inputCriterion_s00000257_used]]]] | ~ [EG [task_s00000753_input_s00000263<=task_s00000741_output_s00000264]]]

abstracting: (task_s00000753_input_s00000263<=task_s00000741_output_s00000264)
states: 8,369 (3)
.
EG iterations: 1
abstracting: (2<=task_s00000735_inputCriterion_s00000257_used)
states: 0

EG iterations: 0
abstracting: (2<=task_s00000735_inputCriterion_s00000257_used)
states: 0
abstracting: (task_s00000731_output_s00000264<=merge_s00000453_input_s00000290)
states: 8,365 (3)
abstracting: (2<=task_s00000725_output_s00000264)
states: 0
abstracting: (2<=task_s00000735_inputCriterion_s00000257_used)
states: 0
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: [~ [[~ [~ [task_s00000763_input_s00000263<=task_s00000706_output_s00000264]] & EF [3<=decision_s00000802_input_s00000263]]] & [[3<=merge_s00000319_activated | EF [1<=decision_s00000804_activated]] | [task_s00000729_input_s00000263<=task_s00000724_inputCriterion_s00000257_used & EF [task_s00000738_input_s00000263<=task_s00000741_output_s00000264]]]]
normalized: [~ [[task_s00000763_input_s00000263<=task_s00000706_output_s00000264 & E [true U 3<=decision_s00000802_input_s00000263]]] & [[E [true U task_s00000738_input_s00000263<=task_s00000741_output_s00000264] & task_s00000729_input_s00000263<=task_s00000724_inputCriterion_s00000257_used] | [E [true U 1<=decision_s00000804_activated] | 3<=merge_s00000319_activated]]]

abstracting: (3<=merge_s00000319_activated)
states: 0
abstracting: (1<=decision_s00000804_activated)
states: 25
abstracting: (task_s00000729_input_s00000263<=task_s00000724_inputCriterion_s00000257_used)
states: 8,365 (3)
abstracting: (task_s00000738_input_s00000263<=task_s00000741_output_s00000264)
states: 8,365 (3)
abstracting: (3<=decision_s00000802_input_s00000263)
states: 0
abstracting: (task_s00000763_input_s00000263<=task_s00000706_output_s00000264)
states: 8,365 (3)
-> the formula is TRUE

FORMULA IBM703-PT-none-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: [~ [[[~ [task_s00000761_input_s00000263<=task_s00000705_output_s00000264] | [3<=task_s00000762_input_s00000263 | 1<=merge_s00000806_activated]] & [~ [1<=task_s00000755_input_s00000263] & [task_s00000720_input_s00000263<=task_s00000725_output_s00000264 | decision_s00000804_activated<=task_s00000727_input_s00000263]]]] & [~ [AG [task_s00000761_input_s00000263<=task_s00000758_inputCriterion_s00000257_used]] & AF [3<=decision_s00000789_activated]]]
normalized: [[E [true U ~ [task_s00000761_input_s00000263<=task_s00000758_inputCriterion_s00000257_used]] & ~ [EG [~ [3<=decision_s00000789_activated]]]] & ~ [[[~ [1<=task_s00000755_input_s00000263] & [task_s00000720_input_s00000263<=task_s00000725_output_s00000264 | decision_s00000804_activated<=task_s00000727_input_s00000263]] & [[3<=task_s00000762_input_s00000263 | 1<=merge_s00000806_activated] | ~ [task_s00000761_input_s00000263<=task_s00000705_output_s00000264]]]]]

abstracting: (task_s00000761_input_s00000263<=task_s00000705_output_s00000264)
states: 8,365 (3)
abstracting: (1<=merge_s00000806_activated)
states: 5
abstracting: (3<=task_s00000762_input_s00000263)
states: 0
abstracting: (decision_s00000804_activated<=task_s00000727_input_s00000263)
states: 8,345 (3)
abstracting: (task_s00000720_input_s00000263<=task_s00000725_output_s00000264)
states: 8,365 (3)
abstracting: (1<=task_s00000755_input_s00000263)
states: 145
abstracting: (3<=decision_s00000789_activated)
states: 0

EG iterations: 0
abstracting: (task_s00000761_input_s00000263<=task_s00000758_inputCriterion_s00000257_used)
states: 8,365 (3)
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: [A [[1<=merge_s00000445_activated & task_s00000713_output_s00000264<=task_s00000750_inputCriterion_s00000257_used] U [decision_s00000793_activated<=task_s00000756_inputCriterion_s00000257_used | task_s00000712_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263]] & [EF [[1<=fork_s00000463_activated_s00000274 & 3<=task_s00000735_output_s00000264]] & [[[decision_s00000773_activated<=task_s00000733_inputCriterion_s00000257_used & task_s00000757_input_s00000263<=task_s00000717_output_s00000264] & ~ [decision_s00000792_activated<=task_s00000711_input_s00000263]] | [[2<=decision_s00000793_input_s00000263 | task_s00000729_inputCriterion_s00000257_used<=decision_s00000801_activated] | [merge_s00000451_input_s00000285<=task_s00000716_inputCriterion_s00000257_used | 2<=task_s00000726_output_s00000264]]]]]
normalized: [[~ [EG [~ [[decision_s00000793_activated<=task_s00000756_inputCriterion_s00000257_used | task_s00000712_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263]]]] & ~ [E [~ [[decision_s00000793_activated<=task_s00000756_inputCriterion_s00000257_used | task_s00000712_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263]] U [~ [[1<=merge_s00000445_activated & task_s00000713_output_s00000264<=task_s00000750_inputCriterion_s00000257_used]] & ~ [[decision_s00000793_activated<=task_s00000756_inputCriterion_s00000257_used | task_s00000712_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263]]]]]] & [E [true U [1<=fork_s00000463_activated_s00000274 & 3<=task_s00000735_output_s00000264]] & [[[decision_s00000773_activated<=task_s00000733_inputCriterion_s00000257_used & task_s00000757_input_s00000263<=task_s00000717_output_s00000264] & ~ [decision_s00000792_activated<=task_s00000711_input_s00000263]] | [[2<=decision_s00000793_input_s00000263 | task_s00000729_inputCriterion_s00000257_used<=decision_s00000801_activated] | [merge_s00000451_input_s00000285<=task_s00000716_inputCriterion_s00000257_used | 2<=task_s00000726_output_s00000264]]]]]

abstracting: (2<=task_s00000726_output_s00000264)
states: 0
abstracting: (merge_s00000451_input_s00000285<=task_s00000716_inputCriterion_s00000257_used)
states: 8,350 (3)
abstracting: (task_s00000729_inputCriterion_s00000257_used<=decision_s00000801_activated)
states: 8,365 (3)
abstracting: (2<=decision_s00000793_input_s00000263)
states: 0
abstracting: (decision_s00000792_activated<=task_s00000711_input_s00000263)
states: 8,365 (3)
abstracting: (task_s00000757_input_s00000263<=task_s00000717_output_s00000264)
states: 8,245 (3)
abstracting: (decision_s00000773_activated<=task_s00000733_inputCriterion_s00000257_used)
states: 8,250 (3)
abstracting: (3<=task_s00000735_output_s00000264)
states: 0
abstracting: (1<=fork_s00000463_activated_s00000274)
states: 4
abstracting: (task_s00000712_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263)
states: 8,369 (3)
abstracting: (decision_s00000793_activated<=task_s00000756_inputCriterion_s00000257_used)
states: 8,365 (3)
abstracting: (task_s00000713_output_s00000264<=task_s00000750_inputCriterion_s00000257_used)
states: 6,756 (3)
abstracting: (1<=merge_s00000445_activated)
states: 1
abstracting: (task_s00000712_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263)
states: 8,369 (3)
abstracting: (decision_s00000793_activated<=task_s00000756_inputCriterion_s00000257_used)
states: 8,365 (3)
abstracting: (task_s00000712_inputCriterion_s00000257_used<=decision_s00000784_input_s00000263)
states: 8,369 (3)
abstracting: (decision_s00000793_activated<=task_s00000756_inputCriterion_s00000257_used)
states: 8,365 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA IBM703-PT-none-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

totally nodes used: 2215267(2.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1441532 3742932 5184464
used/not used/entry size/cache size: 2530842 64578022 16 1024MB
basic ops cache: hits/miss/sum: 208552 2407103 2615655
used/not used/entry size/cache size: 5276268 11500948 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 3522 3602 7124
used/not used/entry size/cache size: 3602 2093550 32 64MB
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 65019671
1 1972979
2 107156
3 8308
4 701
5 46
6 3
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 3.566sec


BK_STOP 1494775442894

--------------------
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.000sec


iterations count:1716 (6), effective:266 (0)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:738 (2), effective:76 (0)

iterations count:741 (2), effective:97 (0)

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

iterations count:675 (2), effective:72 (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="S_IBM703-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/S_IBM703-PT-none.tgz
mv S_IBM703-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 S_IBM703-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 r111-blw7-149441636800075"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;