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 Echo-PT-d02r11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r028-blw3-149440264100252
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494685864491


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ Echo-PT-d02r11 @ 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: 1993/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 1119 places, 874 transitions, 558 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1736 transition conflict sets
lola: TASK
lola: reading formula from Echo-PT-d02r11-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t8) AND NOT FIREABLE(t82)) OR NOT FIREABLE(t359) OR NOT FIREABLE(t159)))) : A (G (((NOT FIREABLE(t441) OR FIREABLE(t766)) AND (NOT FIREABLE(t95) OR (NOT FIREABLE(t84) AND NOT FIREABLE(t126)))))) : A (G (NOT FIREABLE(t546))) : E (F (((FIREABLE(t278) AND FIREABLE(t708)) OR (FIREABLE(t750) AND FIREABLE(t195) AND FIREABLE(t507) AND FIREABLE(t222))))) : E (F (FIREABLE(t548))) : A (G ((FIREABLE(t462) OR FIREABLE(t311) OR FIREABLE(t232) OR NOT FIREABLE(t310) OR NOT FIREABLE(t781) OR FIREABLE(t476)))) : E (F ((FIREABLE(t49) OR (FIREABLE(t225) AND FIREABLE(t611) AND (FIREABLE(t63) OR FIREABLE(t780) OR NOT FIREABLE(t415)))))) : E (F (FIREABLE(t489))) : E (F ((FIREABLE(t806) AND FIREABLE(t740) AND FIREABLE(t400)))) : E (F (FIREABLE(t114))) : E (F (FIREABLE(t803))) : E (F ((NOT FIREABLE(t95) AND ((FIREABLE(t638) AND FIREABLE(t464)) OR (FIREABLE(t1) AND FIREABLE(t241))) AND FIREABLE(t219)))) : E (F (FIREABLE(t678))) : E (F ((FIREABLE(t575) OR FIREABLE(t148) OR FIREABLE(t665) OR ((FIREABLE(t858) OR FIREABLE(t466)) AND NOT FIREABLE(t267)) OR (FIREABLE(t81) AND ((FIREABLE(t462) AND FIREABLE(t593)) OR (FIREABLE(t283) AND FIREABLE(t441))))))) : A (G ((((FIREABLE(t858) AND FIREABLE(t438)) OR NOT FIREABLE(t340) OR (FIREABLE(t534) AND FIREABLE(t284) AND (FIREABLE(t579) OR FIREABLE(t385)))) AND NOT FIREABLE(t95)))) : E (F (((FIREABLE(t519) OR FIREABLE(t213) OR NOT FIREABLE(t235)) AND FIREABLE(t103) AND FIREABLE(t21))))
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 (((NOT FIREABLE(t8) AND NOT FIREABLE(t82)) OR NOT FIREABLE(t359) OR NOT FIREABLE(t159))))
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 72 bytes per marking, with 18 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 14 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r11-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 2164548 markings, 2168665 edges, 432910 markings/sec, 0 secs
lola: sara is running 5 secs || 4333527 markings, 4341902 edges, 433796 markings/sec, 5 secs
lola: sara is running 10 secs || 6496118 markings, 6508739 edges, 432518 markings/sec, 10 secs
lola: sara is running 15 secs || 8619258 markings, 8636088 edges, 424628 markings/sec, 15 secs
lola: sara is running 20 secs || 10752834 markings, 10773943 edges, 426715 markings/sec, 20 secs
lola: sara is running 25 secs || 12910663 markings, 12936101 edges, 431566 markings/sec, 25 secs
lola: sara is running 30 secs || 15032957 markings, 15062653 edges, 424459 markings/sec, 30 secs
lola: sara is running 35 secs || 17138329 markings, 17172248 edges, 421074 markings/sec, 35 secs
sara: warning, failure of lp_solve (at job 586)
lola: sara is running 40 secs || 19247018 markings, 19285168 edges, 421738 markings/sec, 40 secs
lola: sara is running 45 secs || 21361499 markings, 21403891 edges, 422896 markings/sec, 45 secs
lola: sara is running 50 secs || 23475818 markings, 23522451 edges, 422864 markings/sec, 50 secs
lola: sara is running 55 secs || 25581222 markings, 25632079 edges, 421081 markings/sec, 55 secs
lola: sara is running 60 secs || 27690832 markings, 27745921 edges, 421922 markings/sec, 60 secs
lola: sara is running 65 secs || 29805407 markings, 29864826 edges, 422915 markings/sec, 65 secs
lola: sara is running 70 secs || 31931789 markings, 31995569 edges, 425276 markings/sec, 70 secs
lola: sara is running 75 secs || 34041275 markings, 34109382 edges, 421897 markings/sec, 75 secs
lola: sara is running 80 secs || 36161124 markings, 36233577 edges, 423970 markings/sec, 80 secs
lola: sara is running 85 secs || 38288953 markings, 38365771 edges, 425566 markings/sec, 85 secs
lola: sara is running 90 secs || 40415830 markings, 40497010 edges, 425375 markings/sec, 90 secs
lola: sara is running 95 secs || 42546709 markings, 42632259 edges, 426176 markings/sec, 95 secs
lola: sara is running 100 secs || 44652154 markings, 44742022 edges, 421089 markings/sec, 100 secs
lola: sara is running 105 secs || 46761003 markings, 46855196 edges, 421770 markings/sec, 105 secs
lola: sara is running 110 secs || 48848222 markings, 48946697 edges, 417444 markings/sec, 110 secs
lola: sara is running 115 secs || 50950063 markings, 51052849 edges, 420368 markings/sec, 115 secs
lola: sara is running 120 secs || 53054635 markings, 53161738 edges, 420914 markings/sec, 120 secs
lola: sara is running 125 secs || 55157553 markings, 55268968 edges, 420584 markings/sec, 125 secs
lola: sara is running 130 secs || 57252759 markings, 57368472 edges, 419041 markings/sec, 130 secs
lola: sara is running 135 secs || 59346630 markings, 59466637 edges, 418774 markings/sec, 135 secs
lola: sara is running 140 secs || 61437452 markings, 61561747 edges, 418164 markings/sec, 140 secs
lola: sara is running 145 secs || 63531203 markings, 63659793 edges, 418750 markings/sec, 145 secs
lola: sara is running 150 secs || 65649821 markings, 65782756 edges, 423724 markings/sec, 150 secs
lola: sara is running 155 secs || 67755628 markings, 67892881 edges, 421161 markings/sec, 155 secs
lola: sara is running 160 secs || 69862726 markings, 70004302 edges, 421420 markings/sec, 160 secs
lola: sara is running 165 secs || 71970987 markings, 72116886 edges, 421652 markings/sec, 165 secs
lola: sara is running 170 secs || 74088034 markings, 74238274 edges, 423409 markings/sec, 170 secs
lola: sara is running 175 secs || 76212374 markings, 76366971 edges, 424868 markings/sec, 175 secs
lola: sara is running 180 secs || 78325415 markings, 78484347 edges, 422608 markings/sec, 180 secs
lola: sara is running 185 secs || 80441379 markings, 80604651 edges, 423193 markings/sec, 185 secs
lola: sara is running 190 secs || 82546820 markings, 82714410 edges, 421088 markings/sec, 190 secs
lola: sara is running 195 secs || 84645846 markings, 84817740 edges, 419805 markings/sec, 195 secs
lola: sara is running 200 secs || 86753874 markings, 86930092 edges, 421606 markings/sec, 200 secs
lola: sara is running 205 secs || 88843591 markings, 89024095 edges, 417943 markings/sec, 205 secs
lola: sara is running 210 secs || 90914706 markings, 91099459 edges, 414223 markings/sec, 210 secs
lola: sara is running 215 secs || 92964796 markings, 93153752 edges, 410018 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t441) OR FIREABLE(t766)) AND (NOT FIREABLE(t95) OR (NOT FIREABLE(t84) AND NOT FIREABLE(t126))))))
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 72 bytes per marking, with 18 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 20 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: The predicate is not invariant.
state equation: calling and running sara
lola: ========================================
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t546)))
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 72 bytes per marking, with 18 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
sara: try reading problem file Echo-PT-d02r11-ReachabilityFireability.sara.
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-2.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: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t278) AND FIREABLE(t708)) OR (FIREABLE(t750) AND FIREABLE(t195) AND FIREABLE(t507) AND FIREABLE(t222)))))
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 72 bytes per marking, with 18 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 17 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-3.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t548)))
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 72 bytes per marking, with 18 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-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 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t462) OR FIREABLE(t311) OR FIREABLE(t232) OR NOT FIREABLE(t310) OR NOT FIREABLE(t781) OR FIREABLE(t476))))
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 72 bytes per marking, with 18 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 480 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Echo-PT-d02r11-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 1669814 markings, 2412220 edges, 333963 markings/sec, 0 secs
sara: warning, failure of lp_solve (at job 85)

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t49) OR (FIREABLE(t225) AND FIREABLE(t611) AND (FIREABLE(t63) OR FIREABLE(t780) OR NOT FIREABLE(t415))))))
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 72 bytes per marking, with 18 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 30 literals and 5 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t489)))
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 72 bytes per marking, with 18 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 Echo-PT-d02r11-ReachabilityFireability-7.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 413 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t806) AND FIREABLE(t740) AND FIREABLE(t400))))
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 72 bytes per marking, with 18 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 10 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-8.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 472 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t114)))
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 72 bytes per marking, with 18 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: ========================================
lola: subprocess 10 will run for 551 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t803)))
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 72 bytes per marking, with 18 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 Echo-PT-d02r11-ReachabilityFireability-10.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 662 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t95) AND ((FIREABLE(t638) AND FIREABLE(t464)) OR (FIREABLE(t1) AND FIREABLE(t241))) AND FIREABLE(t219))))
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 72 bytes per marking, with 18 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 38 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-11.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 12 will run for 827 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t678)))
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 72 bytes per marking, with 18 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 Echo-PT-d02r11-ReachabilityFireability-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1103 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t575) OR FIREABLE(t148) OR FIREABLE(t665) OR ((FIREABLE(t858) OR FIREABLE(t466)) AND NOT FIREABLE(t267)) OR (FIREABLE(t81) AND ((FIREABLE(t462) AND FIREABLE(t593)) OR (FIREABLE(t283) AND FIREABLE(t441)))))))
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 72 bytes per marking, with 18 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 41 literals and 9 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1655 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((FIREABLE(t858) AND FIREABLE(t438)) OR NOT FIREABLE(t340) OR (FIREABLE(t534) AND FIREABLE(t284) AND (FIREABLE(t579) OR FIREABLE(t385)))) AND NOT FIREABLE(t95))))
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 72 bytes per marking, with 18 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 282 literals and 61 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3310 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t519) OR FIREABLE(t213) OR NOT FIREABLE(t235)) AND FIREABLE(t103) AND FIREABLE(t21))))
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 72 bytes per marking, with 18 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 23 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Echo-PT-d02r11-ReachabilityFireability-15.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: unknown no no yes yes yes yes yes yes yes yes yes yes yes no yes
lola: ========================================
FORMULA Echo-PT-d02r11-ReachabilityFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Echo-PT-d02r11-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494686094833

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