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 RobotManipulation-PT-00010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172700220
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496340139884


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
RobotManipulation-PT-00010: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
RobotManipulation-PT-00010: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ RobotManipulation-PT-00010 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 26/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 15 places, 11 transitions, 9 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 14 transition conflict sets
lola: TASK
lola: reading formula from RobotManipulation-PT-00010-CTLFireability.task
lola: NOT(NOT(A (G (E (F (FIREABLE(p_started))))))) : (NOT((NOT(A (F (FIREABLE(p_sop)))) OR A (X (FIREABLE(p_sop))))) AND NOT(A (X ((NOT FIREABLE(p_started) AND (FIREABLE(r_end_move) OR FIREABLE(p_relSC))))))) : A (G (A (X (E (F (FIREABLE(p_intoSC))))))) : ((NOT FIREABLE(r_starts) AND A (G (E (F (FIREABLE(p_start)))))) OR E ((FIREABLE(r_begin_move) U FIREABLE(r_begin_move)))) : A (G (A (F (((FIREABLE(p_start) AND FIREABLE(p_started)) OR (FIREABLE(p_start) AND FIREABLE(p_move))))))) : E (F ((FIREABLE(p_move) AND (A (G (FIREABLE(p_sop))) AND (NOT FIREABLE(p_relSC) OR NOT FIREABLE(r_stops)))))) : (E ((E (F (FIREABLE(r_starts))) U A (X (FIREABLE(p_relSC))))) OR NOT(A (F ((NOT FIREABLE(p_relSC) AND NOT FIREABLE(r_begin_move)))))) : NOT(E (F ((FIREABLE(p_moved) AND FIREABLE(r_end_move) AND (FIREABLE(r_stops) OR FIREABLE(p_sop)) AND FIREABLE(r_begin_move) AND FIREABLE(r_starts) AND NOT FIREABLE(p_relSC))))) : (FIREABLE(p_intoSC) OR (A (F (E (G (FIREABLE(p_sop))))) OR (A (F (FIREABLE(r_end_move))) AND NOT(A (X (FIREABLE(p_relSC))))))) : E (F ((NOT FIREABLE(p_start) OR (A (G (FIREABLE(p_move))) AND NOT FIREABLE(r_begin_move))))) : A ((((NOT FIREABLE(r_end_move) AND NOT FIREABLE(p_relSC)) OR FIREABLE(r_end_move)) U (FIREABLE(p_started) OR (NOT FIREABLE(p_sop))))) : NOT(A (F (E ((FIREABLE(p_move) U FIREABLE(p_intoSC)))))) : A (F ((FIREABLE(p_started) AND E (F (FIREABLE(p_sop)))))) : NOT((A (F (FIREABLE(p_started))) OR FIREABLE(r_starts))) : (E (X (FIREABLE(r_begin_move))) OR NOT(E (X (A (G (FIREABLE(p_start))))))) : A (F (A (X (A (F (FIREABLE(p_sop)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(A (G (E (F (FIREABLE(p_started)))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U FIREABLE(p_started)))))
lola: processed formula length: 49
lola: 12 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((NOT(A (F (FIREABLE(p_sop)))) OR A (X (FIREABLE(p_sop))))) AND NOT(A (X ((NOT FIREABLE(p_started) AND (FIREABLE(r_end_move) OR FIREABLE(p_relSC)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(p_sop)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(p_sop))
lola: processed formula length: 25
lola: 15 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT FIREABLE(p_sop)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT FIREABLE(p_sop))
lola: processed formula length: 23
lola: 15 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X ((FIREABLE(p_started) OR (NOT FIREABLE(r_end_move) AND NOT FIREABLE(p_relSC)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX((FIREABLE(p_started) OR (NOT FIREABLE(r_end_move) AND NOT FIREABLE(p_relSC))))
lola: processed formula length: 82
lola: 15 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X (E (F (FIREABLE(p_intoSC)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX(E(TRUE U FIREABLE(p_intoSC))))))
lola: processed formula length: 52
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1007062 markings, 5694727 edges, 3689348869717491712 markings/sec, 0 secs
lola: 1809350 markings, 10893943 edges, 160458 markings/sec, 5 secs
lola: 2491163 markings, 15720058 edges, 136363 markings/sec, 10 secs
lola: 3120762 markings, 20484148 edges, 125920 markings/sec, 15 secs
lola: 3698397 markings, 25138075 edges, 115527 markings/sec, 20 secs
lola: 4231396 markings, 29673344 edges, 106600 markings/sec, 25 secs
lola: 4740452 markings, 34172247 edges, 101811 markings/sec, 30 secs
lola: 5220746 markings, 38575016 edges, 96059 markings/sec, 35 secs
lola: 5671098 markings, 42889875 edges, 90070 markings/sec, 40 secs
lola: 6100114 markings, 47085038 edges, 85803 markings/sec, 45 secs
lola: 6522972 markings, 51322111 edges, 84572 markings/sec, 50 secs
lola: 6926196 markings, 55477233 edges, 80645 markings/sec, 55 secs
lola: 7303463 markings, 59432968 edges, 75453 markings/sec, 60 secs
lola: 7691199 markings, 63571385 edges, 77547 markings/sec, 65 secs
lola: 8057071 markings, 67623449 edges, 73174 markings/sec, 70 secs
lola: 8420356 markings, 71670382 edges, 72657 markings/sec, 75 secs
lola: 8772183 markings, 75641180 edges, 70365 markings/sec, 80 secs
lola: 9112259 markings, 79621491 edges, 68015 markings/sec, 85 secs
lola: 9449136 markings, 83566171 edges, 67375 markings/sec, 90 secs
lola: 9763796 markings, 87340153 edges, 62932 markings/sec, 95 secs
lola: 10081209 markings, 91248156 edges, 63483 markings/sec, 100 secs
lola: 10395018 markings, 95140802 edges, 62762 markings/sec, 105 secs
lola: 10701667 markings, 99019693 edges, 61330 markings/sec, 110 secs
lola: 10999403 markings, 102815535 edges, 59547 markings/sec, 115 secs
lola: 11292184 markings, 106602305 edges, 58556 markings/sec, 120 secs
lola: 11585610 markings, 110392530 edges, 58685 markings/sec, 125 secs
lola: 11873247 markings, 114165443 edges, 57527 markings/sec, 130 secs
lola: 12151341 markings, 117952551 edges, 55619 markings/sec, 135 secs
lola: 12424078 markings, 121619506 edges, 54547 markings/sec, 140 secs
lola: 12678891 markings, 125091123 edges, 50963 markings/sec, 145 secs
lola: 12925172 markings, 128571135 edges, 49256 markings/sec, 150 secs
lola: 13174146 markings, 132040446 edges, 49795 markings/sec, 155 secs
lola: 13411702 markings, 135408909 edges, 47511 markings/sec, 160 secs
lola: 13650959 markings, 138862855 edges, 47851 markings/sec, 165 secs
lola: 13881977 markings, 142287754 edges, 46204 markings/sec, 170 secs
lola: 14115277 markings, 145744539 edges, 46660 markings/sec, 175 secs
lola: 14346553 markings, 149214262 edges, 46255 markings/sec, 180 secs
lola: 14575540 markings, 152662564 edges, 45797 markings/sec, 185 secs
lola: 14797687 markings, 156071909 edges, 44429 markings/sec, 190 secs
lola: 15018409 markings, 159502975 edges, 44144 markings/sec, 195 secs
lola: 15235819 markings, 162904527 edges, 43482 markings/sec, 200 secs
lola: 15450245 markings, 166311384 edges, 42885 markings/sec, 205 secs
lola: 15659639 markings, 169695203 edges, 41879 markings/sec, 210 secs
lola: 15864535 markings, 173057924 edges, 40979 markings/sec, 215 secs
lola: 16069246 markings, 176432100 edges, 40942 markings/sec, 220 secs
lola: 16267351 markings, 179793539 edges, 39621 markings/sec, 225 secs
lola: 16470812 markings, 183152685 edges, 40692 markings/sec, 230 secs
lola: 16669815 markings, 186491887 edges, 39801 markings/sec, 235 secs
lola: 16863208 markings, 189821032 edges, 38679 markings/sec, 240 secs
lola: 17052491 markings, 193152156 edges, 37857 markings/sec, 245 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT FIREABLE(r_starts) AND A (G (E (F (FIREABLE(p_start)))))) OR E ((FIREABLE(r_begin_move) U FIREABLE(r_begin_move))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(r_starts)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(r_starts)
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: processed formula with 0 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 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (FIREABLE(p_start)))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U FIREABLE(p_start)))))
lola: processed formula length: 47
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: lola: ========================================
The Boolean predicate is true.
lola: subprocess 4 will run for 273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F (((FIREABLE(p_start) AND FIREABLE(p_started)) OR (FIREABLE(p_start) AND FIREABLE(p_move)))))))
lola: ========================================lola:
lola: ========================================
SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U ((FIREABLE(p_start) AND FIREABLE(p_started)) OR (FIREABLE(p_start) AND FIREABLE(p_move)))))))
lola: processed formula length: 120
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 298 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(p_move) AND (A (G (FIREABLE(p_sop))) AND (NOT FIREABLE(p_relSC) OR NOT FIREABLE(r_stops))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (FIREABLE(p_move) AND (NOT(E(TRUE U NOT FIREABLE(p_sop))) AND (NOT FIREABLE(p_relSC) OR NOT FIREABLE(r_stops)))))
lola: processed formula length: 123
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: 1013236 markings, 4820966 edges, 2690321884481847296 markings/sec, 0 secs
lola: 1823065 markings, 8844376 edges, 161966 markings/sec, 5 secs
lola: 2569657 markings, 12572251 edges, 149318 markings/sec, 10 secs
lola: 3293702 markings, 16138807 edges, 144809 markings/sec, 15 secs
lola: 3828246 markings, 19391364 edges, 106909 markings/sec, 20 secs
lola: 4202875 markings, 22307851 edges, 74926 markings/sec, 25 secs
lola: 4595502 markings, 25327615 edges, 78525 markings/sec, 30 secs
lola: 5017870 markings, 28512433 edges, 84474 markings/sec, 35 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E ((E (F (FIREABLE(r_starts))) U A (X (FIREABLE(p_relSC))))) OR NOT(A (F ((NOT FIREABLE(p_relSC) AND NOT FIREABLE(r_begin_move))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (F (FIREABLE(r_starts))) U A (X (FIREABLE(p_relSC)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U FIREABLE(r_starts)) U AX(FIREABLE(p_relSC)))
lola: processed formula length: 55
lola: 6 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 2 significant temporal operators and needs 9 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ...considering subproblem: NOT(E (F ((FIREABLE(p_moved) AND FIREABLE(r_end_move) AND (FIREABLE(r_stops) OR FIREABLE(p_sop)) AND FIREABLE(r_begin_move) AND FIREABLE(r_starts) AND NOT FIREABLE(p_relSC)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(p_intoSC) OR (A (F (E (G (FIREABLE(p_sop))))) OR (A (F (FIREABLE(r_end_move))) AND NOT(A (X (FIREABLE(p_relSC)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(p_intoSC)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(p_intoSC)
lola: processed formula length: 18
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.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 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (FIREABLE(p_sop)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U NOT FIREABLE(p_sop))))
lola: processed formula length: 44
lola: 6 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(p_start) OR (A (G (FIREABLE(p_move))) AND NOT FIREABLE(r_begin_move)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT FIREABLE(p_start)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((NOT FIREABLE(r_end_move) AND NOT FIREABLE(p_relSC)) OR FIREABLE(r_end_move)) U (FIREABLE(p_started) OR (NOT FIREABLE(p_sop)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((NOT FIREABLE(r_end_move) AND NOT FIREABLE(p_relSC)) OR FIREABLE(r_end_move)) U (FIREABLE(p_started) OR (NOT FIREABLE(p_sop))))
lola: processed formula length: 132
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E ((FIREABLE(p_move) U FIREABLE(p_intoSC))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(FIREABLE(p_move) U FIREABLE(p_intoSC))))
lola: processed formula length: 55
lola: 11 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 810 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(p_started) AND E (F (FIREABLE(p_sop))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(p_started) AND E(TRUE U FIREABLE(p_sop))))
lola: processed formula length: 61
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F (FIREABLE(p_started))) OR FIREABLE(r_starts)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(p_started)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(p_started)))
lola: processed formula length: 34
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (FIREABLE(r_begin_move))) OR NOT(E (X (A (G (FIREABLE(p_start)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 14 will run for 1621 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (FIREABLE(r_begin_move)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(r_begin_move))
lola: processed formula length: 26
lola: 6 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F (NOT FIREABLE(p_start)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U NOT FIREABLE(p_start)))
lola: processed formula length: 35
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 3243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X (A (F (FIREABLE(p_sop)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(A(TRUE U FIREABLE(p_sop))))
lola: processed formula length: 39
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-00010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 36 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 2 significant temporal operators and needs 9 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: RESULT
lola:
SUMMARY: yes yes unknown yes no no yes no yes yes yes no yes no yes yes
lola: ========================================
FORMULA RobotManipulation-PT-00010-CTLFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-2 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-00010-CTLFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496340436964

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