fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r098-ebro-149488455400018
Last Updated
June 27, 2017

About the Execution of LoLA for S_CloudDeployment-PT-2b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1831.200 290186.00 582049.00 72.60 TTFTTFTFT?TTFFFT normal

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 S_CloudDeployment-PT-2b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455400018
=====================================================================


--------------------
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 1496437910725


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


checking for too many tokens
===========================================================================================
S_CloudDeployment-PT-2b: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_CloudDeployment-PT-2b @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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 sara
lola: 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 || 299617 markings, 632655 edges, 59923 markings/sec, 0 secs
lola: sara is running 5 secs || 553317 markings, 1277811 edges, 50740 markings/sec, 5 secs
lola: sara is running 10 secs || 856567 markings, 1942419 edges, 60650 markings/sec, 10 secs
lola: sara is running 15 secs || 1108686 markings, 2570093 edges, 50424 markings/sec, 15 secs
lola: sara is running 20 secs || 1390418 markings, 3240543 edges, 56346 markings/sec, 20 secs
lola: sara is running 25 secs || 1674504 markings, 3937622 edges, 56817 markings/sec, 25 secs
lola: sara is running 30 secs || 1948456 markings, 4621404 edges, 54790 markings/sec, 30 secs
lola: sara is running 35 secs || 2248138 markings, 5301698 edges, 59936 markings/sec, 35 secs
lola: sara is running 40 secs || 2576540 markings, 5822558 edges, 65680 markings/sec, 40 secs
lola: sara is running 45 secs || 2857964 markings, 6299474 edges, 56285 markings/sec, 45 secs
lola: sara is running 50 secs || 3109551 markings, 6722448 edges, 50317 markings/sec, 50 secs
lola: sara is running 55 secs || 3358131 markings, 7225396 edges, 49716 markings/sec, 55 secs
lola: sara is running 60 secs || 3612723 markings, 7778192 edges, 50918 markings/sec, 60 secs
lola: sara is running 65 secs || 3913390 markings, 8428073 edges, 60133 markings/sec, 65 secs
lola: sara is running 70 secs || 4202093 markings, 9119293 edges, 57741 markings/sec, 70 secs
lola: sara is running 75 secs || 4531271 markings, 9810343 edges, 65836 markings/sec, 75 secs
lola: sara is running 80 secs || 4877348 markings, 10481020 edges, 69215 markings/sec, 80 secs
lola: sara is running 85 secs || 5143676 markings, 11121351 edges, 53266 markings/sec, 85 secs
lola: sara is running 90 secs || 5437154 markings, 11779511 edges, 58696 markings/sec, 90 secs
lola: sara is running 95 secs || 5720128 markings, 12406492 edges, 56595 markings/sec, 95 secs
lola: sara is running 100 secs || 5961632 markings, 13027855 edges, 48301 markings/sec, 100 secs
lola: sara is running 105 secs || 6226279 markings, 13666203 edges, 52929 markings/sec, 105 secs
lola: sara is running 110 secs || 6485366 markings, 14257096 edges, 51817 markings/sec, 110 secs
lola: sara is running 115 secs || 6682289 markings, 14853526 edges, 39385 markings/sec, 115 secs
lola: sara is running 120 secs || 6887520 markings, 15426324 edges, 41046 markings/sec, 120 secs
lola: sara is running 125 secs || 7160036 markings, 16053675 edges, 54503 markings/sec, 125 secs
lola: sara is running 130 secs || 7450873 markings, 16682502 edges, 58167 markings/sec, 130 secs
lola: sara is running 135 secs || 7736339 markings, 17382320 edges, 57093 markings/sec, 135 secs
lola: sara is running 140 secs || 8006015 markings, 18046892 edges, 53935 markings/sec, 140 secs
lola: sara is running 145 secs || 8257123 markings, 18737463 edges, 50222 markings/sec, 145 secs
lola: sara is running 150 secs || 8506433 markings, 19375690 edges, 49862 markings/sec, 150 secs
lola: sara is running 155 secs || 8731399 markings, 20027315 edges, 44993 markings/sec, 155 secs
lola: sara is running 160 secs || 8920541 markings, 20691180 edges, 37828 markings/sec, 160 secs
lola: sara is running 165 secs || 9110207 markings, 21390530 edges, 37933 markings/sec, 165 secs
lola: sara is running 170 secs || 9307153 markings, 22128268 edges, 39389 markings/sec, 170 secs
lola: sara is running 175 secs || 9487321 markings, 22773815 edges, 36034 markings/sec, 175 secs
lola: sara is running 180 secs || 9690600 markings, 23445759 edges, 40656 markings/sec, 180 secs
lola: sara is running 185 secs || 9921094 markings, 24129336 edges, 46099 markings/sec, 185 secs
lola: sara is running 190 secs || 10176669 markings, 24757835 edges, 51115 markings/sec, 190 secs
lola: sara is running 195 secs || 10474823 markings, 25246935 edges, 59631 markings/sec, 195 secs
lola: sara is running 200 secs || 10749167 markings, 25715314 edges, 54869 markings/sec, 200 secs
lola: sara is running 205 secs || 10988585 markings, 26161744 edges, 47884 markings/sec, 205 secs
lola: sara is running 210 secs || 11233183 markings, 26583708 edges, 48920 markings/sec, 210 secs
lola: sara is running 215 secs || 11471195 markings, 27080783 edges, 47602 markings/sec, 215 secs
lola: sara is running 220 secs || 11708861 markings, 27622141 edges, 47533 markings/sec, 220 secs
lola: sara is running 225 secs || 11987925 markings, 28229964 edges, 55813 markings/sec, 225 secs
lola: sara is running 230 secs || 12261471 markings, 28860417 edges, 54709 markings/sec, 230 secs
lola: sara is running 235 secs || 12501638 markings, 29547046 edges, 48033 markings/sec, 235 secs
lola: sara is running 240 secs || 12783365 markings, 30184283 edges, 56345 markings/sec, 240 secs
lola: sara is running 245 secs || 13039119 markings, 30712664 edges, 51151 markings/sec, 245 secs
lola: sara is running 250 secs || 13326916 markings, 31292662 edges, 57559 markings/sec, 250 secs
lola: sara is running 255 secs || 13557324 markings, 31855955 edges, 46082 markings/sec, 255 secs
lola: sara is running 260 secs || 13832995 markings, 32461108 edges, 55134 markings/sec, 260 secs
lola: sara is running 265 secs || 14082794 markings, 33009320 edges, 49960 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 || 194138 markings, 344602 edges, 38828 markings/sec, 0 secs
lola: sara is running 5 secs || 378258 markings, 743200 edges, 36824 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: ========================================
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: 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: lola: The predicate is not invariant.
state equation: calling and running sara
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)
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-6.sara.
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
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: ========================================
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: 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: ========================================
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: 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 541 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: state equation: calling and running saralola:
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)
sara: try reading problem file CloudDeployment-PT-2b-ReachabilityFireability-12.sara.
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

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 3250 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 1496438200911

--------------------
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="S_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/S_CloudDeployment-PT-2b.tgz
mv S_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 S_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 r098-ebro-149488455400018"
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 ;