fond

jQuery Multi Level CSS Menu Css3Menu.com

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

About the Execution of LoLA for S_Solitaire-PT-EngCT7x7

Execution Summary
Max Memory
Used (MB)		 Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1460.100 509712.00 1019860.00 125.20 ?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 S_Solitaire-PT-EngCT7x7, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443463900070
=====================================================================

--------------------
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 1496558930267


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Solitaire-PT-EngCT7x7: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_Solitaire-PT-EngCT7x7: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_Solitaire-PT-EngCT7x7 @ 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: 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 || 400944 markings, 1716193 edges, 80189 markings/sec, 0 secs
lola: sara is running 5 secs || 753043 markings, 3458781 edges, 70420 markings/sec, 5 secs
lola: sara is running 10 secs || 1070805 markings, 5230230 edges, 63552 markings/sec, 10 secs
lola: sara is running 15 secs || 1398571 markings, 6990625 edges, 65553 markings/sec, 15 secs
lola: sara is running 20 secs || 1698962 markings, 8727497 edges, 60078 markings/sec, 20 secs
lola: sara is running 25 secs || 2027018 markings, 10441381 edges, 65611 markings/sec, 25 secs
lola: sara is running 30 secs || 2348798 markings, 12183913 edges, 64356 markings/sec, 30 secs
lola: sara is running 35 secs || 2649739 markings, 13913960 edges, 60188 markings/sec, 35 secs
lola: sara is running 40 secs || 2947286 markings, 15690163 edges, 59509 markings/sec, 40 secs
lola: sara is running 45 secs || 3240573 markings, 17447438 edges, 58657 markings/sec, 45 secs
lola: sara is running 50 secs || 3546071 markings, 19191719 edges, 61100 markings/sec, 50 secs
lola: sara is running 55 secs || 3886554 markings, 20970499 edges, 68097 markings/sec, 55 secs
lola: sara is running 60 secs || 4200654 markings, 22705926 edges, 62820 markings/sec, 60 secs
lola: sara is running 65 secs || 4492994 markings, 24498062 edges, 58468 markings/sec, 65 secs
lola: sara is running 70 secs || 4781980 markings, 26293222 edges, 57797 markings/sec, 70 secs
lola: sara is running 75 secs || 5067842 markings, 28062788 edges, 57172 markings/sec, 75 secs
lola: sara is running 80 secs || 5352350 markings, 29805990 edges, 56902 markings/sec, 80 secs
lola: sara is running 85 secs || 5655948 markings, 31524544 edges, 60720 markings/sec, 85 secs
lola: sara is running 90 secs || 5957003 markings, 33242201 edges, 60211 markings/sec, 90 secs
lola: sara is running 95 secs || 6229029 markings, 35013626 edges, 54405 markings/sec, 95 secs
lola: sara is running 100 secs || 6502438 markings, 36725978 edges, 54682 markings/sec, 100 secs
lola: sara is running 105 secs || 6778077 markings, 38437895 edges, 55128 markings/sec, 105 secs
lola: sara is running 110 secs || 7044553 markings, 40161578 edges, 53295 markings/sec, 110 secs
lola: sara is running 115 secs || 7311154 markings, 41948628 edges, 53320 markings/sec, 115 secs
lola: sara is running 120 secs || 7566211 markings, 43717298 edges, 51011 markings/sec, 120 secs
lola: sara is running 125 secs || 7822979 markings, 45474402 edges, 51354 markings/sec, 125 secs
lola: sara is running 130 secs || 8114275 markings, 47168148 edges, 58259 markings/sec, 130 secs
lola: sara is running 135 secs || 8412426 markings, 48879294 edges, 59630 markings/sec, 135 secs
lola: sara is running 140 secs || 8702013 markings, 50555681 edges, 57917 markings/sec, 140 secs
lola: sara is running 145 secs || 9006135 markings, 52237688 edges, 60824 markings/sec, 145 secs
lola: sara is running 150 secs || 9271974 markings, 53959805 edges, 53168 markings/sec, 150 secs
lola: sara is running 155 secs || 9549183 markings, 55630607 edges, 55442 markings/sec, 155 secs
lola: sara is running 160 secs || 9814111 markings, 57326979 edges, 52986 markings/sec, 160 secs
lola: sara is running 165 secs || 10109659 markings, 59029954 edges, 59110 markings/sec, 165 secs
lola: sara is running 170 secs || 10417903 markings, 60761965 edges, 61649 markings/sec, 170 secs
lola: sara is running 175 secs || 10714262 markings, 62503540 edges, 59272 markings/sec, 175 secs
lola: sara is running 180 secs || 10993455 markings, 64264480 edges, 55839 markings/sec, 180 secs
lola: sara is running 185 secs || 11254524 markings, 66048589 edges, 52214 markings/sec, 185 secs
lola: sara is running 190 secs || 11524792 markings, 67808700 edges, 54054 markings/sec, 190 secs
lola: sara is running 195 secs || 11792100 markings, 69568287 edges, 53462 markings/sec, 195 secs
lola: sara is running 200 secs || 12067634 markings, 71325777 edges, 55107 markings/sec, 200 secs
lola: sara is running 205 secs || 12332175 markings, 73091355 edges, 52908 markings/sec, 205 secs
lola: sara is running 210 secs || 12578915 markings, 74851990 edges, 49348 markings/sec, 210 secs
lola: sara is running 215 secs || 12849291 markings, 76573105 edges, 54075 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 || 410791 markings, 1769966 edges, 82158 markings/sec, 0 secs
lola: sara is running 5 secs || 780962 markings, 3514303 edges, 74034 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 || 409730 markings, 1758037 edges, 81946 markings/sec, 0 secs
lola: sara is running 5 secs || 762200 markings, 3511634 edges, 70494 markings/sec, 5 secs
lola: sara is running 10 secs || 1079962 markings, 5286362 edges, 63552 markings/sec, 10 secs
lola: sara is running 15 secs || 1408938 markings, 7056994 edges, 65795 markings/sec, 15 secs
lola: sara is running 20 secs || 1716618 markings, 8837285 edges, 61536 markings/sec, 20 secs
lola: sara is running 25 secs || 2057139 markings, 10603327 edges, 68104 markings/sec, 25 secs
lola: sara is running 30 secs || 2384463 markings, 12388681 edges, 65465 markings/sec, 30 secs
lola: sara is running 35 secs || 2690986 markings, 14158435 edges, 61305 markings/sec, 35 secs
lola: sara is running 40 secs || 2989646 markings, 15979292 edges, 59732 markings/sec, 40 secs
lola: sara is running 45 secs || 3292721 markings, 17763829 edges, 60615 markings/sec, 45 secs
lola: sara is running 50 secs || 3621685 markings, 19586815 edges, 65793 markings/sec, 50 secs
lola: sara is running 55 secs || 3959072 markings, 21429369 edges, 67477 markings/sec, 55 secs
lola: sara is running 60 secs || 4282950 markings, 23200530 edges, 64776 markings/sec, 60 secs
lola: sara is running 65 secs || 4580460 markings, 25066893 edges, 59502 markings/sec, 65 secs
lola: sara is running 70 secs || 4884808 markings, 26925674 edges, 60870 markings/sec, 70 secs
lola: sara is running 75 secs || 5173301 markings, 28759216 edges, 57699 markings/sec, 75 secs
lola: sara is running 80 secs || 5485269 markings, 30506024 edges, 62394 markings/sec, 80 secs
lola: sara is running 85 secs || 5788444 markings, 32273610 edges, 60635 markings/sec, 85 secs
lola: sara is running 90 secs || 6086226 markings, 34043604 edges, 59556 markings/sec, 90 secs
lola: sara is running 95 secs || 6355931 markings, 35837452 edges, 53941 markings/sec, 95 secs
lola: sara is running 100 secs || 6632163 markings, 37575523 edges, 55246 markings/sec, 100 secs
lola: sara is running 105 secs || 6918335 markings, 39323830 edges, 57234 markings/sec, 105 secs
lola: sara is running 110 secs || 7185984 markings, 41126813 edges, 53530 markings/sec, 110 secs
lola: sara is running 115 secs || 7445969 markings, 42945816 edges, 51997 markings/sec, 115 secs
lola: sara is running 120 secs || 7727777 markings, 44745819 edges, 56362 markings/sec, 120 secs
lola: sara is running 125 secs || 7987608 markings, 46558571 edges, 51966 markings/sec, 125 secs
lola: sara is running 130 secs || 8304372 markings, 48308532 edges, 63353 markings/sec, 130 secs
lola: sara is running 135 secs || 8624040 markings, 50060831 edges, 63934 markings/sec, 135 secs
lola: sara is running 140 secs || 8931325 markings, 51855603 edges, 61457 markings/sec, 140 secs
lola: sara is running 145 secs || 9240093 markings, 53647092 edges, 61754 markings/sec, 145 secs
lola: sara is running 150 secs || 9538561 markings, 55435947 edges, 59694 markings/sec, 150 secs
lola: sara is running 155 secs || 9810276 markings, 57274046 edges, 54343 markings/sec, 155 secs
lola: sara is running 160 secs || 10089486 markings, 59054331 edges, 55842 markings/sec, 160 secs
lola: sara is running 165 secs || 10389087 markings, 60810487 edges, 59920 markings/sec, 165 secs
lola: sara is running 170 secs || 10666281 markings, 62610261 edges, 55439 markings/sec, 170 secs
lola: sara is running 175 secs || 10943581 markings, 64400595 edges, 55460 markings/sec, 175 secs
lola: sara is running 180 secs || 11219617 markings, 66223281 edges, 55207 markings/sec, 180 secs
lola: sara is running 185 secs || 11479552 markings, 68002815 edges, 51987 markings/sec, 185 secs
lola: sara is running 190 secs || 11750002 markings, 69776751 edges, 54090 markings/sec, 190 secs
lola: sara is running 195 secs || 12034299 markings, 71522166 edges, 56859 markings/sec, 195 secs
lola: sara is running 200 secs || 12318330 markings, 73288726 edges, 56806 markings/sec, 200 secs
lola: sara is running 205 secs || 12599483 markings, 75062329 edges, 56231 markings/sec, 205 secs
lola: sara is running 210 secs || 12883151 markings, 76882615 edges, 56734 markings/sec, 210 secs
lola: sara is running 215 secs || 13175048 markings, 78649992 edges, 58379 markings/sec, 215 secs
lola: sara is running 220 secs || 13451273 markings, 80502547 edges, 55245 markings/sec, 220 secs
lola: sara is running 225 secs || 13720005 markings, 82341134 edges, 53746 markings/sec, 225 secs
lola: sara is running 230 secs || 13966407 markings, 84117364 edges, 49280 markings/sec, 230 secs
lola: sara is running 235 secs || 14237298 markings, 85844805 edges, 54178 markings/sec, 235 secs
lola: sara is running 240 secs || 14496660 markings, 87626591 edges, 51872 markings/sec, 240 secs
lola: sara is running 245 secs || 14746869 markings, 89397165 edges, 50042 markings/sec, 245 secs
lola: sara is running 250 secs || 15010843 markings, 91163765 edges, 52795 markings/sec, 250 secs
lola: sara is running 255 secs || 15261438 markings, 92968527 edges, 50119 markings/sec, 255 secs
lola: sara is running 260 secs || 15497034 markings, 94771229 edges, 47119 markings/sec, 260 secs
lola: sara is running 265 secs || 15835218 markings, 96543409 edges, 67637 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 433 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: ...considering subproblem: E (F (((F47 <= F43) AND (2 <= T41))))
lola: lola: ========================================
lola: lola: state equation: calling and running sara
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.
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
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 3031 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 1496559439979

--------------------
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_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/S_Solitaire-PT-EngCT7x7.tgz
mv S_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 S_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 r158-ebro-149443463900070"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;