About the Execution of LoLA for S_DLCshifumi-PT-6a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1099.720 | 1161295.00 | 2324684.00 | 220.30 | TFFTFTTTFFFFFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
...............
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_DLCshifumi-PT-6a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488456000520
=====================================================================
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-0
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-1
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-10
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-11
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-12
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-13
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-14
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-15
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-2
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-3
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-4
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-5
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-6
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-7
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-8
FORMULA_NAME DLCshifumi-PT-6a-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496472414771
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_DLCshifumi-PT-6a: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_DLCshifumi-PT-6a: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_DLCshifumi-PT-6a @ 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: 29504/65536 symbol table entries, 13256 collisions
lola: preprocessing...
lola: finding significant places
lola: 3568 places, 25936 transitions, 1153 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 22565 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-6a-ReachabilityCardinality.task
lola: A (G (((p3305 + 1 <= p3219) OR (p824 <= 1) OR (3 <= p733)))) : E (F ((2 <= p2813))) : E (F (((2 <= p1034) AND (1 <= p232)))) : E (F (((2 <= p2801) OR ((1 <= p1659) AND (p2825 <= p1294) AND (2 <= p2632))))) : E (F (((3 <= p319) AND (3 <= p1970)))) : E (F ((3 <= p1373))) : E (F ((((3 <= p1816) OR (p2405 <= p1055)) AND (3 <= p2661) AND ((p1979 + 1 <= p1241) OR (p2965 + 1 <= p1946))))) : E (F ((3 <= p1177))) : E (F ((((p2773 <= p1569) AND (1 <= p883) AND (p221 <= p3172)) OR ((3 <= p306) AND (1 <= p595) AND ((3 <= p2418) OR (3 <= p1517)))))) : A (G (((p403 <= p1652) AND ((p1199 <= 1) OR ((p1121 <= p57) AND (3 <= p234)))))) : E (F ((((2 <= p474) AND (p1842 <= 2)) OR (3 <= p2936)))) : A (G ((p3411 <= 2))) : E (F ((3 <= p560))) : A (G (((1 <= p1447) OR (p2716 <= p3115) OR (p1486 + 1 <= p3224) OR (((p1051 <= p1016) OR (p1120 <= p2244)) AND (2 <= p1223))))) : A (G ((p3066 <= 1))) : A (G (((p1954 <= p1481) OR (p504 <= 0) OR ((p3450 <= 0) AND (p935 + 1 <= p1906)))))
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 (((p3305 + 1 <= p3219) OR (p824 <= 1) OR (3 <= p733))))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 755 markings, 6262 edges, 151 markings/sec, 0 secs
lola: sara is running 5 secs || 1480 markings, 12532 edges, 145 markings/sec, 5 secs
lola: sara is running 10 secs || 2164 markings, 19652 edges, 137 markings/sec, 10 secs
lola: sara is running 15 secs || 2856 markings, 27947 edges, 138 markings/sec, 15 secs
lola: sara is running 20 secs || 3528 markings, 36015 edges, 134 markings/sec, 20 secs
lola: sara is running 25 secs || 4194 markings, 44308 edges, 133 markings/sec, 25 secs
lola: sara is running 30 secs || 4858 markings, 52253 edges, 133 markings/sec, 30 secs
lola: sara is running 35 secs || 5520 markings, 60383 edges, 132 markings/sec, 35 secs
lola: sara is running 40 secs || 6240 markings, 69728 edges, 144 markings/sec, 40 secs
lola: sara is running 45 secs || 6967 markings, 78748 edges, 145 markings/sec, 45 secs
lola: sara is running 50 secs || 7705 markings, 88145 edges, 148 markings/sec, 50 secs
lola: sara is running 55 secs || 8437 markings, 97357 edges, 146 markings/sec, 55 secs
lola: sara is running 60 secs || 9148 markings, 106652 edges, 142 markings/sec, 60 secs
lola: sara is running 65 secs || 9853 markings, 114980 edges, 141 markings/sec, 65 secs
lola: sara is running 70 secs || 10544 markings, 123834 edges, 138 markings/sec, 70 secs
lola: sara is running 75 secs || 11235 markings, 133017 edges, 138 markings/sec, 75 secs
lola: sara is running 80 secs || 11940 markings, 141913 edges, 141 markings/sec, 80 secs
lola: sara is running 85 secs || 12660 markings, 150502 edges, 144 markings/sec, 85 secs
lola: sara is running 90 secs || 13383 markings, 159853 edges, 145 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 14092 markings, 168789 edges, 142 markings/sec, 95 secs
lola: sara is running 100 secs || 14803 markings, 178068 edges, 142 markings/sec, 100 secs
lola: sara is running 105 secs || 15518 markings, 187011 edges, 143 markings/sec, 105 secs
lola: sara is running 110 secs || 16238 markings, 195784 edges, 144 markings/sec, 110 secs
lola: sara is running 115 secs || 16957 markings, 204933 edges, 144 markings/sec, 115 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 227 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p2813)))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 2 will run for 243 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1034) AND (1 <= p232))))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 657 markings, 5507 edges, 131 markings/sec, 0 secs
lola: sara is running 5 secs || 1311 markings, 13005 edges, 131 markings/sec, 5 secs
lola: sara is running 10 secs || 2002 markings, 19909 edges, 138 markings/sec, 10 secs
lola: sara is running 15 secs || 2703 markings, 26248 edges, 140 markings/sec, 15 secs
lola: sara is running 20 secs || 3419 markings, 35376 edges, 143 markings/sec, 20 secs
lola: sara is running 25 secs || 4133 markings, 44952 edges, 143 markings/sec, 25 secs
lola: sara is running 30 secs || 4860 markings, 54008 edges, 145 markings/sec, 30 secs
lola: sara is running 35 secs || 5595 markings, 63113 edges, 147 markings/sec, 35 secs
lola: sara is running 40 secs || 6259 markings, 71135 edges, 133 markings/sec, 40 secs
lola: sara is running 45 secs || 6902 markings, 79463 edges, 129 markings/sec, 45 secs
lola: sara is running 50 secs || 7546 markings, 87420 edges, 129 markings/sec, 50 secs
lola: sara is running 55 secs || 8254 markings, 96215 edges, 142 markings/sec, 55 secs
lola: sara is running 60 secs || 8969 markings, 105042 edges, 143 markings/sec, 60 secs
lola: sara is running 65 secs || 9686 markings, 113495 edges, 143 markings/sec, 65 secs
lola: sara is running 70 secs || 10418 markings, 122533 edges, 146 markings/sec, 70 secs
lola: sara is running 75 secs || 11112 markings, 131456 edges, 139 markings/sec, 75 secs
lola: sara is running 80 secs || 11811 markings, 140023 edges, 140 markings/sec, 80 secs
lola: sara is running 85 secs || 12521 markings, 149019 edges, 142 markings/sec, 85 secs
lola: sara is running 90 secs || 13227 markings, 157806 edges, 141 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 13923 markings, 166365 edges, 139 markings/sec, 95 secs
lola: sara is running 100 secs || 14604 markings, 174294 edges, 136 markings/sec, 100 secs
lola: sara is running 105 secs || 15288 markings, 182749 edges, 137 markings/sec, 105 secs
lola: sara is running 110 secs || 15981 markings, 190915 edges, 139 markings/sec, 110 secs
lola: sara is running 115 secs || 16690 markings, 199908 edges, 142 markings/sec, 115 secs
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 253 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p2801) OR ((1 <= p1659) AND (p2825 <= p1294) AND (2 <= p2632)))))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 423 markings, 36474 edges, 85 markings/sec, 0 secs
lola: sara is running 5 secs || 846 markings, 73186 edges, 85 markings/sec, 5 secs
lola: sara is running 10 secs || 1279 markings, 111083 edges, 87 markings/sec, 10 secs
lola: sara is running 15 secs || 1728 markings, 153223 edges, 90 markings/sec, 15 secs
lola: sara is running 20 secs || 2204 markings, 200368 edges, 95 markings/sec, 20 secs
lola: sara is running 25 secs || 2668 markings, 247347 edges, 93 markings/sec, 25 secs
lola: sara is running 30 secs || 3136 markings, 294512 edges, 94 markings/sec, 30 secs
lola: sara is running 35 secs || 3604 markings, 338973 edges, 94 markings/sec, 35 secs
lola: sara is running 40 secs || 4077 markings, 384165 edges, 95 markings/sec, 40 secs
lola: sara is running 45 secs || 4541 markings, 431825 edges, 93 markings/sec, 45 secs
lola: sara is running 50 secs || 5009 markings, 477880 edges, 94 markings/sec, 50 secs
lola: sara is running 55 secs || 5472 markings, 521601 edges, 93 markings/sec, 55 secs
lola: sara is running 60 secs || 5933 markings, 565801 edges, 92 markings/sec, 60 secs
lola: sara is running 65 secs || 6371 markings, 608865 edges, 88 markings/sec, 65 secs
lola: sara is running 70 secs || 6808 markings, 653805 edges, 87 markings/sec, 70 secs
lola: sara is running 75 secs || 7247 markings, 697402 edges, 88 markings/sec, 75 secs
lola: sara is running 80 secs || 7680 markings, 739935 edges, 87 markings/sec, 80 secs
lola: sara is running 85 secs || 8111 markings, 783300 edges, 86 markings/sec, 85 secs
lola: sara is running 90 secs || 8546 markings, 825107 edges, 87 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 8975 markings, 867164 edges, 86 markings/sec, 95 secs
lola: sara is running 100 secs || 9405 markings, 907839 edges, 86 markings/sec, 100 secs
lola: sara is running 105 secs || 9833 markings, 949006 edges, 86 markings/sec, 105 secs
lola: sara is running 110 secs || 10257 markings, 991683 edges, 85 markings/sec, 110 secs
lola: sara is running 115 secs || 10685 markings, 1032860 edges, 86 markings/sec, 115 secs
lola: sara is running 120 secs || 11107 markings, 1074920 edges, 84 markings/sec, 120 secs
lola: sara is running 125 secs || 11535 markings, 1117515 edges, 86 markings/sec, 125 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p319) AND (3 <= p1970))))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-4.sara.
lola: sara is running 0 secs || 430 markings, 4389 edges, 86 markings/sec, 0 secs
lola: sara is running 5 secs || 850 markings, 9420 edges, 84 markings/sec, 5 secs
lola: sara is running 10 secs || 1263 markings, 14836 edges, 83 markings/sec, 10 secs
lola: sara is running 15 secs || 1674 markings, 21562 edges, 82 markings/sec, 15 secs
lola: sara is running 20 secs || 2084 markings, 27202 edges, 82 markings/sec, 20 secs
lola: sara is running 25 secs || 2492 markings, 33820 edges, 82 markings/sec, 25 secs
lola: sara is running 30 secs || 2902 markings, 40831 edges, 82 markings/sec, 30 secs
lola: sara is running 35 secs || 3302 markings, 47187 edges, 80 markings/sec, 35 secs
lola: sara is running 40 secs || 3705 markings, 53789 edges, 81 markings/sec, 40 secs
lola: sara is running 45 secs || 4111 markings, 60591 edges, 81 markings/sec, 45 secs
lola: sara is running 50 secs || 4522 markings, 66979 edges, 82 markings/sec, 50 secs
lola: sara is running 55 secs || 4938 markings, 73388 edges, 83 markings/sec, 55 secs
lola: sara is running 60 secs || 5351 markings, 80024 edges, 83 markings/sec, 60 secs
lola: sara is running 65 secs || 5765 markings, 87052 edges, 83 markings/sec, 65 secs
lola: sara is running 70 secs || 6178 markings, 93453 edges, 83 markings/sec, 70 secs
lola: sara is running 75 secs || 6590 markings, 100080 edges, 82 markings/sec, 75 secs
lola: sara is running 80 secs || 7005 markings, 107292 edges, 83 markings/sec, 80 secs
lola: sara is running 85 secs || 7425 markings, 113716 edges, 84 markings/sec, 85 secs
lola: sara is running 90 secs || 7848 markings, 120580 edges, 85 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 8265 markings, 127417 edges, 83 markings/sec, 95 secs
lola: sara is running 100 secs || 8680 markings, 134195 edges, 83 markings/sec, 100 secs
lola: sara is running 105 secs || 9091 markings, 140216 edges, 82 markings/sec, 105 secs
lola: sara is running 110 secs || 9507 markings, 147103 edges, 83 markings/sec, 110 secs
lola: sara is running 115 secs || 9930 markings, 154293 edges, 85 markings/sec, 115 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1373)))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-5.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((3 <= p1816) OR (p2405 <= p1055)) AND (3 <= p2661) AND ((p1979 + 1 <= p1241) OR (p2965 + 1 <= p1946)))))
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 148 bytes per marking, with 31 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 DLCshifumi-PT-6a-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 709 markings, 5149 edges, 142 markings/sec, 0 secs
lola: sara is running 5 secs || 1422 markings, 11354 edges, 143 markings/sec, 5 secs
lola: sara is running 10 secs || 2126 markings, 17760 edges, 141 markings/sec, 10 secs
lola: sara is running 15 secs || 2832 markings, 25467 edges, 141 markings/sec, 15 secs
lola: sara is running 20 secs || 3534 markings, 33258 edges, 140 markings/sec, 20 secs
lola: sara is running 25 secs || 4243 markings, 41062 edges, 142 markings/sec, 25 secs
lola: sara is running 30 secs || 4944 markings, 47913 edges, 140 markings/sec, 30 secs
lola: sara is running 35 secs || 5648 markings, 55704 edges, 141 markings/sec, 35 secs
lola: sara is running 40 secs || 6356 markings, 64474 edges, 142 markings/sec, 40 secs
lola: sara is running 45 secs || 7069 markings, 72133 edges, 143 markings/sec, 45 secs
lola: sara is running 50 secs || 7788 markings, 79727 edges, 144 markings/sec, 50 secs
lola: sara is running 55 secs || 8509 markings, 88091 edges, 144 markings/sec, 55 secs
lola: sara is running 60 secs || 9229 markings, 95162 edges, 144 markings/sec, 60 secs
lola: sara is running 65 secs || 9942 markings, 103107 edges, 143 markings/sec, 65 secs
lola: sara is running 70 secs || 10650 markings, 111048 edges, 142 markings/sec, 70 secs
lola: sara is running 75 secs || 11353 markings, 118255 edges, 141 markings/sec, 75 secs
lola: sara is running 80 secs || 12056 markings, 125986 edges, 141 markings/sec, 80 secs
lola: sara is running 85 secs || 12768 markings, 133746 edges, 142 markings/sec, 85 secs
lola: sara is running 90 secs || 13477 markings, 141493 edges, 142 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 14192 markings, 148547 edges, 143 markings/sec, 95 secs
lola: sara is running 100 secs || 14906 markings, 156700 edges, 143 markings/sec, 100 secs
lola: sara is running 105 secs || 15620 markings, 164460 edges, 143 markings/sec, 105 secs
lola: sara is running 110 secs || 16334 markings, 171513 edges, 143 markings/sec, 110 secs
lola: sara is running 115 secs || 17040 markings, 179437 edges, 141 markings/sec, 115 secs
lola: sara is running 120 secs || 17742 markings, 187358 edges, 140 markings/sec, 120 secs
lola: sara is running 125 secs || 18440 markings, 194546 edges, 140 markings/sec, 125 secs
lola: sara is running 130 secs || 19158 markings, 202326 edges, 144 markings/sec, 130 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 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1177)))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 488 markings, 4084 edges, 98 markings/sec, 0 secs
lola: sara is running 5 secs || 976 markings, 10003 edges, 98 markings/sec, 5 secs
lola: sara is running 10 secs || 1458 markings, 17086 edges, 96 markings/sec, 10 secs
lola: sara is running 15 secs || 1936 markings, 22788 edges, 96 markings/sec, 15 secs
lola: sara is running 20 secs || 2417 markings, 29901 edges, 96 markings/sec, 20 secs
lola: sara is running 25 secs || 2900 markings, 37765 edges, 97 markings/sec, 25 secs
lola: sara is running 30 secs || 3381 markings, 45396 edges, 96 markings/sec, 30 secs
lola: sara is running 35 secs || 3856 markings, 53422 edges, 95 markings/sec, 35 secs
lola: sara is running 40 secs || 4328 markings, 60690 edges, 94 markings/sec, 40 secs
lola: sara is running 45 secs || 4802 markings, 68487 edges, 95 markings/sec, 45 secs
lola: sara is running 50 secs || 5281 markings, 76532 edges, 96 markings/sec, 50 secs
lola: sara is running 55 secs || 5765 markings, 84215 edges, 97 markings/sec, 55 secs
lola: sara is running 60 secs || 6248 markings, 92079 edges, 97 markings/sec, 60 secs
lola: sara is running 65 secs || 6726 markings, 99699 edges, 96 markings/sec, 65 secs
lola: sara is running 70 secs || 7200 markings, 107724 edges, 95 markings/sec, 70 secs
lola: sara is running 75 secs || 7665 markings, 114975 edges, 93 markings/sec, 75 secs
lola: sara is running 80 secs || 8138 markings, 122765 edges, 95 markings/sec, 80 secs
lola: sara is running 85 secs || 8608 markings, 130588 edges, 94 markings/sec, 85 secs
lola: sara is running 90 secs || 9080 markings, 137856 edges, 94 markings/sec, 90 secs
lola: sara is running 95 secs || 9565 markings, 146065 edges, 97 markings/sec, 95 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 100 secs || 10042 markings, 153725 edges, 95 markings/sec, 100 secs
lola: sara is running 105 secs || 10516 markings, 161372 edges, 95 markings/sec, 105 secs
lola: sara is running 110 secs || 10990 markings, 169218 edges, 95 markings/sec, 110 secs
lola: sara is running 115 secs || 11470 markings, 176653 edges, 96 markings/sec, 115 secs
lola: sara is running 120 secs || 11954 markings, 185090 edges, 97 markings/sec, 120 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 346 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2773 <= p1569) AND (1 <= p883) AND (p221 <= p3172)) OR ((3 <= p306) AND (1 <= p595) AND ((3 <= p2418) OR (3 <= p1517))))))
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 148 bytes per marking, with 31 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 9 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-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 395 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p403 <= p1652) AND ((p1199 <= 1) OR ((p1121 <= p57) AND (3 <= p234))))))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 393 markings, 1299 edges, 79 markings/sec, 0 secs
lola: sara is running 5 secs || 790 markings, 2814 edges, 79 markings/sec, 5 secs
lola: sara is running 10 secs || 1187 markings, 4741 edges, 79 markings/sec, 10 secs
lola: sara is running 15 secs || 1603 markings, 7510 edges, 83 markings/sec, 15 secs
lola: sara is running 20 secs || 2026 markings, 9528 edges, 85 markings/sec, 20 secs
lola: sara is running 25 secs || 2440 markings, 13084 edges, 83 markings/sec, 25 secs
lola: sara is running 30 secs || 2869 markings, 15657 edges, 86 markings/sec, 30 secs
lola: sara is running 35 secs || 3274 markings, 18096 edges, 81 markings/sec, 35 secs
lola: sara is running 40 secs || 3661 markings, 20112 edges, 77 markings/sec, 40 secs
lola: sara is running 45 secs || 4079 markings, 22446 edges, 84 markings/sec, 45 secs
lola: sara is running 50 secs || 4491 markings, 25942 edges, 82 markings/sec, 50 secs
lola: sara is running 55 secs || 4886 markings, 28560 edges, 79 markings/sec, 55 secs
lola: sara is running 60 secs || 5291 markings, 30537 edges, 81 markings/sec, 60 secs
lola: sara is running 65 secs || 5688 markings, 32502 edges, 79 markings/sec, 65 secs
lola: sara is running 70 secs || 6107 markings, 34670 edges, 84 markings/sec, 70 secs
lola: sara is running 75 secs || 6532 markings, 37409 edges, 85 markings/sec, 75 secs
lola: sara is running 80 secs || 6954 markings, 39880 edges, 84 markings/sec, 80 secs
lola: sara is running 85 secs || 7374 markings, 42117 edges, 84 markings/sec, 85 secs
lola: sara is running 90 secs || 7795 markings, 44228 edges, 84 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 8204 markings, 45806 edges, 82 markings/sec, 95 secs
lola: sara is running 100 secs || 8622 markings, 48758 edges, 84 markings/sec, 100 secs
lola: sara is running 105 secs || 9053 markings, 51183 edges, 86 markings/sec, 105 secs
lola: sara is running 110 secs || 9479 markings, 53502 edges, 85 markings/sec, 110 secs
lola: sara is running 115 secs || 9889 markings, 56397 edges, 82 markings/sec, 115 secs
lola: sara is running 120 secs || 10312 markings, 59159 edges, 85 markings/sec, 120 secs
lola: sara is running 125 secs || 10737 markings, 61826 edges, 85 markings/sec, 125 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 10 will run for 439 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((2 <= p474) AND (p1842 <= 2)) OR (3 <= p2936))))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 761 markings, 5738 edges, 152 markings/sec, 0 secs
lola: sara is running 5 secs || 1510 markings, 13047 edges, 150 markings/sec, 5 secs
lola: sara is running 10 secs || 2248 markings, 21941 edges, 148 markings/sec, 10 secs
lola: sara is running 15 secs || 2975 markings, 28907 edges, 145 markings/sec, 15 secs
lola: sara is running 20 secs || 3711 markings, 38638 edges, 147 markings/sec, 20 secs
lola: sara is running 25 secs || 4446 markings, 47794 edges, 147 markings/sec, 25 secs
lola: sara is running 30 secs || 5181 markings, 56760 edges, 147 markings/sec, 30 secs
lola: sara is running 35 secs || 5919 markings, 65740 edges, 148 markings/sec, 35 secs
lola: sara is running 40 secs || 6658 markings, 74169 edges, 148 markings/sec, 40 secs
lola: sara is running 45 secs || 7393 markings, 83713 edges, 147 markings/sec, 45 secs
lola: sara is running 50 secs || 8129 markings, 93256 edges, 147 markings/sec, 50 secs
lola: sara is running 55 secs || 8869 markings, 102429 edges, 148 markings/sec, 55 secs
lola: sara is running 60 secs || 9608 markings, 110851 edges, 148 markings/sec, 60 secs
lola: sara is running 65 secs || 10331 markings, 119591 edges, 145 markings/sec, 65 secs
lola: sara is running 70 secs || 11029 markings, 128594 edges, 140 markings/sec, 70 secs
lola: sara is running 75 secs || 11722 markings, 136815 edges, 139 markings/sec, 75 secs
lola: sara is running 80 secs || 12423 markings, 145833 edges, 140 markings/sec, 80 secs
lola: sara is running 85 secs || 13127 markings, 154864 edges, 141 markings/sec, 85 secs
lola: sara is running 90 secs || 13823 markings, 163099 edges, 139 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 14541 markings, 171249 edges, 144 markings/sec, 95 secs
lola: sara is running 100 secs || 15292 markings, 181045 edges, 150 markings/sec, 100 secs
lola: sara is running 105 secs || 16015 markings, 189773 edges, 145 markings/sec, 105 secs
lola: sara is running 110 secs || 16745 markings, 199101 edges, 146 markings/sec, 110 secs
lola: sara is running 115 secs || 17494 markings, 208123 edges, 150 markings/sec, 115 secs
lola: sara is running 120 secs || 18249 markings, 217001 edges, 151 markings/sec, 120 secs
lola: sara is running 125 secs || 19013 markings, 226290 edges, 153 markings/sec, 125 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 500 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3411 <= 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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 625 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p560)))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-6a-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 569 markings, 4957 edges, 114 markings/sec, 0 secs
lola: sara is running 5 secs || 1128 markings, 12018 edges, 112 markings/sec, 5 secs
lola: sara is running 10 secs || 1679 markings, 19859 edges, 110 markings/sec, 10 secs
lola: sara is running 15 secs || 2226 markings, 26073 edges, 109 markings/sec, 15 secs
lola: sara is running 20 secs || 2781 markings, 34528 edges, 111 markings/sec, 20 secs
lola: sara is running 25 secs || 3334 markings, 43540 edges, 111 markings/sec, 25 secs
lola: sara is running 30 secs || 3882 markings, 51583 edges, 110 markings/sec, 30 secs
lola: sara is running 35 secs || 4422 markings, 60487 edges, 108 markings/sec, 35 secs
lola: sara is running 40 secs || 4964 markings, 68891 edges, 108 markings/sec, 40 secs
lola: sara is running 45 secs || 5512 markings, 77882 edges, 110 markings/sec, 45 secs
lola: sara is running 50 secs || 6068 markings, 85960 edges, 111 markings/sec, 50 secs
lola: sara is running 55 secs || 6625 markings, 95178 edges, 111 markings/sec, 55 secs
lola: sara is running 60 secs || 7182 markings, 103773 edges, 111 markings/sec, 60 secs
lola: sara is running 65 secs || 7732 markings, 112586 edges, 110 markings/sec, 65 secs
lola: sara is running 70 secs || 8275 markings, 121176 edges, 109 markings/sec, 70 secs
lola: sara is running 75 secs || 8815 markings, 129566 edges, 108 markings/sec, 75 secs
lola: sara is running 80 secs || 9361 markings, 138124 edges, 109 markings/sec, 80 secs
lola: sara is running 85 secs || 9909 markings, 146920 edges, 110 markings/sec, 85 secs
lola: sara is running 90 secs || 10462 markings, 155932 edges, 111 markings/sec, 90 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 95 secs || 11012 markings, 163984 edges, 110 markings/sec, 95 secs
lola: sara is running 100 secs || 11559 markings, 172966 edges, 109 markings/sec, 100 secs
lola: sara is running 105 secs || 12098 markings, 181311 edges, 108 markings/sec, 105 secs
lola: sara is running 110 secs || 12646 markings, 190300 edges, 110 markings/sec, 110 secs
lola: sara is running 115 secs || 13199 markings, 198550 edges, 111 markings/sec, 115 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 793 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1447) OR (p2716 <= p3115) OR (p1486 + 1 <= p3224) OR (((p1051 <= p1016) OR (p1120 <= p2244)) AND (2 <= p1223)))))
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 148 bytes per marking, with 31 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 9 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-13.sara
lola: ========================================
lola: subprocess 14 will run for 1189 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3066 <= 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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 15 will run for 2379 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1954 <= p1481) OR (p504 <= 0) OR ((p3450 <= 0) AND (p935 + 1 <= p1906)))))
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 148 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-6a-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no no no no no no no yes yes no yes no yes yes yes
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-6a-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496473576066
--------------------
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_DLCshifumi-PT-6a"
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_DLCshifumi-PT-6a.tgz
mv S_DLCshifumi-PT-6a execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_DLCshifumi-PT-6a, 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 r098-ebro-149488456000520"
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 '
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 ;