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 MAPK-PT-320, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r038-blw7-149440484700213
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494630804423


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
LTLFireability @ MAPK-PT-320 @ 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: 52/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 22 places, 30 transitions, 15 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from MAPK-PT-320-LTLFireability.task
lola: A ((G (F (G (FIREABLE(k27)))) U F (FIREABLE(k16)))) : A ((X ((FIREABLE(k7) U FIREABLE(k11))) U F ((FIREABLE(k12) U FIREABLE(k12))))) : A (F (F (G (F (X (FIREABLE(k5))))))) : A (F ((X (G (FIREABLE(k9))) U FIREABLE(k10)))) : A (FIREABLE(k17)) : A (FIREABLE(k24)) : A (F (G (G ((FIREABLE(k15) U FIREABLE(k23)))))) : A (F ((F (X (FIREABLE(k5))) U (FIREABLE(k29) U FIREABLE(k5))))) : A (G (F (F (G (F (FIREABLE(k21))))))) : A (G (F ((G (FIREABLE(k21)) U X (FIREABLE(k24)))))) : A (FIREABLE(k26)) : A (X (F (X (X (F (FIREABLE(k1))))))) : A (((F (FIREABLE(k26)) U G (FIREABLE(k25))) U G (X (FIREABLE(k12))))) : A (F (F (FIREABLE(k5)))) : A (F (F (FIREABLE(k3)))) : A (X (F (F (G (G (FIREABLE(k1)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F (G (FIREABLE(k27)))) U F (FIREABLE(k16))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((F (G (FIREABLE(k27))) U F (FIREABLE(k16))))
lola: processed formula: A ((F (G (FIREABLE(k27))) U F (FIREABLE(k16))))
lola: processed formula length: 47
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X ((FIREABLE(k7) U FIREABLE(k11))) U F ((FIREABLE(k12) U FIREABLE(k12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((FIREABLE(k7) U FIREABLE(k11))) U F ((FIREABLE(k12) U FIREABLE(k12)))))
lola: processed formula: A ((X ((FIREABLE(k7) U FIREABLE(k11))) U F ((FIREABLE(k12) U FIREABLE(k12)))))
lola: processed formula length: 78
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (G (F (X (FIREABLE(k5)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (X (FIREABLE(k5)))))
lola: processed formula: A (G (F (X (FIREABLE(k5)))))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((X (G (FIREABLE(k9))) U FIREABLE(k10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (G (FIREABLE(k9))) U FIREABLE(k10))))
lola: processed formula: A (F ((X (G (FIREABLE(k9))) U FIREABLE(k10))))
lola: processed formula length: 46
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(k17))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k17)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: processed formula with 0 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(k24))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k24)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: processed formula with 0 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 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (G ((FIREABLE(k15) U FIREABLE(k23))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (G ((FIREABLE(k15) U FIREABLE(k23))))))
lola: processed formula: A (F (G (G ((FIREABLE(k15) U FIREABLE(k23))))))
lola: processed formula length: 47
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((F (X (FIREABLE(k5))) U (FIREABLE(k29) U FIREABLE(k5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F (X (FIREABLE(k5))) U (FIREABLE(k29) U FIREABLE(k5)))))
lola: processed formula: A (F ((F (X (FIREABLE(k5))) U (FIREABLE(k29) U FIREABLE(k5)))))
lola: processed formula length: 63
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F (F (G (F (FIREABLE(k21)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (G (F (FIREABLE(k21)))))
lola: processed formula: A (G (G (F (FIREABLE(k21)))))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (F ((G (FIREABLE(k21)) U X (FIREABLE(k24))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G (FIREABLE(k21)) U X (FIREABLE(k24))))))
lola: processed formula: A (G (F ((G (FIREABLE(k21)) U X (FIREABLE(k24))))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (FIREABLE(k26))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(k26)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: processed formula with 0 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 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (X (X (F (FIREABLE(k1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (X (X (F (FIREABLE(k1)))))))
lola: processed formula: A (X (F (X (X (F (FIREABLE(k1)))))))
lola: processed formula length: 36
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((F (FIREABLE(k26)) U G (FIREABLE(k25))) U G (X (FIREABLE(k12)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((F (FIREABLE(k26)) U G (FIREABLE(k25))) U G (X (FIREABLE(k12)))))
lola: processed formula: A (((F (FIREABLE(k26)) U G (FIREABLE(k25))) U G (X (FIREABLE(k12)))))
lola: processed formula length: 69
lola: 0 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 12 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 28 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (FIREABLE(k5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (FIREABLE(k5)))
lola: processed formula: A (F (FIREABLE(k5)))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (F (FIREABLE(k3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (FIREABLE(k3)))
lola: processed formula: A (F (FIREABLE(k3)))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (F (F (G (G (FIREABLE(k1)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (G (G (FIREABLE(k1))))))
lola: processed formula: A (X (F (G (G (FIREABLE(k1))))))
lola: processed formula length: 32
lola: 1 rewrites
lola: formula mentions 0 of 22 places; total mentions: 0
lola: closed formula file MAPK-PT-320-LTLFireability.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 64 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 3389326 markings, 8461041 edges, 677865 markings/sec, 0 secs
lola: 6893979 markings, 17234540 edges, 700931 markings/sec, 5 secs
lola: 10234648 markings, 25562684 edges, 668134 markings/sec, 10 secs
lola: 13732965 markings, 34292052 edges, 699663 markings/sec, 15 secs
lola: 17021934 markings, 42489529 edges, 657794 markings/sec, 20 secs
lola: 20376917 markings, 50852109 edges, 670997 markings/sec, 25 secs
lola: 23745055 markings, 59256923 edges, 673628 markings/sec, 30 secs
lola: 27032222 markings, 67451549 edges, 657433 markings/sec, 35 secs
lola: 30155672 markings, 75264235 edges, 624690 markings/sec, 40 secs
lola: 33405566 markings, 83404858 edges, 649979 markings/sec, 45 secs
lola: 37000980 markings, 92380058 edges, 719083 markings/sec, 50 secs
lola: 39647772 markings, 98976109 edges, 529358 markings/sec, 55 secs
lola: 42695919 markings, 106574220 edges, 609629 markings/sec, 60 secs
lola: 45516590 markings, 113602640 edges, 564134 markings/sec, 65 secs
lola: 48668599 markings, 121457035 edges, 630402 markings/sec, 70 secs
lola: 52007590 markings, 129820794 edges, 667798 markings/sec, 75 secs
lola: 54929783 markings, 137130879 edges, 584439 markings/sec, 80 secs
lola: 57962075 markings, 144689282 edges, 606458 markings/sec, 85 secs
lola: 60954299 markings, 152146272 edges, 598445 markings/sec, 90 secs
lola: 63585157 markings, 158703416 edges, 526172 markings/sec, 95 secs
lola: 66654036 markings, 166354770 edges, 613776 markings/sec, 100 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no no no no no yes no no yes unknown
FORMULA MAPK-PT-320-LTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA MAPK-PT-320-LTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494630911575

--------------------
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="MAPK-PT-320"
export BK_EXAMINATION="LTLFireability"
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/MAPK-PT-320.tgz
mv MAPK-PT-320 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 MAPK-PT-320, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r038-blw7-149440484700213"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.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 ;