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 S_PermAdmissibility-PT-02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441650200412
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496387914545


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


checking for too many tokens
===========================================================================================
S_PermAdmissibility-PT-02: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_PermAdmissibility-PT-02 @ 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: 760/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 168 places, 592 transitions, 136 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 820 transition conflict sets
lola: TASK
lola: reading formula from PermAdmissibility-COL-02-ReachabilityCardinality.task
lola: A (G (((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= c9) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 0) OR (2 <= in3_4 + in3_5)))) : E (F ((in4_6 + in4_7 <= c11))) : E (F ((3 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))) : A (G ((c20 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))) : E (F (((3 <= c19) OR (3 <= c16) OR ((3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) AND (out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) OR ((1 <= c7) AND (1 <= c6) AND (c14 + 1 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7))))) : E (F ((((3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (3 <= c19) AND ((2 <= c14) OR (c7 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))) OR ((c12 + 1 <= c110) AND ((1 <= c13) OR (2 <= c13)))))) : A (G ((1 <= in2_2 + in2_3))) : A (G ((c19 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7))) : A (G ((((c11 + 1 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= 2)) AND (c20 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))) : A (G ((((3 <= in2_2 + in2_3) AND (aux8_2 + aux8_3 + aux8_6 + aux8_7 <= in1_0 + in1_1) AND (2 <= c17)) OR (((c18 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) OR (aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)) AND ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7) OR (1 <= c11)))))) : E (F ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7))) : A (G (((c7 + 1 <= in3_4 + in3_5) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1) OR ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (aux8_2 + aux8_3 + aux8_6 + aux8_7 + 1 <= c17))))) : E (F ((((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= 0) AND (c110 + 1 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)) OR (3 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)))) : E (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7) AND ((c9 <= 1) OR (in1_0 + in1_1 <= 2))))) : E (F ((3 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7))) : A (G ((c20 <= c13)))
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 (((aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 + 1 <= c9) OR (aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7 <= 0) OR (2 <= in3_4 + in3_5))))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((in4_6 + in4_7 <= c11)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: state equation: calling and running sara
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 544 bytes per marking, with 0 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: SUBRESULT
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality.sara
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7)))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-2.sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality.sara.
lola: state equation: calling and running sara
sara: 1: error near '': syntax error, unexpected $end, expecting PROBLEM
sara: error while parsing the sara problem file -- aborting [#05]
sara: see manual for a documentation of this error
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((c20 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7)))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= c19) OR (3 <= c16) OR ((3 <= out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7) AND (out4_0 + out4_1 + out4_2 + out4_3 + out4_4 + out4_5 + out4_6 + out4_7 <= c17)) OR ((1 <= c7) AND (1 <= c6) AND (c14 + 1 <= out8_6 + out8_5 + out8_4 + out8_3 + out8_2 + out8_1 + out8_0 + out8_7)))))
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 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 384464 markings, 912380 edges, 76893 markings/sec, 0 secs
lola: sara is running 5 secs || 731218 markings, 1723066 edges, 69351 markings/sec, 5 secs
lola: sara is running 10 secs || 1090520 markings, 2715867 edges, 71860 markings/sec, 10 secs
lola: sara is running 15 secs || 1444610 markings, 3758075 edges, 70818 markings/sec, 15 secs
lola: sara is running 20 secs || 1797554 markings, 4661197 edges, 70589 markings/sec, 20 secs
lola: sara is running 25 secs || 2131260 markings, 5471169 edges, 66741 markings/sec, 25 secs
lola: sara is running 30 secs || 2470650 markings, 6289392 edges, 67878 markings/sec, 30 secs
lola: sara is running 35 secs || 2805507 markings, 7117778 edges, 66971 markings/sec, 35 secs
lola: sara is running 40 secs || 3130764 markings, 7885777 edges, 65051 markings/sec, 40 secs
lola: sara is running 45 secs || 3469358 markings, 8722538 edges, 67719 markings/sec, 45 secs
lola: sara is running 50 secs || 3796749 markings, 9515247 edges, 65478 markings/sec, 50 secs
lola: sara is running 55 secs || 4127945 markings, 10330430 edges, 66239 markings/sec, 55 secs
lola: sara is running 60 secs || 4448562 markings, 11095998 edges, 64123 markings/sec, 60 secs
lola: sara is running 65 secs || 4809911 markings, 11934284 edges, 72270 markings/sec, 65 secs
lola: sara is running 70 secs || 5158818 markings, 12801451 edges, 69781 markings/sec, 70 secs
lola: sara is running 75 secs || 5496131 markings, 13760428 edges, 67463 markings/sec, 75 secs
lola: sara is running 80 secs || 5827233 markings, 14562219 edges, 66220 markings/sec, 80 secs
lola: sara is running 85 secs || 6135528 markings, 15296370 edges, 61659 markings/sec, 85 secs
lola: sara is running 90 secs || 6458336 markings, 16079342 edges, 64562 markings/sec, 90 secs
lola: sara is running 95 secs || 6800166 markings, 16888906 edges, 68366 markings/sec, 95 secs
lola: sara is running 100 secs || 7156484 markings, 17727167 edges, 71264 markings/sec, 100 secs
lola: sara is running 105 secs || 7498467 markings, 18577720 edges, 68397 markings/sec, 105 secs
lola: sara is running 110 secs || 7832229 markings, 19545320 edges, 66752 markings/sec, 110 secs
lola: sara is running 115 secs || 8157651 markings, 20455741 edges, 65084 markings/sec, 115 secs
lola: sara is running 120 secs || 8457166 markings, 21168906 edges, 59903 markings/sec, 120 secs
lola: sara is running 125 secs || 8775581 markings, 21950560 edges, 63683 markings/sec, 125 secs
lola: sara is running 130 secs || 9066358 markings, 22652390 edges, 58155 markings/sec, 130 secs
lola: sara is running 135 secs || 9379106 markings, 23409152 edges, 62550 markings/sec, 135 secs
lola: sara is running 140 secs || 9729928 markings, 24233310 edges, 70164 markings/sec, 140 secs
lola: sara is running 145 secs || 10066924 markings, 25113438 edges, 67399 markings/sec, 145 secs
lola: sara is running 150 secs || 10391945 markings, 26072999 edges, 65004 markings/sec, 150 secs
lola: sara is running 155 secs || 10691720 markings, 26838529 edges, 59955 markings/sec, 155 secs
lola: sara is running 160 secs || 10991897 markings, 27607811 edges, 60035 markings/sec, 160 secs
lola: sara is running 165 secs || 11296600 markings, 28385562 edges, 60941 markings/sec, 165 secs
lola: sara is running 170 secs || 11594590 markings, 29185765 edges, 59598 markings/sec, 170 secs
lola: sara is running 175 secs || 11907612 markings, 30121022 edges, 62604 markings/sec, 175 secs
lola: sara is running 180 secs || 12160647 markings, 30961839 edges, 50607 markings/sec, 180 secs
lola: sara is running 185 secs || 12449733 markings, 31932844 edges, 57817 markings/sec, 185 secs
lola: sara is running 190 secs || 12746038 markings, 32855338 edges, 59261 markings/sec, 190 secs
lola: sara is running 195 secs || 13029924 markings, 33763702 edges, 56777 markings/sec, 195 secs
lola: sara is running 200 secs || 13330651 markings, 34690504 edges, 60145 markings/sec, 200 secs
lola: sara is running 205 secs || 13619181 markings, 35670231 edges, 57706 markings/sec, 205 secs
lola: sara is running 210 secs || 13901678 markings, 36656059 edges, 56499 markings/sec, 210 secs
lola: sara is running 215 secs || 14197356 markings, 37530124 edges, 59136 markings/sec, 215 secs
lola: sara is running 220 secs || 14494765 markings, 38386198 edges, 59482 markings/sec, 220 secs
lola: sara is running 225 secs || 14779432 markings, 39244692 edges, 56933 markings/sec, 225 secs
lola: sara is running 230 secs || 15066817 markings, 40163501 edges, 57477 markings/sec, 230 secs
lola: sara is running 235 secs || 15348200 markings, 41144399 edges, 56277 markings/sec, 235 secs
lola: sara is running 240 secs || 15628059 markings, 42038560 edges, 55972 markings/sec, 240 secs
lola: sara is running 245 secs || 15899792 markings, 42958125 edges, 54347 markings/sec, 245 secs
lola: sara is running 250 secs || 16198422 markings, 43886921 edges, 59726 markings/sec, 250 secs
lola: sara is running 255 secs || 16473399 markings, 44875549 edges, 54995 markings/sec, 255 secs
lola: sara is running 260 secs || 16723061 markings, 45680664 edges, 49932 markings/sec, 260 secs
lola: sara is running 265 secs || 17007207 markings, 46555317 edges, 56829 markings/sec, 265 secs
lola: sara is running 270 secs || 17355439 markings, 47403828 edges, 69646 markings/sec, 270 secs
lola: sara is running 275 secs || 17682114 markings, 48249870 edges, 65335 markings/sec, 275 secs
lola: sara is running 280 secs || 18002696 markings, 49165115 edges, 64116 markings/sec, 280 secs
lola: sara is running 285 secs || 18358067 markings, 50040205 edges, 71074 markings/sec, 285 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7) AND (3 <= c19) AND ((2 <= c14) OR (c7 <= aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7))) OR ((c12 + 1 <= c110) AND ((1 <= c13) OR (2 <= c13))))))
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 544 bytes per marking, with 0 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 4 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-5.sara
lola: subprocess 6 will run for 324 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= in2_2 + in2_3)))
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 544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: ========================================
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 7 will run for 360 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (G ((c19 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-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 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((c11 + 1 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) OR (out1_0 + out1_1 + out1_2 + out1_3 + out1_4 + out1_5 + out1_6 + out1_7 <= 2)) AND (c20 <= aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7))))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PermAdmissibility-COL-02-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= in2_2 + in2_3) AND (aux8_2 + aux8_3 + aux8_6 + aux8_7 <= in1_0 + in1_1) AND (2 <= c17)) OR (((c18 <= aux8_2 + aux8_3 + aux8_6 + aux8_7) OR (aux16_6 + aux16_4 + aux16_2 + aux16_0 + aux16_1 + aux16_3 + aux16_5 + aux16_7 <= aux7_2 + aux7_3 + aux7_6 + aux7_7)) AND ((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + ... (shortened)
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 544 bytes per marking, with 0 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to PermAdmissibility-COL-02-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 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= out5_0 + out5_1 + out5_2 + out5_3 + out5_4 + out5_5 + out5_6 + out5_7)))
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 544 bytes per marking, with 0 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: state equation: write sara problem file to PermAdmissibility-COL-02-ReachabilityCardinality-10.sara
lola: ========================================
lola: subprocess 11 will run for 649 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((c7 + 1 <= in3_4 + in3_5) OR (aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7 <= 1) OR ((aux13_0 + aux13_1 + aux13_2 + aux13_3 + aux13_4 + aux13_5 + aux13_6 + aux13_7 <= 2) AND (aux8_2 + aux8_3 + aux8_6 + aux8_7 + 1 <= c17)))))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 811 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((aux12_0 + aux12_1 + aux12_2 + aux12_3 + aux12_4 + aux12_5 + aux12_6 + aux12_7 <= 0) AND (c110 + 1 <= aux10_0 + aux10_1 + aux10_2 + aux10_3 + aux10_4 + aux10_5 + aux10_6 + aux10_7)) OR (3 <= out3_0 + out3_1 + out3_2 + out3_3 + out3_4 + out3_5 + out3_6 + out3_7))))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 1081 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((out2_0 + out2_1 + out2_2 + out2_3 + out2_4 + out2_5 + out2_6 + out2_7 + 1 <= aux14_0 + aux14_1 + aux14_2 + aux14_3 + aux14_4 + aux14_5 + aux14_6 + aux14_7) AND ((c9 <= 1) OR (in1_0 + in1_1 <= 2)))))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-13.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1622 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= aux15_0 + aux15_1 + aux15_2 + aux15_3 + aux15_4 + aux15_5 + aux15_6 + aux15_7)))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3245 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((c20 <= c13)))
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 544 bytes per marking, with 0 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 PermAdmissibility-COL-02-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes unknown yes no no yes no yes no yes yes yes no
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PermAdmissibility-COL-02-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496388209564

--------------------
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="S_PermAdmissibility-PT-02"
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/S_PermAdmissibility-PT-02.tgz
mv S_PermAdmissibility-PT-02 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 S_PermAdmissibility-PT-02, 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 r118-blw7-149441650200412"
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 ;