fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r008-csrt-149436125900138
Last Updated
June 27, 2017

About the Execution of LoLA for Angiogenesis-PT-25

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15946.090 851004.00 851282.00 1295.10 ??TT?F?TFTFFT?TT 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 lola
Input is Angiogenesis-PT-25, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436125900138
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1494598573694


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
CTLCardinality @ Angiogenesis-PT-25 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 103/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 39 places, 64 transitions, 31 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 54 transition conflict sets
lola: TASK
lola: reading formula from Angiogenesis-PT-25-CTLCardinality.task
lola: E (F (NOT(E (X ((KdStarGP3 <= Akt)))))) : E (((((3 <= KdStarGStarP3kStar) OR (PtP3P2 <= KdStarGStarPgStarP2)) AND (KdStarPg <= KdStarGStar)) U ((DAG + 1 <= KdStarG) AND (Pip2 + 1 <= KdStarGStarPgStarP3)))) : ((1 <= AktP3) OR NOT(E (F ((P3k + 1 <= KdStarPgStar))))) : E (F (((2 <= KdStarGP3) AND (KdStarGStarPg <= KdStarGStarP3kStarP3)))) : A (G (((2 <= P3k) AND ((KdStarGStarP3kStar <= Akt) OR (KdStarGStarPgP3 <= Pten)) AND ((KdStarGStarPgStarP2 + 1 <= KdStar) OR ((KdStarGStarP3kStarP2 <= KdStarGStarP3) AND (3 <= KdStarPg)))))) : A (G ((AktStar <= KdStarGStarPgStarP3))) : NOT(A (G (((1 <= KdStarGStarPg) OR (Pip2 <= AktP3) OR (KdStarPgStarP2 <= P3k))))) : E (F (A (G ((DAG <= KdStarGStarPg))))) : (NOT(A (G (((3 <= PtP2) OR (GStarPgP3 <= Gab1))))) OR ((E (X ((KdStarGStarPgStar <= Enz))) AND ((Pg + 1 <= KdStarGStarPgStarP3P2) OR ((3 <= KdStarGStarP3kStar) AND (3 <= PtP3P2)))) AND (1 <= KdStarGStarPgStarP3))) : E (F (A (((KdStarPgStar <= KdStarGStarPgStar) U (3 <= KdStarGStarP3))))) : E (((((2 <= DAG) AND (2 <= KdStarGStar)) OR (1 <= Pg)) U (((2 <= KdStarGP3) AND (2 <= KdStarGP3)) OR ((3 <= Pip3))))) : E (F ((((KdStarGStarP3kStarP3P2 <= KdStarPgStarP2) OR (Pg <= KdStarGStarPgStarP2)) AND (2 <= Pip3)))) : E (F ((A (G ((2 <= GStarP3kP3))) AND E (G (TRUE))))) : E ((A (G ((KdStarGStarP3kP3 <= Akt))) U (KdStar + 1 <= Enz))) : (NOT((((3 <= KdStarGStarP3kStarP3) OR (3 <= KdStarPgStar) OR ((2 <= KdStarGStarP3kStarP3P2) AND (KdStarGStarP3kP3 <= DAGE))) OR A (X ((PtP2 <= KdStarGStarP3kStar))))) AND NOT((((KdStarGStarP3 <= 1) OR ((PtP2 <= KdStarGP3) AND (KdStarGStarPgStarP3P2 <= Gab1))) AND E (F ((Akt <= Pip3)))))) : E (F (((Akt <= 1) OR (AktStar + 1 <= KdStarGStarP3kP3))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (X ((KdStarGP3 <= Akt))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((Akt + 1 <= KdStarGP3)))
lola: processed formula length: 36
lola: 5 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2995579 markings, 6202140 edges, 3224733188970512384 markings/sec, 0 secs
lola: 5612772 markings, 11755547 edges, 523439 markings/sec, 5 secs
lola: 8311658 markings, 17498560 edges, 539777 markings/sec, 10 secs
lola: 10967151 markings, 23156553 edges, 531099 markings/sec, 15 secs
lola: 13723678 markings, 28884769 edges, 551305 markings/sec, 20 secs
lola: 16359874 markings, 34487160 edges, 527239 markings/sec, 25 secs
lola: 18789885 markings, 39751322 edges, 486002 markings/sec, 30 secs
lola: 21303773 markings, 45012789 edges, 502778 markings/sec, 35 secs
lola: 23755145 markings, 50096650 edges, 490274 markings/sec, 40 secs
lola: 26149584 markings, 55184509 edges, 478888 markings/sec, 45 secs
lola: 28489335 markings, 60118552 edges, 467950 markings/sec, 50 secs
lola: 30848156 markings, 65126340 edges, 471764 markings/sec, 55 secs
lola: 33304364 markings, 70317836 edges, 491242 markings/sec, 60 secs
lola: 35574917 markings, 75268403 edges, 454111 markings/sec, 65 secs
lola: 37818963 markings, 80098154 edges, 448809 markings/sec, 70 secs
lola: 40107374 markings, 84962555 edges, 457682 markings/sec, 75 secs
lola: 42406537 markings, 89870613 edges, 459833 markings/sec, 80 secs
lola: 44665955 markings, 94720358 edges, 451884 markings/sec, 85 secs
lola: 46989698 markings, 99732819 edges, 464749 markings/sec, 90 secs
lola: 49336663 markings, 104692079 edges, 469393 markings/sec, 95 secs
lola: 51579436 markings, 109441063 edges, 448555 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 228 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((3 <= KdStarGStarP3kStar) OR (PtP3P2 <= KdStarGStarPgStarP2)) AND (KdStarPg <= KdStarGStar)) U ((DAG + 1 <= KdStarG) AND (Pip2 + 1 <= KdStarGStarPgStarP3))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((3 <= KdStarGStarP3kStar) OR (PtP3P2 <= KdStarGStarPgStarP2)) AND (KdStarPg <= KdStarGStar)) U ((DAG + 1 <= KdStarG) AND (Pip2 + 1 <= KdStarGStarPgStarP3)))
lola: processed formula length: 161
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3257791 markings, 6592117 edges, 3096159597753270272 markings/sec, 0 secs
lola: 6501705 markings, 13458104 edges, 648783 markings/sec, 5 secs
lola: 9727249 markings, 20290029 edges, 645109 markings/sec, 10 secs
lola: 12922977 markings, 27050658 edges, 639146 markings/sec, 15 secs
lola: 16111120 markings, 33802898 edges, 637629 markings/sec, 20 secs
lola: 19311983 markings, 40567868 edges, 640173 markings/sec, 25 secs
lola: 22459045 markings, 47236655 edges, 629412 markings/sec, 30 secs
lola: 25382123 markings, 53422734 edges, 584616 markings/sec, 35 secs
lola: 28184845 markings, 59317340 edges, 560544 markings/sec, 40 secs
lola: 31083633 markings, 65436061 edges, 579758 markings/sec, 45 secs
lola: 33948713 markings, 71459526 edges, 573016 markings/sec, 50 secs
lola: 36651520 markings, 77149652 edges, 540561 markings/sec, 55 secs
lola: 39310603 markings, 82756796 edges, 531817 markings/sec, 60 secs
lola: 42058328 markings, 88452150 edges, 549545 markings/sec, 65 secs
lola: 44710561 markings, 94047131 edges, 530447 markings/sec, 70 secs
lola: 47254539 markings, 99454708 edges, 508796 markings/sec, 75 secs
lola: 49798599 markings, 104872300 edges, 508812 markings/sec, 80 secs
lola: 52360363 markings, 110182722 edges, 512353 markings/sec, 85 secs
lola: 54931485 markings, 115689078 edges, 514224 markings/sec, 90 secs
lola: 57535782 markings, 121227229 edges, 520859 markings/sec, 95 secs
lola: 60167073 markings, 126837121 edges, 526258 markings/sec, 100 secs
lola: 62716155 markings, 132250990 edges, 509816 markings/sec, 105 secs
lola: 65346085 markings, 137815038 edges, 525986 markings/sec, 110 secs
lola: 66763895 markings, 140841332 edges, 283562 markings/sec, 115 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= AktP3) OR NOT(E (F ((P3k + 1 <= KdStarPgStar)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= AktP3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= AktP3)
lola: processed formula length: 12
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((KdStarPgStar <= P3k)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= KdStarGP3) AND (KdStarGStarPg <= KdStarGStarP3kStarP3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-CTLCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-25-CTLCardinality-3.sara.

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= P3k) AND ((KdStarGStarP3kStar <= Akt) OR (KdStarGStarPgP3 <= Pten)) AND ((KdStarGStarPgStarP2 + 1 <= KdStar) OR ((KdStarGStarP3kStarP2 <= KdStarGStarP3) AND (3 <= KdStarPg))))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-CTLCardinality-4.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: state equation: calling and running sara
The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((AktStar <= KdStarGStarPgStarP3)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to Angiogenesis-PT-25-CTLCardinality-5.sara
lola: The predicate is not invariant.
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: state equation: calling and running sara
lola: ========================================
lola: lola: ========================================
...considering subproblem: NOT(A (G (((1 <= KdStarGStarPg) OR (Pip2 <= AktP3) OR (KdStarPgStarP2 <= P3k)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
sara: lola: try reading problem file Angiogenesis-PT-25-CTLCardinality-4.sara.
state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Angiogenesis-PT-25-CTLCardinality-6.sara
sara: try reading problem file Angiogenesis-PT-25-CTLCardinality-5.sara.
lola: state equation: calling and running sara
sara: try reading problem file Angiogenesis-PT-25-CTLCardinality-6.sara.

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((DAG <= KdStarGStarPg)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (KdStarGStarPg + 1 <= DAG))))
lola: processed formula length: 51
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).


lola: 2016428 markings, 8368627 edges, 403276 markings/sec, 0 secs
lola: 3811670 markings, 16198211 edges, 359048 markings/sec, 5 secs
lola: 5480552 markings, 23472506 edges, 333776 markings/sec, 10 secs
lola: 7070279 markings, 30437369 edges, 317945 markings/sec, 15 secs
lola: 8679883 markings, 37168578 edges, 321921 markings/sec, 20 secs
lola: 10253030 markings, 44142769 edges, 314629 markings/sec, 25 secs
lola: 11809507 markings, 51012264 edges, 311295 markings/sec, 30 secs
lola: 13282012 markings, 57518132 edges, 294501 markings/sec, 35 secs
lola: 14655127 markings, 63662152 edges, 274623 markings/sec, 40 secs
lola: 16058205 markings, 69899187 edges, 280616 markings/sec, 45 secs
lola: 17481749 markings, 76075406 edges, 284709 markings/sec, 50 secs
lola: 18918225 markings, 82272982 edges, 287295 markings/sec, 55 secs
lola: 20407531 markings, 88704283 edges, 297861 markings/sec, 60 secs
lola: 21853047 markings, 95224533 edges, 289103 markings/sec, 65 secs
lola: 23332225 markings, 101877246 edges, 295836 markings/sec, 70 secs
lola: 24817058 markings, 108399383 edges, 296967 markings/sec, 75 secs
lola: 26285929 markings, 114814505 edges, 293774 markings/sec, 80 secs
lola: 27801561 markings, 121245887 edges, 303126 markings/sec, 85 secs
lola: 29309891 markings, 127955134 edges, 301666 markings/sec, 90 secs
lola: 30769496 markings, 134448992 edges, 291921 markings/sec, 95 secs
lola: 32225136 markings, 140916232 edges, 291128 markings/sec, 100 secs
lola: 33703489 markings, 147264408 edges, 295671 markings/sec, 105 secs
lola: 35148831 markings, 153459501 edges, 289068 markings/sec, 110 secs
lola: 36577947 markings, 159748658 edges, 285823 markings/sec, 115 secs
lola: 38000212 markings, 165904248 edges, 284453 markings/sec, 120 secs
lola: 39375427 markings, 171934206 edges, 275043 markings/sec, 125 secs
lola: 40757925 markings, 178086291 edges, 276500 markings/sec, 130 secs
lola: 42104635 markings, 183969991 edges, 269342 markings/sec, 135 secs
lola: 43428149 markings, 189866139 edges, 264703 markings/sec, 140 secs
lola: 44733493 markings, 195678133 edges, 261069 markings/sec, 145 secs
lola: 45995612 markings, 201250796 edges, 252424 markings/sec, 150 secs
lola: 47275918 markings, 207012441 edges, 256061 markings/sec, 155 secs
lola: 48570139 markings, 212865698 edges, 258844 markings/sec, 160 secs
lola: 49862115 markings, 218569889 edges, 258395 markings/sec, 165 secs
lola: 51223885 markings, 224582896 edges, 272354 markings/sec, 170 secs
lola: 52574802 markings, 230714855 edges, 270183 markings/sec, 175 secs
lola: 53899314 markings, 236684317 edges, 264902 markings/sec, 180 secs
lola: 55246559 markings, 242514722 edges, 269449 markings/sec, 185 secs
lola: 56620117 markings, 248583895 edges, 274712 markings/sec, 190 secs
lola: 57903194 markings, 254223096 edges, 256615 markings/sec, 195 secs
lola: 59179766 markings, 259935904 edges, 255314 markings/sec, 200 secs
lola: 60360102 markings, 265269707 edges, 236067 markings/sec, 205 secs
lola: 61613881 markings, 270789784 edges, 250756 markings/sec, 210 secs
lola: 63016545 markings, 276717437 edges, 280533 markings/sec, 215 secs
lola: 64420601 markings, 282685905 edges, 280811 markings/sec, 220 secs
lola: 65772173 markings, 288375592 edges, 270314 markings/sec, 225 secs
lola: 67057981 markings, 293904704 edges, 257162 markings/sec, 230 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (G (((3 <= PtP2) OR (GStarPgP3 <= Gab1))))) OR ((E (X ((KdStarGStarPgStar <= Enz))) AND ((Pg + 1 <= KdStarGStarPgStarP3P2) OR ((3 <= KdStarGStarP3kStar) AND (3 <= PtP3P2)))) AND (1 <= KdStarGStarPgStarP3)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((PtP2 <= 2) AND (Gab1 + 1 <= GStarPgP3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULTlola:
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (((KdStarPgStar <= KdStarGStarPgStar) U (3 <= KdStarGStarP3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A((KdStarPgStar <= KdStarGStarPgStar) U (3 <= KdStarGStarP3)))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2572735 markings, 8089860 edges, 2040949629922574336 markings/sec, 0 secs
lola: 4667938 markings, 16493429 edges, 419041 markings/sec, 5 secs
lola: 6684464 markings, 24616073 edges, 403305 markings/sec, 10 secs
lola: 8689836 markings, 32697849 edges, 401074 markings/sec, 15 secs
lola: 10800017 markings, 41194920 edges, 422036 markings/sec, 20 secs
lola: 12822721 markings, 49351382 edges, 404541 markings/sec, 25 secs
lola: 14824410 markings, 57417211 edges, 400338 markings/sec, 30 secs
lola: 16866510 markings, 65645106 edges, 408420 markings/sec, 35 secs
lola: 18951676 markings, 74048468 edges, 417033 markings/sec, 40 secs
lola: 21041142 markings, 82467254 edges, 417893 markings/sec, 45 secs
lola: 22983006 markings, 90238607 edges, 388373 markings/sec, 50 secs
lola: 24771885 markings, 97445176 edges, 357776 markings/sec, 55 secs
lola: 26522517 markings, 104372919 edges, 350126 markings/sec, 60 secs
lola: 28238288 markings, 111104395 edges, 343154 markings/sec, 65 secs
lola: 30014992 markings, 118121087 edges, 355341 markings/sec, 70 secs
lola: 31735888 markings, 124913955 edges, 344179 markings/sec, 75 secs
lola: 33498437 markings, 131877736 edges, 352510 markings/sec, 80 secs
lola: 35305298 markings, 138966706 edges, 361372 markings/sec, 85 secs
lola: 37015080 markings, 145715773 edges, 341956 markings/sec, 90 secs
lola: 38699488 markings, 152289941 edges, 336882 markings/sec, 95 secs
lola: 40389751 markings, 158785295 edges, 338053 markings/sec, 100 secs
lola: 42036865 markings, 165352871 edges, 329423 markings/sec, 105 secs
lola: 43673502 markings, 171810373 edges, 327327 markings/sec, 110 secs
lola: 45330928 markings, 178277502 edges, 331485 markings/sec, 115 secs
lola: 46969438 markings, 184714368 edges, 327702 markings/sec, 120 secs
lola: 48591928 markings, 191084548 edges, 324498 markings/sec, 125 secs
lola: 50229190 markings, 197454580 edges, 327452 markings/sec, 130 secs
lola: 51822434 markings, 203737324 edges, 318649 markings/sec, 135 secs
lola: 53415078 markings, 209768613 edges, 318529 markings/sec, 140 secs
lola: 54966751 markings, 215756141 edges, 310335 markings/sec, 145 secs
lola: 56516409 markings, 221731390 edges, 309932 markings/sec, 150 secs
lola: 58070073 markings, 227919764 edges, 310733 markings/sec, 155 secs
lola: 59632693 markings, 234073446 edges, 312524 markings/sec, 160 secs
lola: 61209084 markings, 240209234 edges, 315278 markings/sec, 165 secs
lola: 62795655 markings, 246499058 edges, 317314 markings/sec, 170 secs
lola: 64367606 markings, 252734004 edges, 314390 markings/sec, 175 secs
lola: 64435943 markings, 252993287 edges, 13667 markings/sec, 180 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 480 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((((2 <= DAG) AND (2 <= KdStarGStar)) OR (1 <= Pg)) U (((2 <= KdStarGP3) AND (2 <= KdStarGP3)) OR ((3 <= Pip3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((((2 <= DAG) AND (2 <= KdStarGStar)) OR (1 <= Pg)) U (((2 <= KdStarGP3) AND (2 <= KdStarGP3)) OR ((3 <= Pip3))))
lola: processed formula length: 116
lola: 1 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3475775 markings, 7216840 edges, 2487376777006022656 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 575 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((KdStarGStarP3kStarP3P2 <= KdStarPgStarP2) OR (Pg <= KdStarGStarPgStarP2)) AND (2 <= Pip3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 718 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((A (G ((2 <= GStarP3kP3))) AND E (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (GStarP3kP3 <= 1))))
lola: processed formula length: 42
lola: 7 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 2760583 markings, 8013812 edges, 552107 markings/sec, 0 secs
lola: 5423677 markings, 16079418 edges, 532619 markings/sec, 5 secs
lola: 8020283 markings, 23945943 edges, 519321 markings/sec, 10 secs
lola: 10702211 markings, 32064219 edges, 536386 markings/sec, 15 secs
lola: 13313236 markings, 39977800 edges, 522205 markings/sec, 20 secs
lola: 15921342 markings, 47879742 edges, 521621 markings/sec, 25 secs
lola: 18590214 markings, 55970237 edges, 533774 markings/sec, 30 secs
lola: 21386211 markings, 64437323 edges, 559199 markings/sec, 35 secs
lola: 23896392 markings, 72087361 edges, 502036 markings/sec, 40 secs
lola: 26132010 markings, 78861134 edges, 447124 markings/sec, 45 secs
lola: 28361512 markings, 85572493 edges, 445900 markings/sec, 50 secs
lola: 30597531 markings, 92365307 edges, 447204 markings/sec, 55 secs
lola: 32676600 markings, 98683793 edges, 415814 markings/sec, 60 secs
lola: 34887904 markings, 105270571 edges, 442261 markings/sec, 65 secs
lola: 37017208 markings, 111700186 edges, 425861 markings/sec, 70 secs
lola: 39239820 markings, 118414292 edges, 444522 markings/sec, 75 secs
lola: 41365312 markings, 125000425 edges, 425098 markings/sec, 80 secs
lola: 43674502 markings, 131927392 edges, 461838 markings/sec, 85 secs
lola: 45985738 markings, 138776607 edges, 462247 markings/sec, 90 secs
lola: 48102626 markings, 145121019 edges, 423378 markings/sec, 95 secs
lola: 50191724 markings, 151378340 edges, 417820 markings/sec, 100 secs
lola: 52199302 markings, 157427184 edges, 401516 markings/sec, 105 secs
lola: 54008452 markings, 163334890 edges, 361830 markings/sec, 110 secs
lola: 55754838 markings, 169053458 edges, 349277 markings/sec, 115 secs
lola: 57759292 markings, 175151604 edges, 400891 markings/sec, 120 secs
lola: 59690269 markings, 181151313 edges, 386195 markings/sec, 125 secs
lola: 61655332 markings, 187133953 edges, 393013 markings/sec, 130 secs
lola: 63692067 markings, 193251813 edges, 407347 markings/sec, 135 secs
lola: 65673271 markings, 199219143 edges, 396241 markings/sec, 140 secs
lola: 67516036 markings, 205027301 edges, 368553 markings/sec, 145 secs
lola: 69463124 markings, 210952681 edges, 389418 markings/sec, 150 secs
lola: 71323005 markings, 216659951 edges, 371976 markings/sec, 155 secs
lola: 73139411 markings, 222408618 edges, 363281 markings/sec, 160 secs
lola: 74972486 markings, 228106093 edges, 366615 markings/sec, 165 secs
lola: 76847251 markings, 233941710 edges, 374953 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 898 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (G ((KdStarGStarP3kP3 <= Akt))) U (KdStar + 1 <= Enz)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(E(TRUE U (Akt + 1 <= KdStarGStarP3kP3))) U (KdStar + 1 <= Enz))
lola: processed formula length: 69
lola: 3 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 3417636 markings, 7095175 edges, 3111068700548005888 markings/sec, 0 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 14 will run for 1344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((((3 <= KdStarGStarP3kStarP3) OR (3 <= KdStarPgStar) OR ((2 <= KdStarGStarP3kStarP3P2) AND (KdStarGStarP3kP3 <= DAGE))) OR A (X ((PtP2 <= KdStarGStarP3kStar))))) AND NOT((((KdStarGStarP3 <= 1) OR ((PtP2 <= KdStarGP3) AND (KdStarGStarPgStarP3P2 <= Gab1))) AND E (F ((Akt <= Pip3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((KdStarGStarP3kStarP3 <= 2) AND (KdStarPgStar <= 2) AND ((KdStarGStarP3kStarP3P2 <= 1) OR (DAGE + 1 <= KdStarGStarP3kP3)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((KdStarGStarP3kStarP3 <= 2) AND (KdStarPgStar <= 2) AND ((KdStarGStarP3kStarP3P2 <= 1) OR (DAGE + 1 <= KdStarGStarP3kP3)))
lola: processed formula length: 124
lola: lola: ========================================
11 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: processed formula with 4 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2689 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((KdStarGStarP3kStar + 1 <= PtP2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((KdStarGStarP3kStar + 1 <= PtP2))
lola: processed formula length: 36
lola: 12 rewrites
lola: formula mentions 0 of 39 places; total mentions: 0
lola: closed formula file Angiogenesis-PT-25-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((Pip3 + 1 <= Akt)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2689 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Akt <= 1) OR (AktStar + 1 <= KdStarGStarP3kP3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 124 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown unknown no yes no no yes unknown yes yes yes yes unknown no unknown yes
FORMULA Angiogenesis-PT-25-CTLCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Angiogenesis-PT-25-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494599424698

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

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="Angiogenesis-PT-25"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/Angiogenesis-PT-25.tgz
mv Angiogenesis-PT-25 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is Angiogenesis-PT-25, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r008-csrt-149436125900138"
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 ;