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 CloudReconfiguration-PT-304, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961200034
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496529532797


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


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-304: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ CloudReconfiguration-PT-304 @ 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: 5678/65536 symbol table entries, 638 collisions
lola: preprocessing...
lola: finding significant places
lola: 2584 places, 3094 transitions, 2580 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2707 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-304-ReachabilityCardinality.task
lola: A (G (((p1400 <= p1819) AND ((p196 <= 1) OR (p1904 + 1 <= p139))))) : E (F (((2 <= p2247) OR (3 <= p104)))) : A (G (((p1224 <= p1220) OR (3 <= p1594)))) : E (F (((2 <= p2486) OR ((2 <= p2579) AND (p278 <= p2498) AND ((p2487 <= p1925) OR (3 <= p1236)))))) : A (G ((((p583 <= p704) OR (p689 <= p410) OR (p1841 + 1 <= p2320)) AND ((p138 <= p716) OR (p601 <= p682) OR (p1257 <= p1235) OR (2 <= p2006))))) : E (F (((1 <= p1133) OR (2 <= p46)))) : E (F ((3 <= p274))) : A (G (((p2321 <= 0) AND ((p1989 <= p411) OR (1 <= p2140)) AND ((3 <= p1823) OR (p20 <= p553) OR ((p246 <= p54) AND (p87 <= p2387)))))) : E (F (((p1079 + 1 <= p1817) AND (p2549 + 1 <= p1610) AND (p1062 <= p1386)))) : E (F ((((p60 + 1 <= p455) OR (p2545 + 1 <= p1565)) AND ((p2182 <= p276) OR (3 <= p1281) OR ((3 <= p975) AND (3 <= p2249)))))) : E (F ((((1 <= p2022) OR (p153 <= p1332) OR (p1766 <= 2)) AND ((p326 + 1 <= p244) OR (p614 + 1 <= p328))))) : E (F (((p255 + 1 <= p1490) OR ((p1911 <= p1879) AND (p1727 <= p2117) AND ((3 <= p1196) OR (2 <= p1643)))))) : A (G (((p162 <= 1) AND (p168 <= 2) AND (p1113 <= p434)))) : E (F (((p178 <= p796) AND (3 <= p755)))) : A (G (((p452 <= 2) OR (p1157 <= 0) OR (p675 <= p2131)))) : A (G ((((p1680 <= 1) AND (p1213 <= 0)) OR (p2311 + 1 <= p612))))
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 (((p1400 <= p1819) AND ((p196 <= 1) OR (p1904 + 1 <= p139)))))
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 324 bytes per marking, with 12 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality.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: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p2247) OR (3 <= p104))))
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 324 bytes per marking, with 12 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1224 <= p1220) OR (3 <= p1594))))
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 324 bytes per marking, with 12 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 CloudReconfiguration-PT-304-ReachabilityCardinality-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: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p2486) OR ((2 <= p2579) AND (p278 <= p2498) AND ((p2487 <= p1925) OR (3 <= p1236))))))
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 324 bytes per marking, with 12 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 104232 markings, 131011 edges, 20846 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p583 <= p704) OR (p689 <= p410) OR (p1841 + 1 <= p2320)) AND ((p138 <= p716) OR (p601 <= p682) OR (p1257 <= p1235) OR (2 <= p2006)))))
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 324 bytes per marking, with 12 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 7 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 108928 markings, 129929 edges, 21786 markings/sec, 0 secs
lola: sara is running 5 secs || 219732 markings, 263811 edges, 22161 markings/sec, 5 secs
lola: sara is running 10 secs || 339575 markings, 413308 edges, 23969 markings/sec, 10 secs
lola: sara is running 15 secs || 438101 markings, 532189 edges, 19705 markings/sec, 15 secs
lola: sara is running 20 secs || 542728 markings, 662379 edges, 20925 markings/sec, 20 secs
lola: sara is running 25 secs || 653466 markings, 800630 edges, 22148 markings/sec, 25 secs
lola: sara is running 30 secs || 739660 markings, 905190 edges, 17239 markings/sec, 30 secs
lola: sara is running 35 secs || 849772 markings, 1043119 edges, 22022 markings/sec, 35 secs
lola: sara is running 40 secs || 964070 markings, 1188914 edges, 22860 markings/sec, 40 secs
lola: sara is running 45 secs || 1069388 markings, 1320897 edges, 21064 markings/sec, 45 secs
lola: sara is running 50 secs || 1157889 markings, 1429186 edges, 17700 markings/sec, 50 secs
lola: sara is running 55 secs || 1256319 markings, 1550058 edges, 19686 markings/sec, 55 secs
lola: sara is running 60 secs || 1358521 markings, 1675565 edges, 20440 markings/sec, 60 secs
lola: sara is running 65 secs || 1481361 markings, 1831870 edges, 24568 markings/sec, 65 secs
lola: sara is running 70 secs || 1597256 markings, 1978030 edges, 23179 markings/sec, 70 secs
lola: sara is running 75 secs || 1704931 markings, 2116717 edges, 21535 markings/sec, 75 secs
lola: sara is running 80 secs || 1801885 markings, 2235380 edges, 19391 markings/sec, 80 secs
lola: sara is running 85 secs || 1905730 markings, 2368200 edges, 20769 markings/sec, 85 secs
lola: sara is running 90 secs || 2014434 markings, 2508867 edges, 21741 markings/sec, 90 secs
lola: sara is running 95 secs || 2120908 markings, 2642629 edges, 21295 markings/sec, 95 secs
lola: sara is running 100 secs || 2222393 markings, 2771899 edges, 20297 markings/sec, 100 secs
lola: sara is running 105 secs || 2308557 markings, 2878719 edges, 17233 markings/sec, 105 secs
lola: sara is running 110 secs || 2405278 markings, 2996119 edges, 19344 markings/sec, 110 secs
lola: sara is running 115 secs || 2520830 markings, 3138330 edges, 23110 markings/sec, 115 secs
lola: sara is running 120 secs || 2655828 markings, 3311365 edges, 27000 markings/sec, 120 secs
lola: sara is running 125 secs || 2785941 markings, 3474969 edges, 26023 markings/sec, 125 secs
lola: sara is running 130 secs || 2907590 markings, 3627603 edges, 24330 markings/sec, 130 secs
lola: sara is running 135 secs || 3004424 markings, 3746672 edges, 19367 markings/sec, 135 secs
lola: sara is running 140 secs || 3102604 markings, 3866613 edges, 19636 markings/sec, 140 secs
lola: sara is running 145 secs || 3203450 markings, 3992082 edges, 20169 markings/sec, 145 secs
lola: sara is running 150 secs || 3320570 markings, 4145012 edges, 23424 markings/sec, 150 secs
lola: sara is running 155 secs || 3445992 markings, 4302479 edges, 25084 markings/sec, 155 secs
lola: sara is running 160 secs || 3566042 markings, 4452047 edges, 24010 markings/sec, 160 secs
lola: sara is running 165 secs || 3674304 markings, 4590304 edges, 21652 markings/sec, 165 secs
lola: sara is running 170 secs || 3777650 markings, 4719458 edges, 20669 markings/sec, 170 secs
lola: sara is running 175 secs || 3890211 markings, 4859076 edges, 22512 markings/sec, 175 secs
lola: sara is running 180 secs || 3964110 markings, 4952469 edges, 14780 markings/sec, 180 secs
lola: sara is running 185 secs || 4075025 markings, 5089599 edges, 22183 markings/sec, 185 secs
lola: sara is running 190 secs || 4144795 markings, 5175070 edges, 13954 markings/sec, 190 secs
lola: sara is running 195 secs || 4264919 markings, 5325504 edges, 24025 markings/sec, 195 secs
lola: sara is running 200 secs || 4353696 markings, 5435336 edges, 17755 markings/sec, 200 secs
lola: sara is running 205 secs || 4484017 markings, 5601995 edges, 26064 markings/sec, 205 secs
lola: sara is running 210 secs || 4590668 markings, 5735125 edges, 21330 markings/sec, 210 secs
lola: sara is running 215 secs || 4688592 markings, 5858394 edges, 19585 markings/sec, 215 secs
lola: sara is running 220 secs || 4761208 markings, 5950849 edges, 14523 markings/sec, 220 secs
lola: sara is running 225 secs || 4865280 markings, 6078924 edges, 20814 markings/sec, 225 secs
lola: sara is running 230 secs || 4951283 markings, 6191489 edges, 17201 markings/sec, 230 secs
lola: sara is running 235 secs || 5068915 markings, 6339755 edges, 23526 markings/sec, 235 secs
lola: sara is running 240 secs || 5142838 markings, 6430298 edges, 14785 markings/sec, 240 secs
lola: sara is running 245 secs || 5248331 markings, 6560028 edges, 21099 markings/sec, 245 secs
lola: sara is running 250 secs || 5353692 markings, 6689700 edges, 21072 markings/sec, 250 secs
lola: sara is running 255 secs || 5454981 markings, 6817750 edges, 20258 markings/sec, 255 secs
lola: sara is running 260 secs || 5537171 markings, 6922709 edges, 16438 markings/sec, 260 secs
lola: sara is running 265 secs || 5639891 markings, 7049002 edges, 20544 markings/sec, 265 secs
lola: sara is running 270 secs || 5754139 markings, 7194977 edges, 22850 markings/sec, 270 secs
lola: sara is running 275 secs || 5860445 markings, 7329410 edges, 21261 markings/sec, 275 secs
lola: sara is running 280 secs || 5951245 markings, 7444298 edges, 18160 markings/sec, 280 secs
lola: sara is running 285 secs || 6047112 markings, 7565371 edges, 19173 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1133) OR (2 <= p46))))
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 324 bytes per marking, with 12 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 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality-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 323 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p274)))
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 324 bytes per marking, with 12 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 CloudReconfiguration-PT-304-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-6.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 7 will run for 358 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2321 <= 0) AND ((p1989 <= p411) OR (1 <= p2140)) AND ((3 <= p1823) OR (p20 <= p553) OR ((p246 <= p54) AND (p87 <= p2387))))))
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 324 bytes per marking, with 12 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 9 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 403 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1079 + 1 <= p1817) AND (p2549 + 1 <= p1610) AND (p1062 <= p1386))))
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 324 bytes per marking, with 12 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 CloudReconfiguration-PT-304-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-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 461 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p60 + 1 <= p455) OR (p2545 + 1 <= p1565)) AND ((p2182 <= p276) OR (3 <= p1281) OR ((3 <= p975) AND (3 <= p2249))))))
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 324 bytes per marking, with 12 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 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p2022) OR (p153 <= p1332) OR (p1766 <= 2)) AND ((p326 + 1 <= p244) OR (p614 + 1 <= p328)))))
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 324 bytes per marking, with 12 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 12 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 11 will run for 645 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p255 + 1 <= p1490) OR ((p1911 <= p1879) AND (p1727 <= p2117) AND ((3 <= p1196) OR (2 <= p1643))))))
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 324 bytes per marking, with 12 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 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 806 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p162 <= 1) AND (p168 <= 2) AND (p1113 <= p434))))
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 324 bytes per marking, with 12 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-304-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1075 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p178 <= p796) AND (3 <= p755))))
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 324 bytes per marking, with 12 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 CloudReconfiguration-PT-304-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-13.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 14 will run for 1611 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p452 <= 2) OR (p1157 <= 0) OR (p675 <= p2131))))
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 324 bytes per marking, with 12 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 CloudReconfiguration-PT-304-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-14.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 15 will run for 3219 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p1680 <= 1) AND (p1213 <= 0)) OR (p2311 + 1 <= p612))))
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 324 bytes per marking, with 12 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 CloudReconfiguration-PT-304-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-304-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no unknown yes no no no yes yes yes no no yes no
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-304-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496529853728

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