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

About the Execution of LoLA for ClientsAndServers-PT-N0020P1

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
6507.060 653520.00 656840.00 125.30 TTTTFFTTTFFFTF?F 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 ClientsAndServers-PT-N0020P1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-ebro-149580920000228
=====================================================================


--------------------
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 ClientsAndServers-PT-N0020P1-CTLCardinality-0
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-1
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-15
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-2
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-3
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-4
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-5
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-6
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-7
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-8
FORMULA_NAME ClientsAndServers-PT-N0020P1-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496602809330


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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0020P1: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ ClientsAndServers-PT-N0020P1 @ 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: 43/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 25 places, 18 transitions, 17 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 25 transition conflict sets
lola: TASK
lola: reading formula from ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: ((2 <= SA) OR E (F (A (X ((2 <= CG)))))) : E (G (((SpA <= SF) OR (Si <= SwA) OR (Uf + 1 <= SF) OR (Mi <= 2)))) : E (G (A (X (((MpA <= MpG) OR (CF <= CwG)))))) : ((A (F ((Ci <= Mi))) OR A (((3 <= MtF) U (2 <= SwG)))) AND (CG <= CwG)) : A (G (A (X ((CG <= Mi))))) : A ((E (G ((MwU <= SG))) U A (F ((2 <= SwG))))) : E (G (E (((3 <= Uf) U (Cb <= SF))))) : A (F ((3 <= CA))) : A (G (A (F ((1 <= MwU))))) : (A (G ((SR <= Ci))) OR E (G (A (F ((2 <= CwA)))))) : NOT((A (F ((CwA + 1 <= Ci))) AND NOT(E (F ((2 <= CA)))))) : E (G ((1 <= Mi))) : (((E (F ((1 <= MwU))) OR ((2 <= MpG) OR (SG <= SpG) OR (1 <= MpA) OR (1 <= Ci))) OR (A (F ((CwG <= SwA))) OR (StR + 1 <= Uf))) AND ((((CwG <= 1) OR (Ci + 1 <= MpG)) AND (CR + 1 <= CwA)) OR A (F (FALSE)))) : E ((A (F ((2 <= SG))) U (Mi <= 0))) : ((StF <= CR) AND E (G (((Cb <= CwG) OR (2 <= SwA) OR (MpA + 1 <= SwG))))) : (E (G (((CA <= 1)))) OR (Si <= SwA))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= SA) OR E (F (A (X ((2 <= CG))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= SA)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= SA)
lola: processed formula length: 9
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((2 <= CG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((2 <= CG)))
lola: processed formula length: 23
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((SpA <= SF) OR (Si <= SwA) OR (Uf + 1 <= SF) OR (Mi <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((SF + 1 <= SpA) AND (SwA + 1 <= Si) AND (SF <= Uf) AND (3 <= Mi))))
lola: processed formula length: 81
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (X (((MpA <= MpG) OR (CF <= CwG))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(AX(((MpA <= MpG) OR (CF <= CwG))))))
lola: processed formula length: 54
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F ((Ci <= Mi))) OR A (((3 <= MtF) U (2 <= SwG)))) AND (CG <= CwG))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Ci <= Mi)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (Ci <= Mi))
lola: processed formula length: 20
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= MtF) U (2 <= SwG)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((3 <= MtF) U (2 <= SwG))
lola: processed formula length: 26
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: SUBRESULT
lola: lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (X ((CG <= Mi)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(AX((CG <= Mi)))))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 919448 markings, 2808050 edges, 3224733188970512384 markings/sec, 0 secs
lola: 1629769 markings, 5150527 edges, 142064 markings/sec, 5 secs
lola: 2290108 markings, 7358360 edges, 132068 markings/sec, 10 secs
lola: 2904454 markings, 9455818 edges, 122869 markings/sec, 15 secs
lola: 3494956 markings, 11481699 edges, 118100 markings/sec, 20 secs
lola: 4067497 markings, 13479609 edges, 114508 markings/sec, 25 secs
lola: 4571889 markings, 15250448 edges, 100878 markings/sec, 30 secs
lola: 5034505 markings, 16881053 edges, 92523 markings/sec, 35 secs
lola: 5487937 markings, 18497926 edges, 90686 markings/sec, 40 secs
lola: 5927452 markings, 20059776 edges, 87903 markings/sec, 45 secs
lola: 6373845 markings, 21660499 edges, 89279 markings/sec, 50 secs
lola: 6799773 markings, 23195731 edges, 85186 markings/sec, 55 secs
lola: 7236516 markings, 24767210 edges, 87349 markings/sec, 60 secs
lola: 7654030 markings, 26284424 edges, 83503 markings/sec, 65 secs
lola: 8082366 markings, 27835365 edges, 85667 markings/sec, 70 secs
lola: 8512769 markings, 29387405 edges, 86081 markings/sec, 75 secs
lola: 8924962 markings, 30886094 edges, 82439 markings/sec, 80 secs
lola: 9336748 markings, 32400378 edges, 82357 markings/sec, 85 secs
lola: 9744898 markings, 33899691 edges, 81630 markings/sec, 90 secs
lola: 10162088 markings, 35440297 edges, 83438 markings/sec, 95 secs
lola: 10555969 markings, 36891270 edges, 78776 markings/sec, 100 secs
lola: 10957608 markings, 38378772 edges, 80328 markings/sec, 105 secs
lola: 11350578 markings, 39835587 edges, 78594 markings/sec, 110 secs
lola: 11741909 markings, 41292963 edges, 78266 markings/sec, 115 secs
lola: 12134696 markings, 42756240 edges, 78557 markings/sec, 120 secs
lola: 12539715 markings, 44260901 edges, 81004 markings/sec, 125 secs
lola: 12938050 markings, 45750130 edges, 79667 markings/sec, 130 secs
lola: 13352956 markings, 47291237 edges, 82981 markings/sec, 135 secs
lola: 13743932 markings, 48753615 edges, 78195 markings/sec, 140 secs
lola: 14130370 markings, 50199563 edges, 77288 markings/sec, 145 secs
lola: 14523622 markings, 51672156 edges, 78650 markings/sec, 150 secs
lola: 14910910 markings, 53124348 edges, 77458 markings/sec, 155 secs
lola: 15294164 markings, 54571845 edges, 76651 markings/sec, 160 secs
lola: 15670701 markings, 55995991 edges, 75307 markings/sec, 165 secs
lola: 16060029 markings, 57450414 edges, 77866 markings/sec, 170 secs
lola: 16435415 markings, 58872721 edges, 75077 markings/sec, 175 secs
lola: 16818302 markings, 60321115 edges, 76577 markings/sec, 180 secs
lola: 17206972 markings, 61779974 edges, 77734 markings/sec, 185 secs
lola: 17582594 markings, 63204497 edges, 75124 markings/sec, 190 secs
lola: 17963146 markings, 64648933 edges, 76110 markings/sec, 195 secs
lola: 18343250 markings, 66087070 edges, 76021 markings/sec, 200 secs
lola: 18714983 markings, 67499532 edges, 74347 markings/sec, 205 secs
lola: 19085841 markings, 68908412 edges, 74172 markings/sec, 210 secs
lola: 19451346 markings, 70299423 edges, 73101 markings/sec, 215 secs
lola: 19820955 markings, 71699560 edges, 73922 markings/sec, 220 secs
lola: 20178342 markings, 73064827 edges, 71477 markings/sec, 225 secs
lola: 20547561 markings, 74465226 edges, 73844 markings/sec, 230 secs
lola: 20547561 markings, 74465226 edges, 0 markings/sec, 235 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 299 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((MwU <= SG))) U A (F ((2 <= SwG)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (SG + 1 <= MwU))) U A(TRUE U (2 <= SwG)))
lola: processed formula length: 56
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 329 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (((3 <= Uf) U (Cb <= SF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E((3 <= Uf) U (Cb <= SF)))))
lola: processed formula length: 45
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 366 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= CA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= CA))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((1 <= MwU)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (1 <= MwU)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1113327 markings, 2852120 edges, 3096159597753270272 markings/sec, 0 secs
lola: 2054321 markings, 5580082 edges, 188199 markings/sec, 5 secs
lola: 2953801 markings, 8316625 edges, 179896 markings/sec, 10 secs
lola: 3819796 markings, 11035610 edges, 173199 markings/sec, 15 secs
lola: 4667496 markings, 13720128 edges, 169540 markings/sec, 20 secs
lola: 5517140 markings, 16419485 edges, 169929 markings/sec, 25 secs
lola: 6325109 markings, 19157480 edges, 161594 markings/sec, 30 secs
lola: 7137059 markings, 21802840 edges, 162390 markings/sec, 35 secs
lola: 7912426 markings, 24401626 edges, 155073 markings/sec, 40 secs
lola: 8706142 markings, 27072675 edges, 158743 markings/sec, 45 secs
lola: 9498375 markings, 29750353 edges, 158447 markings/sec, 50 secs
lola: 10277674 markings, 32377252 edges, 155860 markings/sec, 55 secs
lola: 11045721 markings, 34994152 edges, 153609 markings/sec, 60 secs
lola: 11825854 markings, 37643727 edges, 156027 markings/sec, 65 secs
lola: 12604081 markings, 40288468 edges, 155645 markings/sec, 70 secs
lola: 13368211 markings, 42886367 edges, 152826 markings/sec, 75 secs
lola: 14070002 markings, 45502430 edges, 140358 markings/sec, 80 secs
lola: 14813530 markings, 48190583 edges, 148706 markings/sec, 85 secs
lola: 15534257 markings, 50687458 edges, 144145 markings/sec, 90 secs
lola: 16244023 markings, 53187293 edges, 141953 markings/sec, 95 secs
lola: 16949141 markings, 55677872 edges, 141024 markings/sec, 100 secs
lola: 17661034 markings, 58199808 edges, 142379 markings/sec, 105 secs
lola: 18366042 markings, 60695044 edges, 141002 markings/sec, 110 secs
lola: 19088550 markings, 63274857 edges, 144502 markings/sec, 115 secs
lola: 19813608 markings, 65846228 edges, 145012 markings/sec, 120 secs
lola: 20533856 markings, 68425638 edges, 144050 markings/sec, 125 secs
lola: 21241298 markings, 70953877 edges, 141488 markings/sec, 130 secs
lola: 21963552 markings, 73504519 edges, 144451 markings/sec, 135 secs
lola: 22666935 markings, 76027647 edges, 140677 markings/sec, 140 secs
lola: 23377110 markings, 78575568 edges, 142035 markings/sec, 145 secs
lola: 24078994 markings, 81091663 edges, 140377 markings/sec, 150 secs
lola: 24779572 markings, 83600340 edges, 140116 markings/sec, 155 secs
lola: 25479423 markings, 86104043 edges, 139970 markings/sec, 160 secs
lola: 26179743 markings, 88607277 edges, 140064 markings/sec, 165 secs
lola: 26870345 markings, 91073140 edges, 138120 markings/sec, 170 secs
lola: 27553007 markings, 93551746 edges, 136532 markings/sec, 175 secs
lola: 28241399 markings, 96029863 edges, 137678 markings/sec, 180 secs
lola: 28934612 markings, 98513609 edges, 138643 markings/sec, 185 secs
lola: 29495676 markings, 101024633 edges, 112213 markings/sec, 190 secs
lola: 30138637 markings, 103707960 edges, 128592 markings/sec, 195 secs
lola: 30833224 markings, 106141683 edges, 138917 markings/sec, 200 secs
lola: 31481460 markings, 108471830 edges, 129647 markings/sec, 205 secs
lola: 32097092 markings, 110742365 edges, 123126 markings/sec, 210 secs
lola: 32722989 markings, 113031405 edges, 125179 markings/sec, 215 secs
lola: 33338588 markings, 115290376 edges, 123120 markings/sec, 220 secs
lola: 33956959 markings, 117563562 edges, 123674 markings/sec, 225 secs
lola: 34585258 markings, 119884740 edges, 125660 markings/sec, 230 secs
lola: 35211203 markings, 122204764 edges, 125189 markings/sec, 235 secs
lola: 35842598 markings, 124531079 edges, 126279 markings/sec, 240 secs
lola: 36473129 markings, 126873000 edges, 126106 markings/sec, 245 secs
lola: 37122616 markings, 129254826 edges, 129897 markings/sec, 250 secs
lola: 37785380 markings, 131688361 edges, 132553 markings/sec, 255 secs
lola: 38416921 markings, 134095291 edges, 126308 markings/sec, 260 secs
lola: 39058989 markings, 136478459 edges, 128414 markings/sec, 265 secs
lola: 39727325 markings, 138920259 edges, 133667 markings/sec, 270 secs
lola: 40377194 markings, 141382659 edges, 129974 markings/sec, 275 secs
lola: 41030551 markings, 143823423 edges, 130671 markings/sec, 280 secs
lola: 41693132 markings, 146233977 edges, 132516 markings/sec, 285 secs
lola: 42319508 markings, 148624876 edges, 125275 markings/sec, 290 secs
lola: 42960164 markings, 150986944 edges, 128131 markings/sec, 295 secs
lola: 43606135 markings, 153420685 edges, 129194 markings/sec, 300 secs
lola: 44247998 markings, 155815784 edges, 128373 markings/sec, 305 secs
lola: 44909067 markings, 158244415 edges, 132214 markings/sec, 310 secs
lola: 45550643 markings, 160688969 edges, 128315 markings/sec, 315 secs
lola: 46223758 markings, 163130187 edges, 134623 markings/sec, 320 secs
lola: 46852251 markings, 165541166 edges, 125699 markings/sec, 325 secs
lola: 47510648 markings, 167942130 edges, 131679 markings/sec, 330 secs
lola: 48146929 markings, 170382466 edges, 127256 markings/sec, 335 secs
lola: 48806973 markings, 172788675 edges, 132009 markings/sec, 340 secs
lola: 49436247 markings, 175204493 edges, 125855 markings/sec, 345 secs
lola: 50102373 markings, 177627023 edges, 133225 markings/sec, 350 secs
lola: 50731590 markings, 180065494 edges, 125843 markings/sec, 355 secs
lola: 51391984 markings, 182501328 edges, 132079 markings/sec, 360 secs
lola: 52016230 markings, 184857562 edges, 124849 markings/sec, 365 secs
lola: 52646785 markings, 187229650 edges, 126111 markings/sec, 370 secs
lola: 53276481 markings, 189547079 edges, 125939 markings/sec, 375 secs
lola: 53913119 markings, 191975078 edges, 127328 markings/sec, 380 secs
lola: 54562818 markings, 194335091 edges, 129940 markings/sec, 385 secs
lola: 55173290 markings, 196706575 edges, 122094 markings/sec, 390 secs
lola: 55818227 markings, 199092270 edges, 128987 markings/sec, 395 secs
lola: 56455145 markings, 201471169 edges, 127384 markings/sec, 400 secs
lola: 57111766 markings, 203967978 edges, 131324 markings/sec, 405 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((SR <= Ci))) OR E (G (A (F ((2 <= CwA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((SR <= Ci)))
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 68 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 481 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((2 <= CwA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (2 <= CwA)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 481 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((A (F ((CwA + 1 <= Ci))) AND NOT(E (F ((2 <= CA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 481 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((Ci <= CwA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (CwA + 1 <= Ci)))
lola: processed formula length: 30
lola: 12 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= CA)))
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 68 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((1 <= Mi)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (Mi <= 0)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: subprocess 12 will run for 721 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((E (F ((1 <= MwU))) OR ((2 <= MpG) OR (SG <= SpG) OR (1 <= MpA) OR (1 <= Ci))) OR (A (F ((CwG <= SwA))) OR (StR + 1 <= Uf))) AND ((((CwG <= 1) OR (Ci + 1 <= MpG)) AND (CR + 1 <= CwA)) OR A (F (FALSE))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: ========================================
lola: RUNNING
lola: subprocess 12 will run for 721 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= MwU)))
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 68 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 962 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((CwG <= 1) OR (Ci + 1 <= MpG)) AND (CR + 1 <= CwA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((CwG <= 1) OR (Ci + 1 <= MpG)) AND (CR + 1 <= CwA))
lola: processed formula length: 54
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 962 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F ((2 <= SG))) U (Mi <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(A(TRUE U (2 <= SG)) U (Mi <= 0))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1443 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((StF <= CR) AND E (G (((Cb <= CwG) OR (2 <= SwA) OR (MpA + 1 <= SwG)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1443 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (StF <= CR)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (StF <= CR)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2887 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((Cb <= CwG) OR (2 <= SwA) OR (MpA + 1 <= SwG))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((CwG + 1 <= Cb) AND (SwA <= 1) AND (SwG <= MpA))))
lola: processed formula length: 64
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: lola: SUBRESULT
========================================
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 15 will run for 2887 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((CA <= 1)))) OR (Si <= SwA))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2887 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((CA <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((2 <= CA))))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: RESULT
lola:
SUMMARY: yes yes yes no no no yes no unknown no yes yes no no yes yes
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-8 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P1-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496603462850

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