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-3253
Executing tool lola
Input is CloudDeployment-PT-2b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436308700018
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494613718322


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ CloudDeployment-PT-2b @ 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: 1240/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 556 places, 684 transitions, 547 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 665 transition conflict sets
lola: TASK
lola: reading formula from CloudDeployment-PT-2b-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t329) OR NOT FIREABLE(t325) OR NOT FIREABLE(t476) OR (NOT FIREABLE(t194) AND NOT FIREABLE(t393)) OR NOT FIREABLE(t78)))) : E (F ((FIREABLE(t160) AND NOT FIREABLE(t324)))) : E (F ((FIREABLE(t154) OR (NOT FIREABLE(t389) AND FIREABLE(t396) AND FIREABLE(t374))))) : A (G (((FIREABLE(t602) AND FIREABLE(t390)) OR FIREABLE(t83) OR NOT FIREABLE(t544) OR NOT FIREABLE(t559) OR ((FIREABLE(t75) OR FIREABLE(t205)) AND NOT FIREABLE(t126)) OR NOT FIREABLE(t442)))) : E (F (((FIREABLE(t223) AND NOT FIREABLE(t345) AND FIREABLE(t350) AND FIREABLE(t499) AND (FIREABLE(t628) OR FIREABLE(t285))) OR ((FIREABLE(t317) OR FIREABLE(t565)) AND (FIREABLE(t198) OR FIREABLE(t283)) AND (NOT FIREABLE(t524) OR FIREABLE(t641)))))) : E (F ((FIREABLE(t333) OR (FIREABLE(t131) AND FIREABLE(t597) AND FIREABLE(t282)) OR (FIREABLE(t478) AND (FIREABLE(t36) OR FIREABLE(t438) OR NOT FIREABLE(t323)))))) : A (G ((FIREABLE(t42) OR (NOT FIREABLE(t547) AND NOT FIREABLE(t387) AND NOT FIREABLE(t236) AND NOT FIREABLE(t292))))) : E (F ((FIREABLE(t344) AND FIREABLE(t313) AND (FIREABLE(t183) OR FIREABLE(t291))))) : E (F (FIREABLE(t576))) : E (F ((NOT FIREABLE(t90) AND NOT FIREABLE(t434) AND FIREABLE(t674) AND (NOT FIREABLE(t8) OR (FIREABLE(t613) AND FIREABLE(t347)) OR FIREABLE(t12) OR FIREABLE(t564) OR NOT FIREABLE(t622))))) : A (G ((FIREABLE(t519) OR NOT FIREABLE(t324)))) : E (F (FIREABLE(t116))) : E (F (FIREABLE(t258))) : A (G ((NOT FIREABLE(t68) AND NOT FIREABLE(t491) AND NOT FIREABLE(t183) AND (NOT FIREABLE(t300) OR NOT FIREABLE(t393) OR FIREABLE(t144))))) : E (F ((FIREABLE(t258) OR (FIREABLE(t411) AND (NOT FIREABLE(t11) OR FIREABLE(t523)))))) : A (G ((NOT FIREABLE(t473) OR ((NOT FIREABLE(t569) OR NOT FIREABLE(t291)) AND (FIREABLE(t288) OR FIREABLE(t536) OR FIREABLE(t677))))))
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(t329) OR NOT FIREABLE(t325) OR NOT FIREABLE(t476) OR (NOT FIREABLE(t194) AND NOT FIREABLE(t393)) OR NOT FIREABLE(t78))))
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 29 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t160) AND NOT FIREABLE(t324))))
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 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t154) OR (NOT FIREABLE(t389) AND FIREABLE(t396) AND FIREABLE(t374)))))
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 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-2.sara
lola: state equation: calling and running saralola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t602) AND FIREABLE(t390)) OR FIREABLE(t83) OR NOT FIREABLE(t544) OR NOT FIREABLE(t559) OR ((FIREABLE(t75) OR FIREABLE(t205)) AND NOT FIREABLE(t126)) OR NOT FIREABLE(t442))))
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 29 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 78 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 300873 markings, 635971 edges, 60175 markings/sec, 0 secs
lola: sara is running 5 secs || 556855 markings, 1283786 edges, 51196 markings/sec, 5 secs
lola: sara is running 10 secs || 859904 markings, 1950015 edges, 60610 markings/sec, 10 secs
lola: sara is running 15 secs || 1111787 markings, 2578054 edges, 50377 markings/sec, 15 secs
lola: sara is running 20 secs || 1396173 markings, 3250163 edges, 56877 markings/sec, 20 secs
lola: sara is running 25 secs || 1679067 markings, 3955911 edges, 56579 markings/sec, 25 secs
lola: sara is running 30 secs || 1952955 markings, 4631457 edges, 54778 markings/sec, 30 secs
lola: sara is running 35 secs || 2254125 markings, 5312499 edges, 60234 markings/sec, 35 secs
lola: sara is running 40 secs || 2580809 markings, 5830253 edges, 65337 markings/sec, 40 secs
lola: sara is running 45 secs || 2859559 markings, 6307178 edges, 55750 markings/sec, 45 secs
lola: sara is running 50 secs || 3113056 markings, 6730261 edges, 50699 markings/sec, 50 secs
lola: sara is running 55 secs || 3361948 markings, 7231983 edges, 49778 markings/sec, 55 secs
lola: sara is running 60 secs || 3616338 markings, 7785463 edges, 50878 markings/sec, 60 secs
lola: sara is running 65 secs || 3917106 markings, 8434856 edges, 60154 markings/sec, 65 secs
lola: sara is running 70 secs || 4205231 markings, 9125293 edges, 57625 markings/sec, 70 secs
lola: sara is running 75 secs || 4533466 markings, 9815999 edges, 65647 markings/sec, 75 secs
lola: sara is running 80 secs || 4881551 markings, 10489504 edges, 69617 markings/sec, 80 secs
lola: sara is running 85 secs || 5152730 markings, 11137306 edges, 54236 markings/sec, 85 secs
lola: sara is running 90 secs || 5447131 markings, 11797477 edges, 58880 markings/sec, 90 secs
lola: sara is running 95 secs || 5734234 markings, 12432083 edges, 57421 markings/sec, 95 secs
lola: sara is running 100 secs || 5976001 markings, 13061204 edges, 48353 markings/sec, 100 secs
lola: sara is running 105 secs || 6240162 markings, 13699395 edges, 52832 markings/sec, 105 secs
lola: sara is running 110 secs || 6499779 markings, 14300028 edges, 51923 markings/sec, 110 secs
lola: sara is running 115 secs || 6696300 markings, 14897478 edges, 39304 markings/sec, 115 secs
lola: sara is running 120 secs || 6910923 markings, 15484316 edges, 42925 markings/sec, 120 secs
lola: sara is running 125 secs || 7203098 markings, 16143734 edges, 58435 markings/sec, 125 secs
lola: sara is running 130 secs || 7488827 markings, 16791448 edges, 57146 markings/sec, 130 secs
lola: sara is running 135 secs || 7783798 markings, 17492562 edges, 58994 markings/sec, 135 secs
lola: sara is running 140 secs || 8049231 markings, 18168846 edges, 53087 markings/sec, 140 secs
lola: sara is running 145 secs || 8311687 markings, 18869952 edges, 52491 markings/sec, 145 secs
lola: sara is running 150 secs || 8553966 markings, 19539686 edges, 48456 markings/sec, 150 secs
lola: sara is running 155 secs || 8773216 markings, 20181501 edges, 43850 markings/sec, 155 secs
lola: sara is running 160 secs || 8977354 markings, 20907588 edges, 40828 markings/sec, 160 secs
lola: sara is running 165 secs || 9183063 markings, 21634064 edges, 41142 markings/sec, 165 secs
lola: sara is running 170 secs || 9377951 markings, 22380765 edges, 38978 markings/sec, 170 secs
lola: sara is running 175 secs || 9571226 markings, 23094647 edges, 38655 markings/sec, 175 secs
lola: sara is running 180 secs || 9808635 markings, 23795656 edges, 47482 markings/sec, 180 secs
lola: sara is running 185 secs || 10048840 markings, 24451373 edges, 48041 markings/sec, 185 secs
lola: sara is running 190 secs || 10342795 markings, 25024201 edges, 58791 markings/sec, 190 secs
lola: sara is running 195 secs || 10625000 markings, 25507501 edges, 56441 markings/sec, 195 secs
lola: sara is running 200 secs || 10888833 markings, 25951324 edges, 52767 markings/sec, 200 secs
lola: sara is running 205 secs || 11122762 markings, 26382387 edges, 46786 markings/sec, 205 secs
lola: sara is running 210 secs || 11363210 markings, 26840175 edges, 48090 markings/sec, 210 secs
lola: sara is running 215 secs || 11598580 markings, 27364120 edges, 47074 markings/sec, 215 secs
lola: sara is running 220 secs || 11858977 markings, 27933044 edges, 52079 markings/sec, 220 secs
lola: sara is running 225 secs || 12143265 markings, 28573842 edges, 56858 markings/sec, 225 secs
lola: sara is running 230 secs || 12394381 markings, 29252323 edges, 50223 markings/sec, 230 secs
lola: sara is running 235 secs || 12662712 markings, 29922774 edges, 53666 markings/sec, 235 secs
lola: sara is running 240 secs || 12939846 markings, 30512619 edges, 55427 markings/sec, 240 secs
lola: sara is running 245 secs || 13233585 markings, 31085527 edges, 58748 markings/sec, 245 secs
lola: sara is running 250 secs || 13467056 markings, 31659985 edges, 46694 markings/sec, 250 secs
lola: sara is running 255 secs || 13749473 markings, 32288870 edges, 56483 markings/sec, 255 secs
lola: sara is running 260 secs || 14017340 markings, 32855326 edges, 53573 markings/sec, 260 secs
lola: sara is running 265 secs || 14249999 markings, 33446581 edges, 46532 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 (((FIREABLE(t223) AND NOT FIREABLE(t345) AND FIREABLE(t350) AND FIREABLE(t499) AND (FIREABLE(t628) OR FIREABLE(t285))) OR ((FIREABLE(t317) OR FIREABLE(t565)) AND (FIREABLE(t198) OR FIREABLE(t283)) AND (NOT FIREABLE(t524) OR FIREABLE(t641))))))
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 29 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 42 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 190953 markings, 337648 edges, 38191 markings/sec, 0 secs
lola: sara is running 5 secs || 376009 markings, 734409 edges, 37011 markings/sec, 5 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t333) OR (FIREABLE(t131) AND FIREABLE(t597) AND FIREABLE(t282)) OR (FIREABLE(t478) AND (FIREABLE(t36) OR FIREABLE(t438) OR NOT FIREABLE(t323))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: 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 29 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 5 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-5.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 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t42) OR (NOT FIREABLE(t547) AND NOT FIREABLE(t387) AND NOT FIREABLE(t236) AND NOT FIREABLE(t292)))))
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 29 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 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-6.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t344) AND FIREABLE(t313) AND (FIREABLE(t183) OR FIREABLE(t291)))))
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 29 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 8 will run for 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t576)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)lola:
========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 72 bytes per marking, with 29 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 8 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: subprocess 9 will run for 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t90) AND NOT FIREABLE(t434) AND FIREABLE(t674) AND (NOT FIREABLE(t8) OR (FIREABLE(t613) AND FIREABLE(t347)) OR FIREABLE(t12) OR FIREABLE(t564) OR NOT FIREABLE(t622)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: 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 29 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 45 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-9.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 10 will run for 542 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t519) OR NOT FIREABLE(t324))))
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 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 650 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t116)))
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 29 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 CloudDeployment-PT-2b-ReachabilityFireability-11.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 812 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t258)))
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 29 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 CloudDeployment-PT-2b-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 1083 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t68) AND NOT FIREABLE(t491) AND NOT FIREABLE(t183) AND (NOT FIREABLE(t300) OR NOT FIREABLE(t393) OR FIREABLE(t144)))))
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 29 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 6 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-13.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1625 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t258) OR (FIREABLE(t411) AND (NOT FIREABLE(t11) OR FIREABLE(t523))))))
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 29 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 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-14.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t473) OR ((NOT FIREABLE(t569) OR NOT FIREABLE(t291)) AND (FIREABLE(t288) OR FIREABLE(t536) OR FIREABLE(t677))))))
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 29 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 18 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudDeployment-PT-2b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic

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

BK_STOP 1494614008276

--------------------
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="CloudDeployment-PT-2b"
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/CloudDeployment-PT-2b.tgz
mv CloudDeployment-PT-2b execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is CloudDeployment-PT-2b, 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 r018-ebro-149436308700018"
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 ;