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-01000, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-149581172800273
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496345291281


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


checking for too many tokens
===========================================================================================
RobotManipulation-PT-01000: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ RobotManipulation-PT-01000 @ 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: 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-01000-CTLCardinality.task
lola: A ((E (G ((3 <= p_m))) U A (G ((r_active <= r_stopped))))) : E ((E (G ((3 <= p_sc))) U A (G ((move <= access))))) : A (G (A (((3 <= off) U TRUE)))) : E (F (A (G (((2 <= off) OR (moved <= move)))))) : E (F ((access <= p_i2))) : A (G (NOT(E (G ((p_i1 <= r_active)))))) : A ((E (F ((3 <= p_rel))) U (1 <= initialize))) : A (G (((r_stopped <= access) OR (access <= moved) OR ((1 <= p_m) AND ((p_i1 <= p_rdy) OR (3 <= r_active)))))) : ((A (G ((p_rel <= 1))) OR A (X ((access <= initialized)))) AND (3 <= access)) : (((((1 <= moved) OR (move <= initialize)) AND (3 <= p_i2)) OR ((1 <= move) AND (p_rel <= p_sc) AND (initialize <= 0)) OR ((1 <= p_i2) AND (1 <= initialized))) OR A (G (E (F ((initialized <= r_stopped)))))) : A (F ((1 <= initialized))) : E ((A (F ((1 <= initialized))) U (1 <= p_sc))) : NOT(E (F ((2 <= p_rel)))) : NOT(E (((initialized <= 0) U (p_rdy + 1 <= p_sc)))) : NOT(NOT((E (G ((move <= p_m))) AND A (G ((p_rel <= p_i1)))))) : E (F (((1 <= initialized) AND (p_rdy <= p_rel) AND (p_rel + 1 <= p_rdy) AND (r_moving <= p_i1))))
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 ((E (G ((3 <= p_m))) U A (G ((r_active <= r_stopped)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (p_m <= 2))) U NOT(E(TRUE U (r_stopped + 1 <= r_active))))
lola: processed formula length: 73
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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 3 significant temporal operators and needs 13 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (G ((3 <= p_sc))) U A (G ((move <= access)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U (p_sc <= 2))) U NOT(E(TRUE U (access + 1 <= move))))
lola: processed formula length: 67
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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 3 significant temporal operators and needs 13 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((3 <= off) U TRUE))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((2 <= off) OR (moved <= move))))))
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 ((off <= 1) AND (move + 1 <= moved)))))
lola: processed formula length: 61
lola: 3 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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: 1138369 markings, 4137169 edges, 1982516909098139648 markings/sec, 0 secs
lola: 2256305 markings, 8276236 edges, 223587 markings/sec, 5 secs
lola: 3253861 markings, 12045486 edges, 199511 markings/sec, 10 secs
lola: 4222205 markings, 15711411 edges, 193669 markings/sec, 15 secs
lola: 5164981 markings, 19295536 edges, 188555 markings/sec, 20 secs
lola: 6108631 markings, 22890988 edges, 188730 markings/sec, 25 secs
lola: 7026374 markings, 26386312 edges, 183549 markings/sec, 30 secs
lola: 7992024 markings, 30011500 edges, 193130 markings/sec, 35 secs
lola: 8951896 markings, 33637883 edges, 191974 markings/sec, 40 secs
lola: 9856207 markings, 37083281 edges, 180862 markings/sec, 45 secs
lola: 10746708 markings, 40484252 edges, 178100 markings/sec, 50 secs
lola: 11637531 markings, 43884810 edges, 178165 markings/sec, 55 secs
lola: 12524085 markings, 47267692 edges, 177311 markings/sec, 60 secs
lola: 13445934 markings, 50758207 edges, 184370 markings/sec, 65 secs
lola: 14327473 markings, 54124588 edges, 176308 markings/sec, 70 secs
lola: 15267513 markings, 57677348 edges, 188008 markings/sec, 75 secs
lola: 16140827 markings, 61012407 edges, 174663 markings/sec, 80 secs
lola: 17042821 markings, 64458863 edges, 180399 markings/sec, 85 secs
lola: 17912444 markings, 67783364 edges, 173925 markings/sec, 90 secs
lola: 18778681 markings, 71093313 edges, 173247 markings/sec, 95 secs
lola: 19684375 markings, 74525090 edges, 181139 markings/sec, 100 secs
lola: 20554209 markings, 77848455 edges, 173967 markings/sec, 105 secs
lola: 21405309 markings, 81107940 edges, 170220 markings/sec, 110 secs
lola: 22273950 markings, 84425865 edges, 173728 markings/sec, 115 secs
lola: 23187346 markings, 87862896 edges, 182679 markings/sec, 120 secs
lola: 24053174 markings, 91170207 edges, 173166 markings/sec, 125 secs
lola: 24912829 markings, 94457146 edges, 171931 markings/sec, 130 secs
lola: 25763545 markings, 97711930 edges, 170143 markings/sec, 135 secs
lola: 26617813 markings, 100978523 edges, 170854 markings/sec, 140 secs
lola: 27483728 markings, 104300785 edges, 173183 markings/sec, 145 secs
lola: 28330600 markings, 107540932 edges, 169374 markings/sec, 150 secs
lola: 29231709 markings, 110925432 edges, 180222 markings/sec, 155 secs
lola: 30071497 markings, 114136031 edges, 167958 markings/sec, 160 secs
lola: 30900556 markings, 117305790 edges, 165812 markings/sec, 165 secs
lola: 31781132 markings, 120639748 edges, 176115 markings/sec, 170 secs
lola: 32618852 markings, 123841022 edges, 167544 markings/sec, 175 secs
lola: 33451669 markings, 127024935 edges, 166563 markings/sec, 180 secs
lola: 34287830 markings, 130223638 edges, 167232 markings/sec, 185 secs
lola: 35116244 markings, 133393579 edges, 165683 markings/sec, 190 secs
lola: 35938636 markings, 136544457 edges, 164478 markings/sec, 195 secs
lola: 36755677 markings, 139678092 edges, 163408 markings/sec, 200 secs
lola: 37664312 markings, 143109906 edges, 181727 markings/sec, 205 secs
lola: 38498543 markings, 146301950 edges, 166846 markings/sec, 210 secs
lola: 39320395 markings, 149450205 edges, 164370 markings/sec, 215 secs
lola: 40145332 markings, 152608725 edges, 164987 markings/sec, 220 secs
lola: 40958333 markings, 155727232 edges, 162600 markings/sec, 225 secs
lola: 41778108 markings, 158865754 edges, 163955 markings/sec, 230 secs
lola: 42605809 markings, 162032141 edges, 165540 markings/sec, 235 secs
lola: 43427621 markings, 165177578 edges, 164362 markings/sec, 240 secs
lola: 44245116 markings, 168307525 edges, 163499 markings/sec, 245 secs
lola: 45067795 markings, 171457108 edges, 164536 markings/sec, 250 secs
lola: 45884750 markings, 174586390 edges, 163391 markings/sec, 255 secs
lola: 46700176 markings, 177708384 edges, 163085 markings/sec, 260 secs
lola: 47516603 markings, 180836665 edges, 163285 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((access <= p_i2)))
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 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-4.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 297 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT(E (G ((p_i1 <= r_active))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (r_active + 1 <= p_i1)))))
lola: processed formula length: 52
lola: 5 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((3 <= p_rel))) U (1 <= initialize)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (3 <= p_rel)) U (1 <= initialize))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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: 5320580 markings, 7972016 edges, 1982516909098139648 markings/sec, 0 secs
lola: 10078203 markings, 15107416 edges, 951525 markings/sec, 5 secs
lola: 14516293 markings, 21763369 edges, 887618 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((r_stopped <= access) OR (access <= moved) OR ((1 <= p_m) AND ((p_i1 <= p_rdy) OR (3 <= r_active))))))
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 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: ========================================
lola: state equation: Generated DNF with 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-CTLCardinality-7.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 8 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (G ((p_rel <= 1))) OR A (X ((access <= initialized)))) AND (3 <= access))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p_rel <= 1)))
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 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: 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: subprocess 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((access <= initialized)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((access <= initialized))
lola: processed formula length: 27
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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: SUBRESULT
lola: result: no
lola: lola: ========================================
The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((((1 <= moved) OR (move <= initialize)) AND (3 <= p_i2)) OR ((1 <= move) AND (p_rel <= p_sc) AND (initialize <= 0)) OR ((1 <= p_i2) AND (1 <= initialized))) OR A (G (E (F ((initialized <= r_stopped))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((1 <= moved) OR (move <= initialize)) AND (3 <= p_i2)) OR ((1 <= move) AND (p_rel <= p_sc) AND (initialize <= 0)) OR ((1 <= p_i2) AND (1 <= initialized)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((1 <= moved) OR (move <= initialize)) AND (3 <= p_i2)) OR ((1 <= move) AND (p_rel <= p_sc) AND (initialize <= 0)) OR ((1 <= p_i2) AND (1 <= initialized)))
lola: processed formula length: 160
lola: 0 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.task
lola: processed formula with 8 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 10 will run for 541 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F ((initialized <= r_stopped)))))
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 (initialized <= r_stopped)))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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: 1872528 markings, 6532773 edges, 374506 markings/sec, 0 secs
lola: 3661247 markings, 12789161 edges, 357744 markings/sec, 5 secs
lola: 5419508 markings, 18940711 edges, 351652 markings/sec, 10 secs
lola: 7157704 markings, 25021813 edges, 347639 markings/sec, 15 secs
lola: 8874744 markings, 31029837 edges, 343408 markings/sec, 20 secs
lola: 10614009 markings, 37113402 edges, 347853 markings/sec, 25 secs
lola: 12376416 markings, 43357192 edges, 352481 markings/sec, 30 secs
lola: 14003333 markings, 49579946 edges, 325383 markings/sec, 35 secs
lola: 15562770 markings, 55550056 edges, 311887 markings/sec, 40 secs
lola: 17095977 markings, 61421422 edges, 306641 markings/sec, 45 secs
lola: 18585471 markings, 67126123 edges, 297899 markings/sec, 50 secs
lola: 20065842 markings, 72796635 edges, 296074 markings/sec, 55 secs
lola: 21540092 markings, 78443939 edges, 294850 markings/sec, 60 secs
lola: 23019213 markings, 84110346 edges, 295824 markings/sec, 65 secs
lola: 24580340 markings, 90064150 edges, 312225 markings/sec, 70 secs
lola: 26187270 markings, 96206316 edges, 321386 markings/sec, 75 secs
lola: 27684778 markings, 101936471 edges, 299502 markings/sec, 80 secs
lola: 29134543 markings, 107485782 edges, 289953 markings/sec, 85 secs
lola: 30563405 markings, 112956397 edges, 285772 markings/sec, 90 secs
lola: 31978460 markings, 118374610 edges, 283011 markings/sec, 95 secs
lola: 33391012 markings, 123783932 edges, 282510 markings/sec, 100 secs
lola: 34811510 markings, 129223982 edges, 284100 markings/sec, 105 secs
lola: 36273227 markings, 134813296 edges, 292343 markings/sec, 110 secs
lola: 37800140 markings, 140659711 edges, 305383 markings/sec, 115 secs
lola: 39317816 markings, 146473867 edges, 303535 markings/sec, 120 secs
lola: 40821415 markings, 152235058 edges, 300720 markings/sec, 125 secs
lola: 42310679 markings, 157941551 edges, 297853 markings/sec, 130 secs
lola: 43762464 markings, 163504750 edges, 290357 markings/sec, 135 secs
lola: 45201756 markings, 169020211 edges, 287858 markings/sec, 140 secs
lola: 46634278 markings, 174509875 edges, 286504 markings/sec, 145 secs
lola: 48078677 markings, 180045180 edges, 288880 markings/sec, 150 secs
lola: 49570212 markings, 185971800 edges, 298307 markings/sec, 155 secs
lola: 50947397 markings, 191700892 edges, 275437 markings/sec, 160 secs
lola: 52282254 markings, 197257081 edges, 266971 markings/sec, 165 secs
lola: 53591754 markings, 202707574 edges, 261900 markings/sec, 170 secs
lola: 54878859 markings, 208066841 edges, 257421 markings/sec, 175 secs
lola: 56142770 markings, 213328688 edges, 252782 markings/sec, 180 secs
lola: 57394551 markings, 218541420 edges, 250356 markings/sec, 185 secs
lola: 58638527 markings, 223721490 edges, 248795 markings/sec, 190 secs
lola: 59884691 markings, 228910580 edges, 249233 markings/sec, 195 secs
lola: 61276543 markings, 234428609 edges, 278370 markings/sec, 200 secs
lola: 62749853 markings, 240070011 edges, 294662 markings/sec, 205 secs
lola: 64191281 markings, 245591460 edges, 288286 markings/sec, 210 secs
lola: 65611461 markings, 251032079 edges, 284036 markings/sec, 215 secs
lola: 67012889 markings, 256401439 edges, 280286 markings/sec, 220 secs
lola: 68392644 markings, 261687935 edges, 275951 markings/sec, 225 secs
lola: 69757867 markings, 266919050 edges, 273045 markings/sec, 230 secs
lola: 71115931 markings, 272123075 edges, 271613 markings/sec, 235 secs
lola: 72483064 markings, 277361687 edges, 273427 markings/sec, 240 secs
lola: 73970382 markings, 282814388 edges, 297464 markings/sec, 245 secs
lola: 75391158 markings, 288030519 edges, 284155 markings/sec, 250 secs
lola: 76768326 markings, 293084657 edges, 275434 markings/sec, 255 secs
lola: 78130643 markings, 298097317 edges, 272463 markings/sec, 260 secs
lola: 79475949 markings, 303044075 edges, 269061 markings/sec, 265 secs
lola: 80802489 markings, 307955306 edges, 265308 markings/sec, 270 secs
lola: 82117524 markings, 312820060 edges, 263007 markings/sec, 275 secs
lola: 83440082 markings, 317698794 edges, 264512 markings/sec, 280 secs
lola: 84752412 markings, 322527235 edges, 262466 markings/sec, 285 secs
lola: 86035540 markings, 327312736 edges, 256626 markings/sec, 290 secs
lola: 87339246 markings, 332107296 edges, 260741 markings/sec, 295 secs
lola: 88623880 markings, 336886941 edges, 256927 markings/sec, 300 secs
lola: 89907251 markings, 341632618 edges, 256674 markings/sec, 305 secs
lola: 91189002 markings, 346396592 edges, 256350 markings/sec, 310 secs
lola: 92470011 markings, 351113391 edges, 256202 markings/sec, 315 secs
lola: 93731891 markings, 355798122 edges, 252376 markings/sec, 320 secs
lola: 95001476 markings, 360515741 edges, 253917 markings/sec, 325 secs
lola: 96268220 markings, 365188521 edges, 253349 markings/sec, 330 secs
lola: 97539079 markings, 369864311 edges, 254172 markings/sec, 335 secs
lola: 98777362 markings, 374470590 edges, 247657 markings/sec, 340 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: subprocess 10 will run for 483 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= initialized)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (1 <= initialized))
lola: processed formula length: 28
lola: 1 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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 580 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((1 <= initialized))) U (1 <= p_sc)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (1 <= initialized)) U (1 <= p_sc))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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 12 will run for 725 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F ((2 <= p_rel))))
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 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: 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: subprocess 13 will run for 967 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (((initialized <= 0) U (p_rdy + 1 <= p_sc))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((initialized <= 0) U (p_rdy + 1 <= p_sc)))
lola: processed formula length: 48
lola: 7 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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 14 will run for 1451 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT((E (G ((move <= p_m))) AND A (G ((p_rel <= p_i1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1451 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((move <= p_m)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p_m + 1 <= move)))
lola: processed formula length: 32
lola: 16 rewrites
lola: formula mentions 0 of 15 places; total mentions: 0
lola: closed formula file RobotManipulation-PT-01000-CTLCardinality.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 15 will run for 2903 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p_rel <= p_i1)))
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 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: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 15 will run for 2903 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= initialized) AND (p_rdy <= p_rel) AND (p_rel + 1 <= p_rdy) AND (r_moving <= p_i1))))
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 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: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to RobotManipulation-PT-01000-CTLCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file RobotManipulation-PT-01000-CTLCardinality-15.sara.

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: RESULT
lola:
SUMMARY: no no yes unknown yes no yes yes no unknown yes yes no yes no no
lola: ========================================
FORMULA RobotManipulation-PT-01000-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA RobotManipulation-PT-01000-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496345928444

--------------------
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-01000"
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/RobotManipulation-PT-01000.tgz
mv RobotManipulation-PT-01000 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-01000, 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 r208-smll-149581172800273"
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 ;