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 FlexibleBarrier-PT-22b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r188-blw3-149581034400178
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496501702923


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


checking for too many tokens
===========================================================================================
FlexibleBarrier-PT-22b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ FlexibleBarrier-PT-22b @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 13947/65536 symbol table entries, 4218 collisions
lola: preprocessing...
lola: finding significant places
lola: 6478 places, 7469 transitions, 6454 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 7515 transition conflict sets
lola: TASK
lola: reading formula from FlexibleBarrier-PT-22b-ReachabilityCardinality.task
lola: A (G (((p764 <= p6127) AND (p4633 <= p2021)))) : A (G (((p1178 <= p82) OR ((1 <= p2087) AND (p1567 <= 2))))) : A (G (((p3156 <= p3397) OR (((p2401 <= p3469) OR (3 <= p264)) AND ((p2400 <= p3469) OR (3 <= p3937)))))) : E (F ((1 <= p5196))) : A (G ((((p3816 + 1 <= p2094) AND (p2251 + 1 <= p4562)) OR (p2391 <= p1195)))) : E (F (((p5544 <= p722) AND (1 <= p110) AND ((2 <= p6419) OR (p2718 <= p45)) AND ((2 <= p897) OR (3 <= p4007) OR (p171 <= 0))))) : E (F ((((1 <= p440) AND (1 <= p1784) AND (2 <= p6047)) OR (p1568 + 1 <= p5753)))) : A (G ((p4034 <= p1790))) : A (G (((p5723 + 1 <= p1123) OR (p885 <= p3244) OR (3 <= p3000)))) : E (F (((p5760 <= p244) AND (p3056 <= p5449) AND (3 <= p6399)))) : A (G (((((p5864 <= p5444) OR (p1743 <= p5933)) AND ((p1725 <= p3120) OR (3 <= p4366))) OR ((3 <= p1070) AND ((1 <= p1922) OR (p4198 <= p3434)))))) : A (G ((p2253 <= 1))) : E (F ((2 <= p302))) : E (F (((p5421 <= p634) AND (1 <= p1819) AND (1 <= p5370) AND (p1788 <= p3557) AND (2 <= p4883)))) : E (F ((2 <= p3956))) : E (F ((3 <= p454)))
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 (((p764 <= p6127) AND (p4633 <= p2021))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 27966 markings, 52674 edges, 5593 markings/sec, 0 secs
lola: sara is running 5 secs || 54190 markings, 105042 edges, 5245 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 80375 markings, 158870 edges, 5237 markings/sec, 10 secs
lola: sara is running 15 secs || 108051 markings, 211135 edges, 5535 markings/sec, 15 secs
lola: sara is running 20 secs || 134114 markings, 263186 edges, 5213 markings/sec, 20 secs
lola: sara is running 25 secs || 160090 markings, 315404 edges, 5195 markings/sec, 25 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 1 will run for 233 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1178 <= p82) OR ((1 <= p2087) AND (p1567 <= 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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 27594 markings, 52815 edges, 5519 markings/sec, 0 secs
lola: sara is running 5 secs || 53365 markings, 104178 edges, 5154 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 79061 markings, 155593 edges, 5139 markings/sec, 10 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 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p3156 <= p3397) OR (((p2401 <= p3469) OR (3 <= p264)) AND ((p2400 <= p3469) OR (3 <= p3937))))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 27052 markings, 63623 edges, 5410 markings/sec, 0 secs
lola: sara is running 5 secs || 52229 markings, 125819 edges, 5035 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 77388 markings, 188050 edges, 5032 markings/sec, 10 secs
lola: sara is running 15 secs || 103720 markings, 255517 edges, 5266 markings/sec, 15 secs
lola: sara is running 20 secs || 128810 markings, 318342 edges, 5018 markings/sec, 20 secs
lola: sara is running 25 secs || 153834 markings, 380149 edges, 5005 markings/sec, 25 secs
lola: sara is running 30 secs || 178528 markings, 447445 edges, 4939 markings/sec, 30 secs
lola: sara is running 35 secs || 205293 markings, 510564 edges, 5353 markings/sec, 35 secs
lola: sara is running 40 secs || 230353 markings, 572539 edges, 5012 markings/sec, 40 secs
lola: sara is running 45 secs || 255446 markings, 634516 edges, 5019 markings/sec, 45 secs
lola: sara is running 50 secs || 281390 markings, 702004 edges, 5189 markings/sec, 50 secs
lola: sara is running 55 secs || 307232 markings, 765660 edges, 5168 markings/sec, 55 secs
lola: sara is running 60 secs || 332634 markings, 828330 edges, 5080 markings/sec, 60 secs
lola: sara is running 65 secs || 358311 markings, 896407 edges, 5135 markings/sec, 65 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 262 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p5196)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 4 will run for 284 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p3816 + 1 <= p2094) AND (p2251 + 1 <= p4562)) OR (p2391 <= p1195))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 26704 markings, 51602 edges, 5341 markings/sec, 0 secs
lola: sara is running 5 secs || 50454 markings, 118542 edges, 4750 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 75439 markings, 176845 edges, 4997 markings/sec, 10 secs
lola: sara is running 15 secs || 98867 markings, 229717 edges, 4686 markings/sec, 15 secs
lola: sara is running 20 secs || 122164 markings, 281652 edges, 4659 markings/sec, 20 secs
lola: sara is running 25 secs || 147003 markings, 337536 edges, 4968 markings/sec, 25 secs
lola: sara is running 30 secs || 171578 markings, 404661 edges, 4915 markings/sec, 30 secs
lola: sara is running 35 secs || 197099 markings, 468645 edges, 5104 markings/sec, 35 secs
lola: sara is running 40 secs || 221930 markings, 535457 edges, 4966 markings/sec, 40 secs
lola: sara is running 45 secs || 247204 markings, 599813 edges, 5055 markings/sec, 45 secs
lola: sara is running 50 secs || 272088 markings, 665917 edges, 4977 markings/sec, 50 secs
lola: sara is running 55 secs || 297267 markings, 730784 edges, 5036 markings/sec, 55 secs
lola: sara is running 60 secs || 322397 markings, 796624 edges, 5026 markings/sec, 60 secs
lola: sara is running 65 secs || 347461 markings, 862350 edges, 5013 markings/sec, 65 secs
lola: sara is running 70 secs || 372723 markings, 927367 edges, 5052 markings/sec, 70 secs
lola: sara is running 75 secs || 397637 markings, 993002 edges, 4983 markings/sec, 75 secs
lola: sara is running 80 secs || 423060 markings, 1058133 edges, 5085 markings/sec, 80 secs
lola: sara is running 85 secs || 447728 markings, 1125155 edges, 4934 markings/sec, 85 secs
lola: sara is running 90 secs || 473351 markings, 1188805 edges, 5125 markings/sec, 90 secs
lola: sara is running 95 secs || 497803 markings, 1257346 edges, 4890 markings/sec, 95 secs
lola: sara is running 100 secs || 523677 markings, 1319548 edges, 5175 markings/sec, 100 secs
lola: sara is running 105 secs || 545092 markings, 1384494 edges, 4283 markings/sec, 105 secs
lola: sara is running 110 secs || 566520 markings, 1444979 edges, 4286 markings/sec, 110 secs
lola: sara is running 115 secs || 587976 markings, 1505739 edges, 4291 markings/sec, 115 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 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p5544 <= p722) AND (1 <= p110) AND ((2 <= p6419) OR (p2718 <= p45)) AND ((2 <= p897) OR (3 <= p4007) OR (p171 <= 0)))))
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 808 bytes per marking, with 10 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 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 27821 markings, 53277 edges, 5564 markings/sec, 0 secs
lola: sara is running 5 secs || 53888 markings, 105272 edges, 5213 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 79830 markings, 157835 edges, 5188 markings/sec, 10 secs
lola: sara is running 15 secs || 107401 markings, 210718 edges, 5514 markings/sec, 15 secs
lola: sara is running 20 secs || 133339 markings, 262452 edges, 5188 markings/sec, 20 secs
lola: sara is running 25 secs || 154766 markings, 304671 edges, 4285 markings/sec, 25 secs
lola: sara is running 30 secs || 180710 markings, 356433 edges, 5189 markings/sec, 30 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= p440) AND (1 <= p1784) AND (2 <= p6047)) OR (p1568 + 1 <= p5753))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p4034 <= p1790)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-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 406 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p5723 + 1 <= p1123) OR (p885 <= p3244) OR (3 <= p3000))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-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 464 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p5760 <= p244) AND (p3056 <= p5449) AND (3 <= p6399))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 27709 markings, 52882 edges, 5542 markings/sec, 0 secs
lola: sara is running 5 secs || 53659 markings, 104690 edges, 5190 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 79517 markings, 156204 edges, 5172 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 10 will run for 538 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((p5864 <= p5444) OR (p1743 <= p5933)) AND ((p1725 <= p3120) OR (3 <= p4366))) OR ((3 <= p1070) AND ((1 <= p1922) OR (p4198 <= p3434))))))
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 808 bytes per marking, with 10 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 14 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to FlexibleBarrier-PT-22b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-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 646 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2253 <= 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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 27679 markings, 52180 edges, 5536 markings/sec, 0 secs
lola: sara is running 5 secs || 53564 markings, 104099 edges, 5177 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 79363 markings, 155743 edges, 5160 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 12 will run for 804 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p302)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 27938 markings, 53501 edges, 5588 markings/sec, 0 secs
lola: sara is running 5 secs || 54225 markings, 106003 edges, 5257 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 80557 markings, 159053 edges, 5266 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 1066 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p5421 <= p634) AND (1 <= p1819) AND (1 <= p5370) AND (p1788 <= p3557) AND (2 <= p4883))))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 27799 markings, 52807 edges, 5560 markings/sec, 0 secs
lola: sara is running 5 secs || 53821 markings, 105030 edges, 5204 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 79911 markings, 158009 edges, 5218 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 1590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p3956)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 26071 markings, 56813 edges, 5214 markings/sec, 0 secs
lola: sara is running 5 secs || 48804 markings, 119738 edges, 4547 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 74050 markings, 177325 edges, 5049 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 15 will run for 3163 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p454)))
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 808 bytes per marking, with 10 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 FlexibleBarrier-PT-22b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file FlexibleBarrier-PT-22b-ReachabilityCardinality-15.sara.
lola: sara is running 0 secs || 28007 markings, 53322 edges, 5601 markings/sec, 0 secs
lola: sara is running 5 secs || 54156 markings, 105775 edges, 5230 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 80184 markings, 158583 edges, 5206 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: no no no yes no yes yes no no no no yes no no no no
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA FlexibleBarrier-PT-22b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496502096365

--------------------
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="FlexibleBarrier-PT-22b"
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/FlexibleBarrier-PT-22b.tgz
mv FlexibleBarrier-PT-22b 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 FlexibleBarrier-PT-22b, 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 r188-blw3-149581034400178"
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 ;