fond

jQuery Multi Level CSS Menu Css3Menu.com

Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r018-ebro-149436309200333
Last Updated
June 27, 2017

About the Execution of LoLA for DES-PT-50b

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2835.800 608596.00 1219298.00 172.60 FFFFTTFTTT?TFTFT 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 DES-PT-50b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309200333
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494633080672


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ DES-PT-50b @ 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: 909/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 479 places, 430 transitions, 414 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 527 transition conflict sets
lola: TASK
lola: reading formula from DES-PT-50b-ReachabilityFireability.task
lola: A (G (((NOT FIREABLE(t263) OR NOT FIREABLE(t340)) AND (NOT FIREABLE(t18) OR NOT FIREABLE(t409)) AND NOT FIREABLE(t239)))) : E (F ((FIREABLE(t36) AND FIREABLE(t406) AND NOT FIREABLE(t429) AND FIREABLE(t333) AND FIREABLE(t131) AND NOT FIREABLE(t91) AND FIREABLE(t5)))) : E (F (FIREABLE(t0))) : E (F (FIREABLE(t91))) : A (G ((NOT FIREABLE(t336) OR NOT FIREABLE(t287) OR ((FIREABLE(t284) OR NOT FIREABLE(t195)) AND FIREABLE(t134))))) : E (F (FIREABLE(t228))) : A (G ((NOT FIREABLE(t269) OR (FIREABLE(t14) AND FIREABLE(t359)) OR ((FIREABLE(t181) OR FIREABLE(t83)) AND (FIREABLE(t193) OR FIREABLE(t141))) OR FIREABLE(t380) OR (FIREABLE(t272) AND FIREABLE(t233) AND FIREABLE(t73))))) : E (F ((FIREABLE(t147) AND FIREABLE(t348)))) : E (F ((FIREABLE(t212) AND FIREABLE(t341) AND FIREABLE(t273) AND FIREABLE(t27)))) : E (F (((NOT FIREABLE(t78) OR NOT FIREABLE(t344)) AND NOT FIREABLE(t170) AND FIREABLE(t10)))) : A (G (NOT FIREABLE(t306))) : A (G ((FIREABLE(t99) OR (NOT FIREABLE(t295) AND NOT FIREABLE(t51)) OR (FIREABLE(t126) AND FIREABLE(t26) AND NOT FIREABLE(t358) AND (FIREABLE(t192) OR FIREABLE(t99) OR FIREABLE(t311)))))) : E (F ((FIREABLE(t331) OR FIREABLE(t254)))) : E (F (FIREABLE(t347))) : A (G (NOT FIREABLE(t410))) : E (F (FIREABLE(t295)))
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 (((NOT FIREABLE(t263) OR NOT FIREABLE(t340)) AND (NOT FIREABLE(t18) OR NOT FIREABLE(t409)) AND NOT FIREABLE(t239))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 681047 markings, 1000287 edges, 136209 markings/sec, 0 secs
lola: sara is running 5 secs || 1226915 markings, 2114225 edges, 109174 markings/sec, 5 secs
lola: sara is running 10 secs || 1750611 markings, 3205047 edges, 104739 markings/sec, 10 secs
lola: sara is running 15 secs || 2338885 markings, 4424038 edges, 117655 markings/sec, 15 secs
lola: sara is running 20 secs || 2892078 markings, 5541553 edges, 110639 markings/sec, 20 secs
lola: sara is running 25 secs || 3421718 markings, 6616805 edges, 105928 markings/sec, 25 secs
lola: sara is running 30 secs || 3971302 markings, 7788544 edges, 109917 markings/sec, 30 secs
lola: sara is running 35 secs || 4553753 markings, 8957196 edges, 116490 markings/sec, 35 secs
lola: sara is running 40 secs || 5095712 markings, 10065185 edges, 108392 markings/sec, 40 secs
lola: sara is running 45 secs || 5621301 markings, 11161969 edges, 105118 markings/sec, 45 secs
lola: sara is running 50 secs || 6213548 markings, 12382130 edges, 118449 markings/sec, 50 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t36) AND FIREABLE(t406) AND NOT FIREABLE(t429) AND FIREABLE(t333) AND FIREABLE(t131) AND NOT FIREABLE(t91) AND FIREABLE(t5))))
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 52 bytes per marking, with 2 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 60 literals and 6 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is unreachable.
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability.sara
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t0)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 823569 markings, 974478 edges, 164714 markings/sec, 0 secs
lola: sara is running 5 secs || 1645334 markings, 2008687 edges, 164353 markings/sec, 5 secs
lola: sara is running 10 secs || 2459721 markings, 3026169 edges, 162877 markings/sec, 10 secs
lola: sara is running 15 secs || 3251433 markings, 4037186 edges, 158342 markings/sec, 15 secs
lola: sara is running 20 secs || 4062918 markings, 5037307 edges, 162297 markings/sec, 20 secs
lola: sara is running 25 secs || 4856520 markings, 6032682 edges, 158720 markings/sec, 25 secs
lola: sara is running 30 secs || 5647486 markings, 7026301 edges, 158193 markings/sec, 30 secs
lola: sara is running 35 secs || 6438029 markings, 8018391 edges, 158109 markings/sec, 35 secs
lola: sara is running 40 secs || 7228281 markings, 9022315 edges, 158050 markings/sec, 40 secs
lola: sara is running 45 secs || 8030066 markings, 10013009 edges, 160357 markings/sec, 45 secs
lola: sara is running 50 secs || 8821656 markings, 11006056 edges, 158318 markings/sec, 50 secs
lola: sara is running 55 secs || 9599396 markings, 11984609 edges, 155548 markings/sec, 55 secs
lola: sara is running 60 secs || 10387850 markings, 12970322 edges, 157691 markings/sec, 60 secs
lola: sara is running 65 secs || 11165026 markings, 13958476 edges, 155435 markings/sec, 65 secs
lola: sara is running 70 secs || 11961428 markings, 14948722 edges, 159280 markings/sec, 70 secs
lola: sara is running 75 secs || 12753526 markings, 15936371 edges, 158420 markings/sec, 75 secs
lola: sara is running 80 secs || 13540927 markings, 16929063 edges, 157480 markings/sec, 80 secs
lola: sara is running 85 secs || 14327773 markings, 17910811 edges, 157369 markings/sec, 85 secs
lola: sara is running 90 secs || 15115742 markings, 18907568 edges, 157594 markings/sec, 90 secs
lola: sara is running 95 secs || 15908529 markings, 19902587 edges, 158557 markings/sec, 95 secs
lola: sara is running 100 secs || 16699193 markings, 20885744 edges, 158133 markings/sec, 100 secs
lola: sara is running 105 secs || 17504364 markings, 21903147 edges, 161034 markings/sec, 105 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 259 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t91)))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t336) OR NOT FIREABLE(t287) OR ((FIREABLE(t284) OR NOT FIREABLE(t195)) AND FIREABLE(t134)))))
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 52 bytes per marking, with 2 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 840080 markings, 1090750 edges, 168016 markings/sec, 0 secs
lola: sara is running 5 secs || 1624201 markings, 2166062 edges, 156824 markings/sec, 5 secs
lola: sara is running 10 secs || 2322628 markings, 3271289 edges, 139685 markings/sec, 10 secs
lola: sara is running 15 secs || 3108614 markings, 4327359 edges, 157197 markings/sec, 15 secs
lola: sara is running 20 secs || 4052612 markings, 5433828 edges, 188800 markings/sec, 20 secs
lola: sara is running 25 secs || 5014189 markings, 6569548 edges, 192315 markings/sec, 25 secs
lola: sara is running 30 secs || 5834375 markings, 7631641 edges, 164037 markings/sec, 30 secs
lola: sara is running 35 secs || 6599311 markings, 8657567 edges, 152987 markings/sec, 35 secs
lola: sara is running 40 secs || 7438029 markings, 9741556 edges, 167744 markings/sec, 40 secs
lola: sara is running 45 secs || 8188098 markings, 10799409 edges, 150014 markings/sec, 45 secs
lola: sara is running 50 secs || 8874575 markings, 11700108 edges, 137295 markings/sec, 50 secs
lola: sara is running 55 secs || 9563310 markings, 12626594 edges, 137747 markings/sec, 55 secs
lola: sara is running 60 secs || 10257745 markings, 13547368 edges, 138887 markings/sec, 60 secs
lola: sara is running 65 secs || 10925392 markings, 14428735 edges, 133529 markings/sec, 65 secs
lola: sara is running 70 secs || 11621808 markings, 15318027 edges, 139283 markings/sec, 70 secs
lola: sara is running 75 secs || 12273144 markings, 16238675 edges, 130267 markings/sec, 75 secs
lola: sara is running 80 secs || 12792165 markings, 17018497 edges, 103804 markings/sec, 80 secs
lola: sara is running 85 secs || 13273549 markings, 17775321 edges, 96277 markings/sec, 85 secs
lola: sara is running 90 secs || 13812264 markings, 18505464 edges, 107743 markings/sec, 90 secs
lola: sara is running 95 secs || 14314460 markings, 19330977 edges, 100439 markings/sec, 95 secs
lola: sara is running 100 secs || 14749125 markings, 20185467 edges, 86933 markings/sec, 100 secs
lola: sara is running 105 secs || 15161968 markings, 21007670 edges, 82569 markings/sec, 105 secs
lola: sara is running 110 secs || 15631263 markings, 21804027 edges, 93859 markings/sec, 110 secs
lola: sara is running 115 secs || 16171464 markings, 22609746 edges, 108040 markings/sec, 115 secs
lola: sara is running 120 secs || 16694513 markings, 23460980 edges, 104610 markings/sec, 120 secs
lola: sara is running 125 secs || 17199291 markings, 24318241 edges, 100956 markings/sec, 125 secs
lola: sara is running 130 secs || 17692703 markings, 25181896 edges, 98682 markings/sec, 130 secs
lola: sara is running 135 secs || 18184494 markings, 26045742 edges, 98358 markings/sec, 135 secs
lola: sara is running 140 secs || 18675981 markings, 26893997 edges, 98297 markings/sec, 140 secs
lola: sara is running 145 secs || 19162515 markings, 27744933 edges, 97307 markings/sec, 145 secs
lola: sara is running 150 secs || 19643463 markings, 28589409 edges, 96190 markings/sec, 150 secs
lola: sara is running 155 secs || 20120899 markings, 29414277 edges, 95487 markings/sec, 155 secs
lola: sara is running 160 secs || 20590747 markings, 30244615 edges, 93970 markings/sec, 160 secs
lola: sara is running 165 secs || 21062784 markings, 31068147 edges, 94407 markings/sec, 165 secs
lola: sara is running 170 secs || 21523004 markings, 31892091 edges, 92044 markings/sec, 170 secs
lola: sara is running 175 secs || 22001461 markings, 32742533 edges, 95691 markings/sec, 175 secs
lola: sara is running 180 secs || 22504635 markings, 33549579 edges, 100635 markings/sec, 180 secs
lola: sara is running 185 secs || 23015166 markings, 34372803 edges, 102106 markings/sec, 185 secs
lola: sara is running 190 secs || 23521551 markings, 35188414 edges, 101277 markings/sec, 190 secs
lola: sara is running 195 secs || 24025013 markings, 36002669 edges, 100692 markings/sec, 195 secs
lola: sara is running 200 secs || 24541233 markings, 36810847 edges, 103244 markings/sec, 200 secs
lola: sara is running 205 secs || 24988716 markings, 37663429 edges, 89497 markings/sec, 205 secs
lola: sara is running 210 secs || 25398666 markings, 38468417 edges, 81990 markings/sec, 210 secs
lola: sara is running 215 secs || 25831489 markings, 39277183 edges, 86565 markings/sec, 215 secs
lola: sara is running 220 secs || 26320321 markings, 40077248 edges, 97766 markings/sec, 220 secs
lola: sara is running 225 secs || 26779763 markings, 40940916 edges, 91888 markings/sec, 225 secs
lola: sara is running 230 secs || 27201582 markings, 41767848 edges, 84364 markings/sec, 230 secs
lola: sara is running 235 secs || 27638582 markings, 42586851 edges, 87400 markings/sec, 235 secs
lola: sara is running 240 secs || 28135961 markings, 43373110 edges, 99476 markings/sec, 240 secs
lola: sara is running 245 secs || 28673370 markings, 44213028 edges, 107482 markings/sec, 245 secs
lola: sara is running 250 secs || 29189890 markings, 45059064 edges, 103304 markings/sec, 250 secs
lola: sara is running 255 secs || 29677703 markings, 45915696 edges, 97563 markings/sec, 255 secs
lola: sara is running 260 secs || 30156988 markings, 46741739 edges, 95857 markings/sec, 260 secs
lola: sara is running 265 secs || 30623488 markings, 47564156 edges, 93300 markings/sec, 265 secs
lola: sara is running 270 secs || 31103424 markings, 48402258 edges, 95987 markings/sec, 270 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t228)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 825854 markings, 976959 edges, 165171 markings/sec, 0 secs
lola: sara is running 5 secs || 1644828 markings, 2008031 edges, 163795 markings/sec, 5 secs
lola: sara is running 10 secs || 2440532 markings, 3001059 edges, 159141 markings/sec, 10 secs
lola: sara is running 15 secs || 3232306 markings, 4005541 edges, 158355 markings/sec, 15 secs
lola: sara is running 20 secs || 4039461 markings, 5011856 edges, 161431 markings/sec, 20 secs
lola: sara is running 25 secs || 4834556 markings, 6003995 edges, 159019 markings/sec, 25 secs
lola: sara is running 30 secs || 5626511 markings, 7002863 edges, 158391 markings/sec, 30 secs
lola: sara is running 35 secs || 6415406 markings, 7987137 edges, 157779 markings/sec, 35 secs
lola: sara is running 40 secs || 7203498 markings, 8990763 edges, 157618 markings/sec, 40 secs
lola: sara is running 45 secs || 8001681 markings, 9981574 edges, 159637 markings/sec, 45 secs
lola: sara is running 50 secs || 8793929 markings, 10969812 edges, 158450 markings/sec, 50 secs
lola: sara is running 55 secs || 9579837 markings, 11960961 edges, 157182 markings/sec, 55 secs
lola: sara is running 60 secs || 10366810 markings, 12942572 edges, 157395 markings/sec, 60 secs
lola: sara is running 65 secs || 11159377 markings, 13948601 edges, 158513 markings/sec, 65 secs
lola: sara is running 70 secs || 11957556 markings, 14944649 edges, 159636 markings/sec, 70 secs
lola: sara is running 75 secs || 12753159 markings, 15935945 edges, 159121 markings/sec, 75 secs
lola: sara is running 80 secs || 13545500 markings, 16935049 edges, 158468 markings/sec, 80 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t269) OR (FIREABLE(t14) AND FIREABLE(t359)) OR ((FIREABLE(t181) OR FIREABLE(t83)) AND (FIREABLE(t193) OR FIREABLE(t141))) OR FIREABLE(t380) OR (FIREABLE(t272) AND FIREABLE(t233) AND FIREABLE(t73)))))
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 52 bytes per marking, with 2 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 672 literals and 96 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 751314 markings, 1036250 edges, 150263 markings/sec, 0 secs
lola: sara is running 5 secs || 1444260 markings, 2098780 edges, 138589 markings/sec, 5 secs
lola: sara is running 10 secs || 2103106 markings, 3193466 edges, 131769 markings/sec, 10 secs
lola: sara is running 15 secs || 2748267 markings, 4284385 edges, 129032 markings/sec, 15 secs
lola: sara is running 20 secs || 3413835 markings, 5379961 edges, 133114 markings/sec, 20 secs
lola: sara is running 25 secs || 4067510 markings, 6477288 edges, 130735 markings/sec, 25 secs
lola: sara is running 30 secs || 4731272 markings, 7578751 edges, 132752 markings/sec, 30 secs
lola: sara is running 35 secs || 5378165 markings, 8666536 edges, 129379 markings/sec, 35 secs
lola: sara is running 40 secs || 6038507 markings, 9762396 edges, 132068 markings/sec, 40 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 328 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t147) AND FIREABLE(t348))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-7.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t212) AND FIREABLE(t341) AND FIREABLE(t273) AND FIREABLE(t27))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-8.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 421 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t78) OR NOT FIREABLE(t344)) AND NOT FIREABLE(t170) AND FIREABLE(t10))))
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 52 bytes per marking, with 2 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 24 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-9.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 10 will run for 491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t306)))
lola: ========================================
lola: SUBTASKlola:
lola: ========================================
lola: checking invariance
state equation: calling and running sara
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-10.sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-9.sara.
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t99) OR (NOT FIREABLE(t295) AND NOT FIREABLE(t51)) OR (FIREABLE(t126) AND FIREABLE(t26) AND NOT FIREABLE(t358) AND (FIREABLE(t192) OR FIREABLE(t99) OR FIREABLE(t311))))))
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 52 bytes per marking, with 2 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 55 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DES-PT-50b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 736 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t331) OR FIREABLE(t254))))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-12.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 502436 markings, 1217259 edges, 100487 markings/sec, 0 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 979 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t347)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1468 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t410)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2936 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t295)))
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 52 bytes per marking, with 2 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 DES-PT-50b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DES-PT-50b-ReachabilityFireability-15.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 745759 markings, 1037980 edges, 149152 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes unknown yes no yes no yes no no yes yes no yes
FORMULA DES-PT-50b-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DES-PT-50b-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494633689268

--------------------
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="DES-PT-50b"
export BK_EXAMINATION="ReachabilityFireability"
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/DES-PT-50b.tgz
mv DES-PT-50b 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 DES-PT-50b, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r018-ebro-149436309200333"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '' ReachabilityFireability.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 ;