About the Execution of LoLA for S_AutoFlight-PT-48b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2732.920 | 517328.00 | 1035444.00 | 35.00 | ??FTTFTFFTFTTTTF | 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-3254
Executing tool lola
Input is S_AutoFlight-PT-48b, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-csrt-149441074200268
=====================================================================
--------------------
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 1496338885666
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_AutoFlight-PT-48b: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_AutoFlight-PT-48b: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_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 || 110989 markings, 279227 edges, 22198 markings/sec, 0 secs
lola: sara is running 5 secs || 209930 markings, 594884 edges, 19788 markings/sec, 5 secs
lola: sara is running 10 secs || 315362 markings, 937609 edges, 21086 markings/sec, 10 secs
lola: sara is running 15 secs || 420253 markings, 1278538 edges, 20978 markings/sec, 15 secs
lola: sara is running 20 secs || 512087 markings, 1622023 edges, 18367 markings/sec, 20 secs
lola: sara is running 25 secs || 595646 markings, 1939968 edges, 16712 markings/sec, 25 secs
lola: sara is running 30 secs || 680907 markings, 2265252 edges, 17052 markings/sec, 30 secs
lola: sara is running 35 secs || 783946 markings, 2604534 edges, 20608 markings/sec, 35 secs
lola: sara is running 40 secs || 871813 markings, 2938100 edges, 17573 markings/sec, 40 secs
lola: sara is running 45 secs || 958911 markings, 3269230 edges, 17420 markings/sec, 45 secs
lola: sara is running 50 secs || 1048217 markings, 3595984 edges, 17861 markings/sec, 50 secs
lola: sara is running 55 secs || 1141859 markings, 3914755 edges, 18728 markings/sec, 55 secs
lola: sara is running 60 secs || 1228580 markings, 4245897 edges, 17344 markings/sec, 60 secs
lola: sara is running 65 secs || 1317227 markings, 4585034 edges, 17729 markings/sec, 65 secs
lola: sara is running 70 secs || 1413777 markings, 4924531 edges, 19310 markings/sec, 70 secs
lola: sara is running 75 secs || 1509426 markings, 5270941 edges, 19130 markings/sec, 75 secs
lola: sara is running 80 secs || 1592910 markings, 5589103 edges, 16697 markings/sec, 80 secs
lola: sara is running 85 secs || 1675793 markings, 5904324 edges, 16577 markings/sec, 85 secs
lola: sara is running 90 secs || 1762682 markings, 6235896 edges, 17378 markings/sec, 90 secs
lola: sara is running 95 secs || 1843754 markings, 6576707 edges, 16214 markings/sec, 95 secs
lola: sara is running 100 secs || 1922557 markings, 6921407 edges, 15761 markings/sec, 100 secs
lola: sara is running 105 secs || 2000862 markings, 7266300 edges, 15661 markings/sec, 105 secs
lola: sara is running 110 secs || 2083187 markings, 7604669 edges, 16465 markings/sec, 110 secs
lola: sara is running 115 secs || 2166138 markings, 7943462 edges, 16590 markings/sec, 115 secs
lola: sara is running 120 secs || 2249327 markings, 8308871 edges, 16638 markings/sec, 120 secs
lola: sara is running 125 secs || 2332201 markings, 8673354 edges, 16575 markings/sec, 125 secs
lola: sara is running 130 secs || 2418642 markings, 9030964 edges, 17288 markings/sec, 130 secs
lola: sara is running 135 secs || 2504811 markings, 9383660 edges, 17234 markings/sec, 135 secs
lola: sara is running 140 secs || 2587289 markings, 9745644 edges, 16496 markings/sec, 140 secs
lola: sara is running 145 secs || 2670065 markings, 10109540 edges, 16555 markings/sec, 145 secs
lola: sara is running 150 secs || 2760626 markings, 10460086 edges, 18112 markings/sec, 150 secs
lola: sara is running 155 secs || 2856145 markings, 10799220 edges, 19104 markings/sec, 155 secs
lola: sara is running 160 secs || 2947224 markings, 11147795 edges, 18216 markings/sec, 160 secs
lola: sara is running 165 secs || 3038296 markings, 11495249 edges, 18214 markings/sec, 165 secs
lola: sara is running 170 secs || 3129449 markings, 11843269 edges, 18231 markings/sec, 170 secs
lola: sara is running 175 secs || 3212655 markings, 12201848 edges, 16641 markings/sec, 175 secs
lola: sara is running 180 secs || 3294816 markings, 12562745 edges, 16432 markings/sec, 180 secs
lola: sara is running 185 secs || 3376874 markings, 12924007 edges, 16412 markings/sec, 185 secs
lola: sara is running 190 secs || 3466567 markings, 13276607 edges, 17939 markings/sec, 190 secs
lola: sara is running 195 secs || 3550588 markings, 13638258 edges, 16804 markings/sec, 195 secs
lola: sara is running 200 secs || 3633350 markings, 14001987 edges, 16552 markings/sec, 200 secs
lola: sara is running 205 secs || 3715948 markings, 14365672 edges, 16520 markings/sec, 205 secs
lola: sara is running 210 secs || 3805135 markings, 14716073 edges, 17837 markings/sec, 210 secs
lola: sara is running 215 secs || 3888635 markings, 15075527 edges, 16700 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 || 95719 markings, 287363 edges, 19144 markings/sec, 0 secs
lola: sara is running 5 secs || 175768 markings, 603230 edges, 16010 markings/sec, 5 secs
lola: sara is running 10 secs || 245341 markings, 877623 edges, 13915 markings/sec, 10 secs
lola: sara is running 15 secs || 320877 markings, 1175684 edges, 15107 markings/sec, 15 secs
lola: sara is running 20 secs || 385884 markings, 1461999 edges, 13001 markings/sec, 20 secs
lola: sara is running 25 secs || 443778 markings, 1733698 edges, 11579 markings/sec, 25 secs
lola: sara is running 30 secs || 503560 markings, 2014842 edges, 11956 markings/sec, 30 secs
lola: sara is running 35 secs || 565163 markings, 2304109 edges, 12321 markings/sec, 35 secs
lola: sara is running 40 secs || 628798 markings, 2602766 edges, 12727 markings/sec, 40 secs
lola: sara is running 45 secs || 695973 markings, 2916465 edges, 13435 markings/sec, 45 secs
lola: sara is running 50 secs || 755608 markings, 3196648 edges, 11927 markings/sec, 50 secs
lola: sara is running 55 secs || 814956 markings, 3475708 edges, 11870 markings/sec, 55 secs
lola: sara is running 60 secs || 875829 markings, 3761220 edges, 12175 markings/sec, 60 secs
lola: sara is running 65 secs || 937425 markings, 4050702 edges, 12319 markings/sec, 65 secs
lola: sara is running 70 secs || 1002250 markings, 4354729 edges, 12965 markings/sec, 70 secs
lola: sara is running 75 secs || 1065316 markings, 4649188 edges, 12613 markings/sec, 75 secs
lola: sara is running 80 secs || 1125842 markings, 4933649 edges, 12105 markings/sec, 80 secs
lola: sara is running 85 secs || 1188996 markings, 5230485 edges, 12631 markings/sec, 85 secs
lola: sara is running 90 secs || 1250923 markings, 5521729 edges, 12385 markings/sec, 90 secs
lola: sara is running 95 secs || 1314757 markings, 5820825 edges, 12767 markings/sec, 95 secs
lola: sara is running 100 secs || 1381558 markings, 6134578 edges, 13360 markings/sec, 100 secs
lola: sara is running 105 secs || 1440706 markings, 6456674 edges, 11830 markings/sec, 105 secs
lola: sara is running 110 secs || 1495306 markings, 6755471 edges, 10920 markings/sec, 110 secs
lola: sara is running 115 secs || 1547147 markings, 7037069 edges, 10368 markings/sec, 115 secs
lola: sara is running 120 secs || 1599930 markings, 7324725 edges, 10557 markings/sec, 120 secs
lola: sara is running 125 secs || 1652890 markings, 7613579 edges, 10592 markings/sec, 125 secs
lola: sara is running 130 secs || 1705672 markings, 7901194 edges, 10556 markings/sec, 130 secs
lola: sara is running 135 secs || 1760506 markings, 8201568 edges, 10967 markings/sec, 135 secs
lola: sara is running 140 secs || 1817078 markings, 8507289 edges, 11314 markings/sec, 140 secs
lola: sara is running 145 secs || 1872744 markings, 8809914 edges, 11133 markings/sec, 145 secs
lola: sara is running 150 secs || 1928080 markings, 9110670 edges, 11067 markings/sec, 150 secs
lola: sara is running 155 secs || 1982430 markings, 9406259 edges, 10870 markings/sec, 155 secs
lola: sara is running 160 secs || 2035990 markings, 9698093 edges, 10712 markings/sec, 160 secs
lola: sara is running 165 secs || 2089818 markings, 9992457 edges, 10766 markings/sec, 165 secs
lola: sara is running 170 secs || 2144083 markings, 10289147 edges, 10853 markings/sec, 170 secs
lola: sara is running 175 secs || 2203543 markings, 10612340 edges, 11892 markings/sec, 175 secs
lola: sara is running 180 secs || 2262395 markings, 10931205 edges, 11770 markings/sec, 180 secs
lola: sara is running 185 secs || 2320692 markings, 11252063 edges, 11659 markings/sec, 185 secs
lola: sara is running 190 secs || 2378664 markings, 11566145 edges, 11594 markings/sec, 190 secs
lola: sara is running 195 secs || 2439102 markings, 11893751 edges, 12088 markings/sec, 195 secs
lola: sara is running 200 secs || 2497003 markings, 12213094 edges, 11580 markings/sec, 200 secs
lola: sara is running 205 secs || 2558754 markings, 12546084 edges, 12350 markings/sec, 205 secs
lola: sara is running 210 secs || 2619139 markings, 12877755 edges, 12077 markings/sec, 210 secs
lola: sara is running 215 secs || 2678650 markings, 13199648 edges, 11902 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: 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: 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 || 91577 markings, 259906 edges, 18315 markings/sec, 0 secs
lola: sara is running 5 secs || 172883 markings, 528170 edges, 16261 markings/sec, 5 secs
lola: sara is running 10 secs || 250013 markings, 808701 edges, 15426 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: state equation: calling and running sara
sara: try reading problem file AutoFlight-PT-48b-ReachabilityCardinality-4.sara.
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 || 91021 markings, 257675 edges, 18204 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 || 88407 markings, 213340 edges, 17681 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.
lola: sara is running 0 secs || 81621 markings, 237871 edges, 16324 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 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 || 91505 markings, 259617 edges, 18301 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 508 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 || 148753 markings, 289747 edges, 29751 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 || 259201 markings, 330445 edges, 51840 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 759 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 1012 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 || 90041 markings, 254609 edges, 18008 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 1515 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 || 167944 markings, 283917 edges, 33589 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 3023 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
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 1496339402994
--------------------
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_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/S_AutoFlight-PT-48b.tgz
mv S_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 S_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 r088-csrt-149441074200268"
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 ;