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

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

=== Now, execution of the tool begins

BK_START 1496545715680


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


checking for too many tokens
===========================================================================================
DLCround-PT-12b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ DLCround-PT-12b @ 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: 12684/65536 symbol table entries, 3783 collisions
lola: preprocessing...
lola: finding significant places
lola: 4848 places, 7836 transitions, 4571 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 11364 transition conflict sets
lola: TASK
lola: reading formula from DLCround-PT-12b-ReachabilityCardinality.task
lola: A (G (((p3993 <= 1) OR (p670 <= 0) OR (3 <= p1053)))) : E (F ((p2681 + 1 <= p3028))) : A (G (((p432 <= p404) OR ((p2419 <= p1514) AND (p412 <= p4736)) OR (1 <= p4430)))) : E (F ((p1148 + 1 <= p3465))) : E (F (((p1592 + 1 <= p2385) OR ((p338 <= p793) AND (p4340 <= p376) AND (2 <= p669))))) : E (F (((1 <= p3875) AND (p4168 <= p1511) AND (p372 <= p3974) AND (3 <= p4358) AND (3 <= p3963)))) : E (F ((2 <= p4310))) : E (F ((3 <= p4415))) : E (F ((p3302 + 1 <= p1652))) : A (G (((p4158 <= 0) OR ((p1052 <= p24) AND (p3231 <= p4679)) OR ((p347 + 1 <= p1099) AND (p749 <= 1))))) : E (F ((((p2877 <= 1) OR (p3526 <= 0)) AND (p4261 + 1 <= p3894)))) : E (F ((((p2764 <= p736) AND (2 <= p1613) AND ((p1746 <= p259) OR (p3614 <= p2549))) OR ((p1687 <= p3117) AND (2 <= p1188) AND ((1 <= p1230) OR (p4442 <= p3922)))))) : E (F (((p4563 <= 1) AND (p1382 + 1 <= p512) AND (3 <= p1808)))) : E (F ((3 <= p728))) : E (F ((((2 <= p1119) AND (3 <= p1861)) OR ((1 <= p3436) AND ((2 <= p2874) OR (3 <= p1777)))))) : E (F ((2 <= p1670)))
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 (((p3993 <= 1) OR (p670 <= 0) OR (3 <= p1053))))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 120040 markings, 133863 edges, 24008 markings/sec, 0 secs
lola: sara is running 5 secs || 253406 markings, 282656 edges, 26673 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 383106 markings, 427344 edges, 25940 markings/sec, 10 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 234 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p2681 + 1 <= p3028)))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p432 <= p404) OR ((p2419 <= p1514) AND (p412 <= p4736)) OR (1 <= p4430))))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 31459 markings, 36512 edges, 6292 markings/sec, 0 secs
lola: sara is running 5 secs || 61045 markings, 70979 edges, 5917 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 89351 markings, 103978 edges, 5661 markings/sec, 10 secs
lola: sara is running 15 secs || 117191 markings, 136408 edges, 5568 markings/sec, 15 secs
lola: sara is running 20 secs || 144033 markings, 167682 edges, 5368 markings/sec, 20 secs
lola: sara is running 25 secs || 169759 markings, 197662 edges, 5145 markings/sec, 25 secs
lola: sara is running 30 secs || 195192 markings, 227302 edges, 5087 markings/sec, 30 secs
lola: sara is running 35 secs || 220885 markings, 257227 edges, 5139 markings/sec, 35 secs
lola: sara is running 40 secs || 247088 markings, 287793 edges, 5241 markings/sec, 40 secs
lola: sara is running 45 secs || 272592 markings, 317508 edges, 5101 markings/sec, 45 secs
lola: sara is running 50 secs || 298565 markings, 347801 edges, 5195 markings/sec, 50 secs
lola: sara is running 55 secs || 325032 markings, 378641 edges, 5293 markings/sec, 55 secs
lola: sara is running 60 secs || 350940 markings, 408829 edges, 5182 markings/sec, 60 secs
lola: sara is running 65 secs || 377967 markings, 440374 edges, 5405 markings/sec, 65 secs
lola: sara is running 70 secs || 404609 markings, 471425 edges, 5328 markings/sec, 70 secs

lola: sara is running 75 secs || 430925 markings, 502081 edges, 5263 markings/sec, 75 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
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 ((p1148 + 1 <= p3465)))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-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: E (F (((p1592 + 1 <= p2385) OR ((p338 <= p793) AND (p4340 <= p376) AND (2 <= p669)))))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p3875) AND (p4168 <= p1511) AND (p372 <= p3974) AND (3 <= p4358) AND (3 <= p3963))))
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 572 bytes per marking, with 5 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 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 381531 markings, 382641 edges, 76306 markings/sec, 0 secs
lola: sara is running 5 secs || 759942 markings, 761845 edges, 75682 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 1133600 markings, 1136281 edges, 74732 markings/sec, 10 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 342 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p4310)))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 122156 markings, 141745 edges, 24431 markings/sec, 0 secs
lola: sara is running 5 secs || 242986 markings, 282303 edges, 24166 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 367229 markings, 426959 edges, 24849 markings/sec, 10 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 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p4415)))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 94823 markings, 105285 edges, 18965 markings/sec, 0 secs
lola: sara is running 5 secs || 169689 markings, 188877 edges, 14973 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 251880 markings, 280645 edges, 16438 markings/sec, 10 secs
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 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p3302 + 1 <= p1652)))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-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 483 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p4158 <= 0) OR ((p1052 <= p24) AND (p3231 <= p4679)) OR ((p347 + 1 <= p1099) AND (p749 <= 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 572 bytes per marking, with 5 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2877 <= 1) OR (p3526 <= 0)) AND (p4261 + 1 <= p3894))))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 677 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2764 <= p736) AND (2 <= p1613) AND ((p1746 <= p259) OR (p3614 <= p2549))) OR ((p1687 <= p3117) AND (2 <= p1188) AND ((1 <= p1230) OR (p4442 <= p3922))))))
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 572 bytes per marking, with 5 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 4 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 68157 markings, 74834 edges, 13631 markings/sec, 0 secs
lola: sara is running 5 secs || 135414 markings, 148737 edges, 13451 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 196602 markings, 215223 edges, 12238 markings/sec, 10 secs
lola: sara is running 15 secs || 261888 markings, 286194 edges, 13057 markings/sec, 15 secs

lola: sara is running 20 secs || 321749 markings, 351114 edges, 11972 markings/sec, 20 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 840 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p4563 <= 1) AND (p1382 + 1 <= p512) AND (3 <= p1808))))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 81171 markings, 89040 edges, 16234 markings/sec, 0 secs
lola: sara is running 5 secs || 157747 markings, 173175 edges, 15315 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 234880 markings, 257895 edges, 15427 markings/sec, 10 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 1114 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p728)))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 94195 markings, 103503 edges, 18839 markings/sec, 0 secs
lola: sara is running 5 secs || 178627 markings, 196373 edges, 16886 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 262154 markings, 288433 edges, 16705 markings/sec, 10 secs
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 1664 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p1119) AND (3 <= p1861)) OR ((1 <= p3436) AND ((2 <= p2874) OR (3 <= p1777))))))
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 572 bytes per marking, with 5 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 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCround-PT-12b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 39605 markings, 52597 edges, 7921 markings/sec, 0 secs
lola: sara is running 5 secs || 69999 markings, 98015 edges, 6079 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 98735 markings, 140680 edges, 5747 markings/sec, 10 secs
lola: sara is running 15 secs || 130311 markings, 187599 edges, 6315 markings/sec, 15 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3304 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p1670)))
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 572 bytes per marking, with 5 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 DLCround-PT-12b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCround-PT-12b-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 91356 markings, 106741 edges, 18271 markings/sec, 0 secs
lola: sara is running 5 secs || 184069 markings, 216065 edges, 18543 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 278401 markings, 327414 edges, 18866 markings/sec, 10 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: yes yes no yes yes no no no yes no yes no no no no no
FORMULA DLCround-PT-12b-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCround-PT-12b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496545967977

--------------------
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="DLCround-PT-12b"
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/DLCround-PT-12b.tgz
mv DLCround-PT-12b 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 DLCround-PT-12b, 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-149580961900376"
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 ;