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

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

=== Now, execution of the tool begins

BK_START 1494644524417


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ DLCshifumi-PT-3b @ 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: 16669/65536 symbol table entries, 5526 collisions
lola: preprocessing...
lola: finding significant places
lola: 7058 places, 9611 transitions, 6776 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 12409 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-3b-ReachabilityCardinality.task
lola: E (F ((((3 <= p5475) AND (p3854 <= p2265)) OR ((3 <= p639) AND (p672 <= p2246)) OR (2 <= p5784)))) : E (F ((2 <= p719))) : A (G ((((p4631 + 1 <= p5409) AND (p3516 + 1 <= p4087)) OR (p5485 <= p3179)))) : E (F (((3 <= p2536) OR (1 <= p3254)))) : A (G ((p6809 <= p2889))) : E (F (((2 <= p5011) AND (1 <= p2935) AND (p504 <= 1) AND (p5539 <= p6985)))) : E (F ((((p4706 + 1 <= p4463) AND (2 <= p2369)) OR (2 <= p5887)))) : A (G ((((3 <= p5957) AND (p2906 <= p6451)) OR (p5442 + 1 <= p2004) OR (1 <= p6103) OR (p3593 <= p5496) OR (p1068 + 1 <= p4593)))) : E (F (((p3623 <= 1) AND (p1361 + 1 <= p1633) AND ((p4786 + 1 <= p6759) OR (p2380 + 1 <= p4183))))) : E (F (((p5976 <= 2) AND (3 <= p1658) AND (p5300 <= p3024)))) : A (G ((p1243 <= 0))) : E (F ((((p1289 + 1 <= p6437) AND (p404 <= 2)) OR (p335 + 1 <= p5734)))) : E (F (((3 <= p584) AND (p3059 <= p2560) AND ((3 <= p2933) OR (1 <= p5542)) AND (p4937 + 1 <= p471)))) : A (G (((p2009 <= 2) AND (p4046 <= 1) AND (p3759 <= 0)))) : A (G ((p4715 <= p782))) : E (F ((((p4358 + 1 <= p127) OR (p2341 + 1 <= p3092)) AND ((3 <= p6961) OR (3 <= p3779)))))
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 <= p5475) AND (p3854 <= p2265)) OR ((3 <= p639) AND (p672 <= p2246)) OR (2 <= p5784))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 42560 markings, 50638 edges, 8512 markings/sec, 0 secs
lola: sara is running 5 secs || 87042 markings, 103299 edges, 8896 markings/sec, 5 secs
lola: sara is running 10 secs || 131610 markings, 156365 edges, 8914 markings/sec, 10 secs
lola: sara is running 15 secs || 175731 markings, 208952 edges, 8824 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 218620 markings, 260004 edges, 8578 markings/sec, 20 secs
lola: sara is running 25 secs || 260124 markings, 309670 edges, 8301 markings/sec, 25 secs
lola: sara is running 30 secs || 301434 markings, 358883 edges, 8262 markings/sec, 30 secs
lola: sara is running 35 secs || 342551 markings, 407777 edges, 8223 markings/sec, 35 secs
lola: sara is running 40 secs || 382432 markings, 455296 edges, 7976 markings/sec, 40 secs
lola: sara is running 45 secs || 423012 markings, 503645 edges, 8116 markings/sec, 45 secs

lola: sara is running 50 secs || 463567 markings, 551958 edges, 8111 markings/sec, 50 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p719)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 116108 markings, 130337 edges, 23222 markings/sec, 0 secs
lola: sara is running 5 secs || 232184 markings, 261302 edges, 23215 markings/sec, 5 secs
lola: sara is running 10 secs || 347572 markings, 391228 edges, 23078 markings/sec, 10 secs
lola: sara is running 15 secs || 458720 markings, 516282 edges, 22230 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 564980 markings, 635822 edges, 21252 markings/sec, 20 secs
lola: sara is running 25 secs || 671930 markings, 756061 edges, 21390 markings/sec, 25 secs

lola: sara is running 30 secs || 778311 markings, 875651 edges, 21276 markings/sec, 30 secs
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 245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p4631 + 1 <= p5409) AND (p3516 + 1 <= p4087)) OR (p5485 <= p3179))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 264 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p2536) OR (1 <= p3254))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p6809 <= p2889)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 313 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p5011) AND (1 <= p2935) AND (p504 <= 1) AND (p5539 <= p6985))))
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 848 bytes per marking, with 8 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 61726 markings, 76700 edges, 12345 markings/sec, 0 secs
lola: sara is running 5 secs || 122372 markings, 153481 edges, 12129 markings/sec, 5 secs
lola: sara is running 10 secs || 183478 markings, 231137 edges, 12221 markings/sec, 10 secs
lola: sara is running 15 secs || 244487 markings, 308435 edges, 12202 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 305531 markings, 386000 edges, 12209 markings/sec, 20 secs
lola: sara is running 25 secs || 366499 markings, 463131 edges, 12194 markings/sec, 25 secs

lola: sara is running 30 secs || 427677 markings, 540773 edges, 12236 markings/sec, 30 secs
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 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p4706 + 1 <= p4463) AND (2 <= p2369)) OR (2 <= p5887))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 111123 markings, 153089 edges, 22225 markings/sec, 0 secs
lola: sara is running 5 secs || 222700 markings, 306805 edges, 22315 markings/sec, 5 secs
lola: sara is running 10 secs || 334113 markings, 460262 edges, 22283 markings/sec, 10 secs
lola: sara is running 15 secs || 444588 markings, 612506 edges, 22095 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 554082 markings, 763474 edges, 21899 markings/sec, 20 secs
lola: sara is running 25 secs || 663209 markings, 913797 edges, 21825 markings/sec, 25 secs
lola: sara is running 30 secs || 771956 markings, 1063701 edges, 21749 markings/sec, 30 secs
lola: sara is running 35 secs || 880663 markings, 1213556 edges, 21741 markings/sec, 35 secs

lola: sara is running 40 secs || 989870 markings, 1363986 edges, 21841 markings/sec, 40 secs
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 373 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= p5957) AND (p2906 <= p6451)) OR (p5442 + 1 <= p2004) OR (1 <= p6103) OR (p3593 <= p5496) OR (p1068 + 1 <= p4593))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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 419 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3623 <= 1) AND (p1361 + 1 <= p1633) AND ((p4786 + 1 <= p6759) OR (p2380 + 1 <= p4183)))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 479 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p5976 <= 2) AND (3 <= p1658) AND (p5300 <= p3024))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 115027 markings, 129658 edges, 23005 markings/sec, 0 secs
lola: sara is running 5 secs || 213985 markings, 241062 edges, 19792 markings/sec, 5 secs
lola: sara is running 10 secs || 312048 markings, 352545 edges, 19613 markings/sec, 10 secs
lola: sara is running 15 secs || 408427 markings, 460902 edges, 19276 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 511215 markings, 576655 edges, 20558 markings/sec, 20 secs
lola: sara is running 25 secs || 610891 markings, 689011 edges, 19935 markings/sec, 25 secs

lola: sara is running 30 secs || 710610 markings, 801489 edges, 19944 markings/sec, 30 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1243 <= 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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1289 + 1 <= p6437) AND (p404 <= 2)) OR (p335 + 1 <= p5734))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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 830 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p584) AND (p3059 <= p2560) AND ((3 <= p2933) OR (1 <= p5542)) AND (p4937 + 1 <= p471))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 90883 markings, 98844 edges, 18177 markings/sec, 0 secs
lola: sara is running 5 secs || 184102 markings, 200343 edges, 18644 markings/sec, 5 secs
lola: sara is running 10 secs || 272987 markings, 297079 edges, 17777 markings/sec, 10 secs
lola: sara is running 15 secs || 359956 markings, 391687 edges, 17394 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 450296 markings, 489949 edges, 18068 markings/sec, 20 secs
lola: sara is running 25 secs || 535932 markings, 583109 edges, 17127 markings/sec, 25 secs
lola: sara is running 30 secs || 623925 markings, 678937 edges, 17599 markings/sec, 30 secs
lola: sara is running 35 secs || 701918 markings, 764050 edges, 15599 markings/sec, 35 secs

lola: sara is running 40 secs || 789365 markings, 859536 edges, 17489 markings/sec, 40 secs
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 1091 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p2009 <= 2) AND (p4046 <= 1) AND (p3759 <= 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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-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 1636 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p4715 <= p782)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3273 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p4358 + 1 <= p127) OR (p2341 + 1 <= p3092)) AND ((3 <= p6961) OR (3 <= p3779)))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 48846 markings, 57282 edges, 9769 markings/sec, 0 secs
lola: sara is running 5 secs || 101053 markings, 120570 edges, 10441 markings/sec, 5 secs
lola: sara is running 10 secs || 147288 markings, 179756 edges, 9247 markings/sec, 10 secs
lola: sara is running 15 secs || 195690 markings, 239843 edges, 9680 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 240965 markings, 298393 edges, 9055 markings/sec, 20 secs
lola: sara is running 25 secs || 289283 markings, 358380 edges, 9664 markings/sec, 25 secs
lola: sara is running 30 secs || 335254 markings, 417212 edges, 9194 markings/sec, 30 secs
lola: sara is running 35 secs || 382852 markings, 476805 edges, 9520 markings/sec, 35 secs
lola: sara is running 40 secs || 429841 markings, 536416 edges, 9398 markings/sec, 40 secs
lola: sara is running 45 secs || 476053 markings, 594925 edges, 9242 markings/sec, 45 secs
lola: sara is running 50 secs || 523039 markings, 654310 edges, 9397 markings/sec, 50 secs
lola: sara is running 55 secs || 569774 markings, 713622 edges, 9347 markings/sec, 55 secs

lola: sara is running 60 secs || 617683 markings, 773390 edges, 9582 markings/sec, 60 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no yes no no no no yes no no yes no no no no
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494644859064

--------------------
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="DLCshifumi-PT-3b"
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/DLCshifumi-PT-3b.tgz
mv DLCshifumi-PT-3b 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 DLCshifumi-PT-3b, 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-149436309300475"
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 ;