About the Execution of LoLA for Solitaire-PT-EngCT7x7
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1451.030 | 509589.00 | 1020360.00 | 110.10 | ?FTFFFFTTF?FTFFF | 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 Solitaire-PT-EngCT7x7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r078-ebro-149441008200070
=====================================================================
--------------------
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 Solitaire-PT-EngCT7x7-ReachabilityCardinality-0
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-1
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-10
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-11
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-12
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-13
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-14
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-15
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-2
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-3
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-4
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-5
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-6
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-7
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-8
FORMULA_NAME Solitaire-PT-EngCT7x7-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1494930152968
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ Solitaire-PT-EngCT7x7 @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 143/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 67 places, 76 transitions, 33 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 77 transition conflict sets
lola: TASK
lola: reading formula from Solitaire-PT-EngCT7x7-ReachabilityCardinality.task
lola: E (F (((counter + 1 <= T53) AND (F14 <= 2) AND (T51 <= F36)))) : E (F ((3 <= T33))) : A (G (((T75 <= T35) OR (F64 <= F52) OR (F15 + 1 <= counter) OR (((F36 <= T36) OR (F43 <= T14)) AND (2 <= F45))))) : E (F ((3 <= F74))) : A (G ((F56 <= counter))) : E (F ((3 <= F45))) : A (G (((F74 <= 0) OR (F63 + 1 <= F25) OR (1 <= F33) OR (p23 <= T64) OR (T44 <= 2)))) : E (F (((2 <= T63) OR ((3 <= T53) AND (F73 <= T14) AND (F24 <= 2))))) : E (F ((2 <= T32))) : E (F ((2 <= T63))) : A (G ((T64 <= 1))) : A (G (((F15 <= T63) OR (1 <= T65)))) : E (F (((F47 <= F43) AND (2 <= T41)))) : E (F ((2 <= F15))) : E (F ((3 <= F25))) : A (G (((T14 <= 0) OR (T46 + 1 <= F25) OR (F33 <= 2) OR (F45 + 1 <= F41))))
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 (((counter + 1 <= T53) AND (F14 <= 2) AND (T51 <= F36))))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 409117 markings, 1757116 edges, 81823 markings/sec, 0 secs
lola: sara is running 5 secs || 761336 markings, 3505422 edges, 70444 markings/sec, 5 secs
lola: sara is running 10 secs || 1082780 markings, 5308462 edges, 64289 markings/sec, 10 secs
lola: sara is running 15 secs || 1413629 markings, 7077329 edges, 66170 markings/sec, 15 secs
lola: sara is running 20 secs || 1718086 markings, 8842179 edges, 60891 markings/sec, 20 secs
lola: sara is running 25 secs || 2050823 markings, 10569786 edges, 66547 markings/sec, 25 secs
lola: sara is running 30 secs || 2373028 markings, 12316392 edges, 64441 markings/sec, 30 secs
lola: sara is running 35 secs || 2671827 markings, 14048352 edges, 59760 markings/sec, 35 secs
lola: sara is running 40 secs || 2964647 markings, 15831068 edges, 58564 markings/sec, 40 secs
lola: sara is running 45 secs || 3265580 markings, 17592782 edges, 60187 markings/sec, 45 secs
lola: sara is running 50 secs || 3578117 markings, 19362710 edges, 62507 markings/sec, 50 secs
lola: sara is running 55 secs || 3917529 markings, 21158560 edges, 67882 markings/sec, 55 secs
lola: sara is running 60 secs || 4235335 markings, 22909310 edges, 63561 markings/sec, 60 secs
lola: sara is running 65 secs || 4528456 markings, 24724792 edges, 58624 markings/sec, 65 secs
lola: sara is running 70 secs || 4821256 markings, 26529208 edges, 58560 markings/sec, 70 secs
lola: sara is running 75 secs || 5107209 markings, 28304246 edges, 57191 markings/sec, 75 secs
lola: sara is running 80 secs || 5396512 markings, 30040824 edges, 57861 markings/sec, 80 secs
lola: sara is running 85 secs || 5693182 markings, 31763631 edges, 59334 markings/sec, 85 secs
lola: sara is running 90 secs || 6001304 markings, 33494890 edges, 61624 markings/sec, 90 secs
lola: sara is running 95 secs || 6269326 markings, 35279597 edges, 53604 markings/sec, 95 secs
lola: sara is running 100 secs || 6544492 markings, 36998809 edges, 55033 markings/sec, 100 secs
lola: sara is running 105 secs || 6827987 markings, 38728196 edges, 56699 markings/sec, 105 secs
lola: sara is running 110 secs || 7097366 markings, 40472143 edges, 53876 markings/sec, 110 secs
lola: sara is running 115 secs || 7347931 markings, 42252137 edges, 50113 markings/sec, 115 secs
lola: sara is running 120 secs || 7617052 markings, 44013558 edges, 53824 markings/sec, 120 secs
lola: sara is running 125 secs || 7865657 markings, 45806986 edges, 49721 markings/sec, 125 secs
lola: sara is running 130 secs || 8178293 markings, 47503761 edges, 62527 markings/sec, 130 secs
lola: sara is running 135 secs || 8475697 markings, 49235200 edges, 59481 markings/sec, 135 secs
lola: sara is running 140 secs || 8771756 markings, 50936469 edges, 59212 markings/sec, 140 secs
lola: sara is running 145 secs || 9074283 markings, 52641019 edges, 60505 markings/sec, 145 secs
lola: sara is running 150 secs || 9339389 markings, 54355388 edges, 53021 markings/sec, 150 secs
lola: sara is running 155 secs || 9615007 markings, 56032526 edges, 55124 markings/sec, 155 secs
lola: sara is running 160 secs || 9887758 markings, 57746170 edges, 54550 markings/sec, 160 secs
lola: sara is running 165 secs || 10192518 markings, 59462665 edges, 60952 markings/sec, 165 secs
lola: sara is running 170 secs || 10501838 markings, 61236806 edges, 61864 markings/sec, 170 secs
lola: sara is running 175 secs || 10795877 markings, 63023606 edges, 58808 markings/sec, 175 secs
lola: sara is running 180 secs || 11075830 markings, 64803108 edges, 55991 markings/sec, 180 secs
lola: sara is running 185 secs || 11328119 markings, 66610825 edges, 50458 markings/sec, 185 secs
lola: sara is running 190 secs || 11614111 markings, 68367650 edges, 57198 markings/sec, 190 secs
lola: sara is running 195 secs || 11877774 markings, 70112893 edges, 52733 markings/sec, 195 secs
lola: sara is running 200 secs || 12160496 markings, 71890129 edges, 56544 markings/sec, 200 secs
lola: sara is running 205 secs || 12413482 markings, 73666244 edges, 50597 markings/sec, 205 secs
lola: sara is running 210 secs || 12661720 markings, 75427511 edges, 49648 markings/sec, 210 secs
lola: sara is running 215 secs || 12933763 markings, 77140194 edges, 54409 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 ((3 <= T33)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality.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 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((T75 <= T35) OR (F64 <= F52) OR (F15 + 1 <= counter) OR (((F36 <= T36) OR (F43 <= T14)) AND (2 <= F45)))))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 9 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 411355 markings, 1772210 edges, 82271 markings/sec, 0 secs
lola: sara is running 5 secs || 778586 markings, 3501606 edges, 73446 markings/sec, 5 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= F74)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-3.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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((F56 <= counter)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 417949 markings, 1802654 edges, 83590 markings/sec, 0 secs
lola: sara is running 5 secs || 774230 markings, 3587510 edges, 71256 markings/sec, 5 secs
lola: sara is running 10 secs || 1096577 markings, 5394655 edges, 64469 markings/sec, 10 secs
lola: sara is running 15 secs || 1432954 markings, 7205013 edges, 67275 markings/sec, 15 secs
lola: sara is running 20 secs || 1742781 markings, 9001504 edges, 61965 markings/sec, 20 secs
lola: sara is running 25 secs || 2083937 markings, 10753766 edges, 68231 markings/sec, 25 secs
lola: sara is running 30 secs || 2411506 markings, 12544474 edges, 65514 markings/sec, 30 secs
lola: sara is running 35 secs || 2721608 markings, 14307819 edges, 62020 markings/sec, 35 secs
lola: sara is running 40 secs || 3012285 markings, 16118582 edges, 58135 markings/sec, 40 secs
lola: sara is running 45 secs || 3313528 markings, 17894997 edges, 60249 markings/sec, 45 secs
lola: sara is running 50 secs || 3642448 markings, 19695117 edges, 65784 markings/sec, 50 secs
lola: sara is running 55 secs || 3972061 markings, 21512883 edges, 65923 markings/sec, 55 secs
lola: sara is running 60 secs || 4294482 markings, 23274592 edges, 64484 markings/sec, 60 secs
lola: sara is running 65 secs || 4587164 markings, 25111056 edges, 58536 markings/sec, 65 secs
lola: sara is running 70 secs || 4887713 markings, 26944344 edges, 60110 markings/sec, 70 secs
lola: sara is running 75 secs || 5172302 markings, 28752739 edges, 56918 markings/sec, 75 secs
lola: sara is running 80 secs || 5482567 markings, 30492141 edges, 62053 markings/sec, 80 secs
lola: sara is running 85 secs || 5785321 markings, 32252203 edges, 60551 markings/sec, 85 secs
lola: sara is running 90 secs || 6082754 markings, 34021400 edges, 59487 markings/sec, 90 secs
lola: sara is running 95 secs || 6350475 markings, 35805916 edges, 53544 markings/sec, 95 secs
lola: sara is running 100 secs || 6625484 markings, 37539224 edges, 55002 markings/sec, 100 secs
lola: sara is running 105 secs || 6912593 markings, 39285036 edges, 57422 markings/sec, 105 secs
lola: sara is running 110 secs || 7176651 markings, 41076757 edges, 52812 markings/sec, 110 secs
lola: sara is running 115 secs || 7438182 markings, 42878288 edges, 52306 markings/sec, 115 secs
lola: sara is running 120 secs || 7714403 markings, 44647003 edges, 55244 markings/sec, 120 secs
lola: sara is running 125 secs || 7962645 markings, 46433474 edges, 49648 markings/sec, 125 secs
lola: sara is running 130 secs || 8280176 markings, 48162783 edges, 63506 markings/sec, 130 secs
lola: sara is running 135 secs || 8595596 markings, 49887405 edges, 63084 markings/sec, 135 secs
lola: sara is running 140 secs || 8899050 markings, 51658934 edges, 60691 markings/sec, 140 secs
lola: sara is running 145 secs || 9200926 markings, 53432141 edges, 60375 markings/sec, 145 secs
lola: sara is running 150 secs || 9503168 markings, 55196255 edges, 60448 markings/sec, 150 secs
lola: sara is running 155 secs || 9775069 markings, 57016605 edges, 54380 markings/sec, 155 secs
lola: sara is running 160 secs || 10043245 markings, 58799201 edges, 53635 markings/sec, 160 secs
lola: sara is running 165 secs || 10337774 markings, 60527755 edges, 58906 markings/sec, 165 secs
lola: sara is running 170 secs || 10620804 markings, 62303257 edges, 56606 markings/sec, 170 secs
lola: sara is running 175 secs || 10890412 markings, 64057563 edges, 53922 markings/sec, 175 secs
lola: sara is running 180 secs || 11172289 markings, 65849084 edges, 56375 markings/sec, 180 secs
lola: sara is running 185 secs || 11426788 markings, 67616195 edges, 50900 markings/sec, 185 secs
lola: sara is running 190 secs || 11688329 markings, 69359132 edges, 52308 markings/sec, 190 secs
lola: sara is running 195 secs || 11970838 markings, 71090223 edges, 56502 markings/sec, 195 secs
lola: sara is running 200 secs || 12241094 markings, 72843752 edges, 54051 markings/sec, 200 secs
lola: sara is running 205 secs || 12534243 markings, 74582841 edges, 58630 markings/sec, 205 secs
lola: sara is running 210 secs || 12808131 markings, 76368064 edges, 54778 markings/sec, 210 secs
lola: sara is running 215 secs || 13088264 markings, 78136217 edges, 56027 markings/sec, 215 secs
lola: sara is running 220 secs || 13362390 markings, 79955421 edges, 54825 markings/sec, 220 secs
lola: sara is running 225 secs || 13643762 markings, 81775718 edges, 56274 markings/sec, 225 secs
lola: sara is running 230 secs || 13871802 markings, 83565022 edges, 45608 markings/sec, 230 secs
lola: sara is running 235 secs || 14149752 markings, 85260745 edges, 55590 markings/sec, 235 secs
lola: sara is running 240 secs || 14409696 markings, 86992515 edges, 51989 markings/sec, 240 secs
lola: sara is running 245 secs || 14653719 markings, 88761064 edges, 48805 markings/sec, 245 secs
lola: sara is running 250 secs || 14910139 markings, 90517345 edges, 51284 markings/sec, 250 secs
lola: sara is running 255 secs || 15172665 markings, 92302546 edges, 52505 markings/sec, 255 secs
lola: sara is running 260 secs || 15411414 markings, 94113305 edges, 47750 markings/sec, 260 secs
lola: sara is running 265 secs || 15712081 markings, 95873749 edges, 60133 markings/sec, 265 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 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= F45)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-5.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 6 will run for 303 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F74 <= 0) OR (F63 + 1 <= F25) OR (1 <= F33) OR (p23 <= T64) OR (T44 <= 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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 7 will run for 336 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= T63) OR ((3 <= T53) AND (F73 <= T14) AND (F24 <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-7.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 8 will run for 378 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= T32)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-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 432 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= T63)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-9.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 10 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((T64 <= 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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 606 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((F15 <= T63) OR (1 <= T65))))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-11.sara
lola: subprocess 12 will run for 757 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: state equation: calling and running sara
lola: lola: ...considering subproblem: E (F (((F47 <= F43) AND (2 <= T41))))
========================================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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-12.sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-12.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 13 will run for 1010 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= F15)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-13.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 14 will run for 1515 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= F25)))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-14.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 15 will run for 3030 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((T14 <= 0) OR (T46 + 1 <= F25) OR (F33 <= 2) OR (F45 + 1 <= F41))))
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 132 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Solitaire-PT-EngCT7x7-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Solitaire-PT-EngCT7x7-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: unknown no yes no unknown no yes no no no yes no no no no yes
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-4 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Solitaire-PT-EngCT7x7-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494930662557
--------------------
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="Solitaire-PT-EngCT7x7"
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/Solitaire-PT-EngCT7x7.tgz
mv Solitaire-PT-EngCT7x7 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 Solitaire-PT-EngCT7x7, 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 r078-ebro-149441008200070"
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 ;