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 DES-PT-50b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309200331
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494632803076


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ DES-PT-50b @ 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: 909/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 479 places, 430 transitions, 414 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 527 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50b-ReachabilityCardinality.task
lola: E (F ((3 <= p209))) : E (F (((1 <= p182) AND (p101 <= 1) AND (p459 <= p440)))) : E (F ((2 <= p203))) : A (G ((p105 <= 2))) : A (G (((p260 + 1 <= p310) OR (p260 <= 2) OR (p256 <= p198)))) : E (F ((3 <= p18))) : A (G (((p217 <= p404) OR (p468 <= 1)))) : E (F (((p357 <= p251) AND (3 <= p130)))) : A (G (((3 <= p90) OR (p314 <= p105)))) : A (G (((p219 <= p307) OR (p76 <= p204) OR (p328 <= 0)))) : E (F ((((p173 <= p19) AND (p21 <= p314) AND (p467 + 1 <= p16)) OR (1 <= p136)))) : A (G (((p45 + 1 <= p167) OR (p392 + 1 <= p246) OR (p242 <= p410)))) : E (F (((2 <= p344) AND (p321 <= p290)))) : A (G (((p179 <= p132) OR (1 <= p460) OR ((p395 <= 0) AND (p471 <= p271))))) : E (F (((2 <= p373) AND (p146 <= p432) AND (p15 <= 2) AND ((p392 + 1 <= p184) OR (p41 <= 1))))) : A (G ((((p66 <= 1) AND (p229 + 1 <= p180)) OR ((p218 <= 1) AND (p253 <= 1)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p209)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: lola: state equation: calling and running saraThe predicate is unreachable.

lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p182) AND (p101 <= 1) AND (p459 <= p440))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality.sara.
sara: try reading problem file DES-PT-50b-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 741545 markings, 1031555 edges, 148309 markings/sec, 0 secs
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 ((2 <= p203)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-2.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 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p105 <= 2)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-3.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 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p260 + 1 <= p310) OR (p260 <= 2) OR (p256 <= p198))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-4.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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p18)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-5.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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p217 <= p404) OR (p468 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-6.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 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p357 <= p251) AND (3 <= p130))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-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: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= p90) OR (p314 <= p105))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-8.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p219 <= p307) OR (p76 <= p204) OR (p328 <= 0))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-9.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 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p173 <= p19) AND (p21 <= p314) AND (p467 + 1 <= p16)) OR (1 <= p136))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 394984 markings, 1024009 edges, 78997 markings/sec, 0 secs
lola: sara is running 5 secs || 858989 markings, 2008463 edges, 92801 markings/sec, 5 secs
lola: sara is running 10 secs || 1325898 markings, 3001902 edges, 93382 markings/sec, 10 secs
lola: sara is running 15 secs || 1789635 markings, 4002660 edges, 92747 markings/sec, 15 secs
lola: sara is running 20 secs || 2256651 markings, 4998886 edges, 93403 markings/sec, 20 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 700 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p45 + 1 <= p167) OR (p392 + 1 <= p246) OR (p242 <= p410))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 875 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p344) AND (p321 <= p290))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-12.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 13 will run for 1167 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p179 <= p132) OR (1 <= p460) OR ((p395 <= 0) AND (p471 <= p271)))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 506147 markings, 1186598 edges, 101229 markings/sec, 0 secs
lola: sara is running 5 secs || 1000687 markings, 2361971 edges, 98908 markings/sec, 5 secs
lola: sara is running 10 secs || 1511122 markings, 3546735 edges, 102087 markings/sec, 10 secs
lola: sara is running 15 secs || 2019000 markings, 4703028 edges, 101576 markings/sec, 15 secs
lola: sara is running 20 secs || 2531403 markings, 5879488 edges, 102481 markings/sec, 20 secs
lola: sara is running 25 secs || 3040498 markings, 7046238 edges, 101819 markings/sec, 25 secs
lola: sara is running 30 secs || 3540375 markings, 8218202 edges, 99975 markings/sec, 30 secs
lola: sara is running 35 secs || 4077869 markings, 9401909 edges, 107499 markings/sec, 35 secs
lola: sara is running 40 secs || 4573510 markings, 10519696 edges, 99128 markings/sec, 40 secs
lola: sara is running 45 secs || 5085091 markings, 11639342 edges, 102316 markings/sec, 45 secs
lola: sara is running 50 secs || 5618192 markings, 12793131 edges, 106620 markings/sec, 50 secs
lola: sara is running 55 secs || 6155378 markings, 13907211 edges, 107437 markings/sec, 55 secs
lola: sara is running 60 secs || 6634562 markings, 15060377 edges, 95837 markings/sec, 60 secs
lola: sara is running 65 secs || 7170437 markings, 16211905 edges, 107175 markings/sec, 65 secs
lola: sara is running 70 secs || 7690217 markings, 17327901 edges, 103956 markings/sec, 70 secs
lola: sara is running 75 secs || 8192118 markings, 18509869 edges, 100380 markings/sec, 75 secs
lola: sara is running 80 secs || 8718587 markings, 19644570 edges, 105294 markings/sec, 80 secs
lola: sara is running 85 secs || 9221869 markings, 20786412 edges, 100656 markings/sec, 85 secs
lola: sara is running 90 secs || 9735982 markings, 21944308 edges, 102823 markings/sec, 90 secs
lola: sara is running 95 secs || 10271755 markings, 23067536 edges, 107155 markings/sec, 95 secs
lola: sara is running 100 secs || 10748439 markings, 24212197 edges, 95337 markings/sec, 100 secs
lola: sara is running 105 secs || 11285392 markings, 25367863 edges, 107391 markings/sec, 105 secs
lola: sara is running 110 secs || 11808653 markings, 26473482 edges, 104652 markings/sec, 110 secs
lola: sara is running 115 secs || 12303183 markings, 27645679 edges, 98906 markings/sec, 115 secs
lola: sara is running 120 secs || 12833583 markings, 28756872 edges, 106080 markings/sec, 120 secs
lola: sara is running 125 secs || 13331893 markings, 29904073 edges, 99662 markings/sec, 125 secs
lola: sara is running 130 secs || 13837945 markings, 31040563 edges, 101210 markings/sec, 130 secs
lola: sara is running 135 secs || 14365977 markings, 32179194 edges, 105606 markings/sec, 135 secs
lola: sara is running 140 secs || 14846157 markings, 33323939 edges, 96036 markings/sec, 140 secs
lola: sara is running 145 secs || 15373738 markings, 34463269 edges, 105516 markings/sec, 145 secs
lola: sara is running 150 secs || 15897899 markings, 35570034 edges, 104832 markings/sec, 150 secs
lola: sara is running 155 secs || 16386761 markings, 36733237 edges, 97772 markings/sec, 155 secs
lola: sara is running 160 secs || 16916419 markings, 37869058 edges, 105932 markings/sec, 160 secs
lola: sara is running 165 secs || 17426713 markings, 38982460 edges, 102059 markings/sec, 165 secs
lola: sara is running 170 secs || 17929622 markings, 40134961 edges, 100582 markings/sec, 170 secs
lola: sara is running 175 secs || 18451819 markings, 41274038 edges, 104439 markings/sec, 175 secs
lola: sara is running 180 secs || 18941369 markings, 42410035 edges, 97910 markings/sec, 180 secs
lola: sara is running 185 secs || 19455472 markings, 43545751 edges, 102821 markings/sec, 185 secs
lola: sara is running 190 secs || 19979550 markings, 44642129 edges, 104816 markings/sec, 190 secs
lola: sara is running 195 secs || 20445973 markings, 45762269 edges, 93285 markings/sec, 195 secs
lola: sara is running 200 secs || 20985655 markings, 46901772 edges, 107936 markings/sec, 200 secs
lola: sara is running 205 secs || 21501857 markings, 48015855 edges, 103240 markings/sec, 205 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1644 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p373) AND (p146 <= p432) AND (p15 <= 2) AND ((p392 + 1 <= p184) OR (p41 <= 1)))))
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 52 bytes per marking, with 2 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3289 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p66 <= 1) AND (p229 + 1 <= p180)) OR ((p218 <= 1) AND (p253 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityCardinality-15.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: RESULT
lola:
SUMMARY: no yes no yes yes no yes no no no yes no no no no yes
FORMULA DES-PT-50b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494633054756

--------------------
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="DES-PT-50b"
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/DES-PT-50b.tgz
mv DES-PT-50b 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 DES-PT-50b, 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 r018-ebro-149436309200331"
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 ;