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 AutoFlight-PT-48b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r008-csrt-149436126100268
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494604110747


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ AutoFlight-PT-48b @ 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: 7886/65536 symbol table entries, 1706 collisions
lola: preprocessing...
lola: finding significant places
lola: 3950 places, 3936 transitions, 3692 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 4350 transition conflict sets
lola: TASK
lola: reading formula from AutoFlight-PT-48b-ReachabilityCardinality.task
lola: E (F (((p582 <= 2) AND (p3723 + 1 <= p1346) AND (p3183 + 1 <= p2505)))) : E (F (((p3014 + 1 <= p304) AND (p2071 <= 1) AND (p1238 + 1 <= p701) AND (p3628 + 1 <= p671)))) : E (F (((1 <= p3515) AND (2 <= p2620)))) : E (F ((((p3223 + 1 <= p608) OR (p1915 + 1 <= p1499)) AND ((1 <= p3623) OR (p2815 <= p641))))) : E (F (((2 <= p146) AND (3 <= p1195)))) : A (G ((p1653 <= 2))) : A (G ((p1057 <= 1))) : E (F (((3 <= p2083) OR ((p3355 + 1 <= p918) AND (p3021 <= 1))))) : A (G (((p209 <= 2) OR (p914 + 1 <= p443) OR (2 <= p490)))) : E (F (((p3158 <= p992) AND (2 <= p1861)))) : E (F (((2 <= p1159) AND (p3613 <= p1098) AND (p3763 <= p1098) AND (3 <= p3449)))) : A (G (((p611 <= p391) OR (p3807 <= 2)))) : E (F (((1 <= p320) OR (2 <= p1457)))) : E (F (((p1170 <= p3738) AND (3 <= p1989)))) : A (G (((p1812 + 1 <= p2212) OR (p2685 <= 2) OR (1 <= p767)))) : A (G (((p1378 <= p253) OR (2 <= p112))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p582 <= 2) AND (p3723 + 1 <= p1346) AND (p3183 + 1 <= p2505))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 116625 markings, 295787 edges, 23325 markings/sec, 0 secs
lola: sara is running 5 secs || 215767 markings, 615527 edges, 19828 markings/sec, 5 secs
lola: sara is running 10 secs || 320799 markings, 956749 edges, 21006 markings/sec, 10 secs
lola: sara is running 15 secs || 428379 markings, 1307264 edges, 21516 markings/sec, 15 secs
lola: sara is running 20 secs || 522908 markings, 1662576 edges, 18906 markings/sec, 20 secs
lola: sara is running 25 secs || 618022 markings, 2020736 edges, 19023 markings/sec, 25 secs
lola: sara is running 30 secs || 714246 markings, 2369183 edges, 19245 markings/sec, 30 secs
lola: sara is running 35 secs || 811659 markings, 2708340 edges, 19483 markings/sec, 35 secs
lola: sara is running 40 secs || 902735 markings, 3055941 edges, 18215 markings/sec, 40 secs
lola: sara is running 45 secs || 992954 markings, 3399912 edges, 18044 markings/sec, 45 secs
lola: sara is running 50 secs || 1091695 markings, 3741352 edges, 19748 markings/sec, 50 secs
lola: sara is running 55 secs || 1188080 markings, 4098127 edges, 19277 markings/sec, 55 secs
lola: sara is running 60 secs || 1279248 markings, 4447666 edges, 18234 markings/sec, 60 secs
lola: sara is running 65 secs || 1372408 markings, 4793416 edges, 18632 markings/sec, 65 secs
lola: sara is running 70 secs || 1474998 markings, 5133857 edges, 20518 markings/sec, 70 secs
lola: sara is running 75 secs || 1565898 markings, 5481410 edges, 18180 markings/sec, 75 secs
lola: sara is running 80 secs || 1654778 markings, 5821300 edges, 17776 markings/sec, 80 secs
lola: sara is running 85 secs || 1744858 markings, 6166136 edges, 18016 markings/sec, 85 secs
lola: sara is running 90 secs || 1830750 markings, 6518723 edges, 17178 markings/sec, 90 secs
lola: sara is running 95 secs || 1912180 markings, 6875887 edges, 16286 markings/sec, 95 secs
lola: sara is running 100 secs || 1994871 markings, 7239210 edges, 16538 markings/sec, 100 secs
lola: sara is running 105 secs || 2078327 markings, 7584750 edges, 16691 markings/sec, 105 secs
lola: sara is running 110 secs || 2163028 markings, 7929035 edges, 16940 markings/sec, 110 secs
lola: sara is running 115 secs || 2243306 markings, 8280721 edges, 16056 markings/sec, 115 secs
lola: sara is running 120 secs || 2323587 markings, 8632374 edges, 16056 markings/sec, 120 secs
lola: sara is running 125 secs || 2407621 markings, 8985724 edges, 16807 markings/sec, 125 secs
lola: sara is running 130 secs || 2494593 markings, 9335687 edges, 17394 markings/sec, 130 secs
lola: sara is running 135 secs || 2574656 markings, 9687271 edges, 16013 markings/sec, 135 secs
lola: sara is running 140 secs || 2654254 markings, 10038912 edges, 15920 markings/sec, 140 secs
lola: sara is running 145 secs || 2737596 markings, 10383066 edges, 16668 markings/sec, 145 secs
lola: sara is running 150 secs || 2832321 markings, 10704269 edges, 18945 markings/sec, 150 secs
lola: sara is running 155 secs || 2924430 markings, 11057710 edges, 18422 markings/sec, 155 secs
lola: sara is running 160 secs || 3017175 markings, 11411688 edges, 18549 markings/sec, 160 secs
lola: sara is running 165 secs || 3110053 markings, 11766652 edges, 18576 markings/sec, 165 secs
lola: sara is running 170 secs || 3197759 markings, 12135065 edges, 17541 markings/sec, 170 secs
lola: sara is running 175 secs || 3281710 markings, 12504062 edges, 16790 markings/sec, 175 secs
lola: sara is running 180 secs || 3365973 markings, 12874660 edges, 16853 markings/sec, 180 secs
lola: sara is running 185 secs || 3456135 markings, 13236869 edges, 18032 markings/sec, 185 secs
lola: sara is running 190 secs || 3541864 markings, 13600797 edges, 17146 markings/sec, 190 secs
lola: sara is running 195 secs || 3626496 markings, 13973149 edges, 16926 markings/sec, 195 secs
lola: sara is running 200 secs || 3710837 markings, 14344061 edges, 16868 markings/sec, 200 secs
lola: sara is running 205 secs || 3800115 markings, 14696558 edges, 17856 markings/sec, 205 secs
lola: sara is running 210 secs || 3885693 markings, 15062444 edges, 17116 markings/sec, 210 secs
lola: sara is running 215 secs || 3969948 markings, 15433171 edges, 16851 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3014 + 1 <= p304) AND (p2071 <= 1) AND (p1238 + 1 <= p701) AND (p3628 + 1 <= p671))))
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 464 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 88516 markings, 259222 edges, 17703 markings/sec, 0 secs
lola: sara is running 5 secs || 161193 markings, 545773 edges, 14535 markings/sec, 5 secs
lola: sara is running 10 secs || 229816 markings, 816406 edges, 13725 markings/sec, 10 secs
lola: sara is running 15 secs || 300877 markings, 1096992 edges, 14212 markings/sec, 15 secs
lola: sara is running 20 secs || 368597 markings, 1380815 edges, 13544 markings/sec, 20 secs
lola: sara is running 25 secs || 425880 markings, 1649699 edges, 11457 markings/sec, 25 secs
lola: sara is running 30 secs || 485326 markings, 1929922 edges, 11889 markings/sec, 30 secs
lola: sara is running 35 secs || 543707 markings, 2203198 edges, 11676 markings/sec, 35 secs
lola: sara is running 40 secs || 609658 markings, 2512953 edges, 13190 markings/sec, 40 secs
lola: sara is running 45 secs || 677235 markings, 2830470 edges, 13515 markings/sec, 45 secs
lola: sara is running 50 secs || 742209 markings, 3133860 edges, 12995 markings/sec, 50 secs
lola: sara is running 55 secs || 804903 markings, 3427909 edges, 12539 markings/sec, 55 secs
lola: sara is running 60 secs || 865571 markings, 3713108 edges, 12134 markings/sec, 60 secs
lola: sara is running 65 secs || 928876 markings, 4010651 edges, 12661 markings/sec, 65 secs
lola: sara is running 70 secs || 992202 markings, 4307964 edges, 12665 markings/sec, 70 secs
lola: sara is running 75 secs || 1055332 markings, 4602579 edges, 12626 markings/sec, 75 secs
lola: sara is running 80 secs || 1114143 markings, 4878793 edges, 11762 markings/sec, 80 secs
lola: sara is running 85 secs || 1175443 markings, 5166577 edges, 12260 markings/sec, 85 secs
lola: sara is running 90 secs || 1237113 markings, 5456431 edges, 12334 markings/sec, 90 secs
lola: sara is running 95 secs || 1299480 markings, 5750116 edges, 12473 markings/sec, 95 secs
lola: sara is running 100 secs || 1361921 markings, 6042581 edges, 12488 markings/sec, 100 secs
lola: sara is running 105 secs || 1422383 markings, 6356024 edges, 12092 markings/sec, 105 secs
lola: sara is running 110 secs || 1474833 markings, 6641551 edges, 10490 markings/sec, 110 secs
lola: sara is running 115 secs || 1526842 markings, 6924789 edges, 10402 markings/sec, 115 secs
lola: sara is running 120 secs || 1579887 markings, 7213721 edges, 10609 markings/sec, 120 secs
lola: sara is running 125 secs || 1634153 markings, 7510890 edges, 10853 markings/sec, 125 secs
lola: sara is running 130 secs || 1688705 markings, 7809366 edges, 10910 markings/sec, 130 secs
lola: sara is running 135 secs || 1744127 markings, 8112608 edges, 11084 markings/sec, 135 secs
lola: sara is running 140 secs || 1800103 markings, 8414842 edges, 11195 markings/sec, 140 secs
lola: sara is running 145 secs || 1854547 markings, 8710872 edges, 10889 markings/sec, 145 secs
lola: sara is running 150 secs || 1910179 markings, 9013292 edges, 11126 markings/sec, 150 secs
lola: sara is running 155 secs || 1966351 markings, 9319326 edges, 11234 markings/sec, 155 secs
lola: sara is running 160 secs || 2020286 markings, 9614126 edges, 10787 markings/sec, 160 secs
lola: sara is running 165 secs || 2074420 markings, 9910199 edges, 10827 markings/sec, 165 secs
lola: sara is running 170 secs || 2128793 markings, 10207603 edges, 10875 markings/sec, 170 secs
lola: sara is running 175 secs || 2184129 markings, 10507406 edges, 11067 markings/sec, 175 secs
lola: sara is running 180 secs || 2242091 markings, 10821167 edges, 11592 markings/sec, 180 secs
lola: sara is running 185 secs || 2298589 markings, 11128340 edges, 11300 markings/sec, 185 secs
lola: sara is running 190 secs || 2353873 markings, 11431226 edges, 11057 markings/sec, 190 secs
lola: sara is running 195 secs || 2409355 markings, 11735746 edges, 11096 markings/sec, 195 secs
lola: sara is running 200 secs || 2465589 markings, 12039719 edges, 11247 markings/sec, 200 secs
lola: sara is running 205 secs || 2521989 markings, 12346360 edges, 11280 markings/sec, 205 secs
lola: sara is running 210 secs || 2579545 markings, 12658770 edges, 11511 markings/sec, 210 secs
lola: sara is running 215 secs || 2638584 markings, 12984494 edges, 11808 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p3515) AND (2 <= p2620))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p3223 + 1 <= p608) OR (p1915 + 1 <= p1499)) AND ((1 <= p3623) OR (p2815 <= p641)))))
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 464 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 8 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 93564 markings, 266936 edges, 18713 markings/sec, 0 secs
lola: sara is running 5 secs || 182882 markings, 552579 edges, 17864 markings/sec, 5 secs

lola: sara is running 10 secs || 267529 markings, 866678 edges, 16929 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 256 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p146) AND (3 <= p1195))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-4.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1653 <= 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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 93592 markings, 266970 edges, 18718 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 307 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1057 <= 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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 86113 markings, 207614 edges, 17223 markings/sec, 0 secs

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 340 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p2083) OR ((p3355 + 1 <= p918) AND (p3021 <= 1)))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 383 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p209 <= 2) OR (p914 + 1 <= p443) OR (2 <= p490))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 86214 markings, 254358 edges, 17243 markings/sec, 0 secs

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 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3158 <= p992) AND (2 <= p1861))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 92236 markings, 262150 edges, 18447 markings/sec, 0 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 509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1159) AND (p3613 <= p1098) AND (p3763 <= p1098) AND (3 <= p3449))))
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 464 bytes per marking, with 20 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to AutoFlight-PT-48b-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 152219 markings, 298730 edges, 30444 markings/sec, 0 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 609 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p611 <= p391) OR (p3807 <= 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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 265393 markings, 338466 edges, 53079 markings/sec, 0 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 760 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p320) OR (2 <= p1457))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-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 1013 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1170 <= p3738) AND (3 <= p1989))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 87988 markings, 247095 edges, 17598 markings/sec, 0 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 1517 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1812 + 1 <= p2212) OR (p2685 <= 2) OR (1 <= p767))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 161409 markings, 271293 edges, 32282 markings/sec, 0 secs
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 15 will run for 3026 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1378 <= p253) OR (2 <= p112))))
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 464 bytes per marking, with 20 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 AutoFlight-PT-48b-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: RESULT
lola:
SUMMARY: unknown unknown no yes no yes yes yes yes no no yes yes no yes no
lola: ========================================
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA AutoFlight-PT-48b-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494604625043

--------------------
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="AutoFlight-PT-48b"
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/AutoFlight-PT-48b.tgz
mv AutoFlight-PT-48b 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 AutoFlight-PT-48b, 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 r008-csrt-149436126100268"
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 ;