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-N0020P3, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-ebro-149580920100246
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496603561559


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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0020P3: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ ClientsAndServers-PT-N0020P3 @ 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-N0020P3-CTLCardinality.task
lola: E (G ((E (F (TRUE)) OR ((3 <= MpG) OR (3 <= MtF) OR (CwA <= MwU))))) : A (F (E (G (((1 <= CG) AND (MtF <= SpA)))))) : NOT((E (G ((Cb + 1 <= Uf))) OR A (X (((CwG <= Cb) AND (2 <= SpA)))))) : E (X (E (F (((Si <= SpA) OR (3 <= CwA)))))) : A (F (NOT(A (G ((3 <= Ci)))))) : ((Uf <= MtF) OR E ((((2 <= SA) OR (SpA <= Cb)) U ((3 <= CR) AND (2 <= SF))))) : NOT(A ((((1 <= Ci) OR (2 <= MpA)) U (2 <= SpA)))) : NOT(A (F (E (G ((3 <= Si)))))) : E (G (A (F ((StF <= 2))))) : A (G ((1 <= Uf))) : (A (((CR + 1 <= CF) U ((1 <= MpA) OR (2 <= StR)))) OR (NOT(A (F ((3 <= CwG)))) OR (E (G ((1 <= SwA))) OR E (F ((2 <= SA)))))) : E (X (A (F (((CwA <= Si) AND (2 <= CwG)))))) : E (G ((CG <= CF))) : (((CwG <= SF) OR (3 <= MpA) OR (CwG <= StF)) AND A ((((SA <= SpG) OR (3 <= StF)) U ((3 <= CF) OR (1 <= SpG))))) : A ((A (F ((MpA <= SpA))) U (3 <= SpA))) : E (X (E (G ((SR <= StF)))))
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 (G ((E (F (TRUE)) OR ((3 <= MpG) OR (3 <= MtF) OR (CwA <= MwU)))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 6 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-CTLCardinality.task
lola: processed formula with 0 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((1 <= CG) AND (MtF <= SpA))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((CG <= 0) OR (SpA + 1 <= MtF)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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: 1773862 markings, 3407730 edges, 2806861595810988032 markings/sec, 0 secs
lola: 3078250 markings, 6624135 edges, 260878 markings/sec, 5 secs
lola: 4279899 markings, 9640925 edges, 240330 markings/sec, 10 secs
lola: 5441665 markings, 12585875 edges, 232353 markings/sec, 15 secs
lola: 6603219 markings, 15532779 edges, 232311 markings/sec, 20 secs
lola: 7749305 markings, 18467781 edges, 229217 markings/sec, 25 secs
lola: 8899738 markings, 21393584 edges, 230087 markings/sec, 30 secs
lola: 10075076 markings, 24390916 edges, 235068 markings/sec, 35 secs
lola: 11231537 markings, 27352953 edges, 231292 markings/sec, 40 secs
lola: 12374091 markings, 30293389 edges, 228511 markings/sec, 45 secs
lola: 13514318 markings, 33245221 edges, 228045 markings/sec, 50 secs
lola: 14553313 markings, 35863052 edges, 207799 markings/sec, 55 secs
lola: 15496349 markings, 38261023 edges, 188607 markings/sec, 60 secs
lola: 16430979 markings, 40651239 edges, 186926 markings/sec, 65 secs
lola: 17716084 markings, 43378778 edges, 257021 markings/sec, 70 secs
lola: 19073200 markings, 46472826 edges, 271423 markings/sec, 75 secs
lola: 20105107 markings, 49317565 edges, 206381 markings/sec, 80 secs
lola: 21022074 markings, 51948047 edges, 183393 markings/sec, 85 secs
lola: 21904714 markings, 54510846 edges, 176528 markings/sec, 90 secs
lola: 22775697 markings, 57039578 edges, 174197 markings/sec, 95 secs
lola: 23646245 markings, 59568927 edges, 174110 markings/sec, 100 secs
lola: 24507743 markings, 62087385 edges, 172300 markings/sec, 105 secs
lola: 25373823 markings, 64626138 edges, 173216 markings/sec, 110 secs
lola: 26247544 markings, 67184992 edges, 174744 markings/sec, 115 secs
lola: 27115665 markings, 69727864 edges, 173624 markings/sec, 120 secs
lola: 27980119 markings, 72259290 edges, 172891 markings/sec, 125 secs
lola: 28846794 markings, 74800718 edges, 173335 markings/sec, 130 secs
lola: 29619662 markings, 77001005 edges, 154574 markings/sec, 135 secs
lola: 30325216 markings, 79035967 edges, 141111 markings/sec, 140 secs
lola: 31022131 markings, 81051375 edges, 139383 markings/sec, 145 secs
lola: 31726763 markings, 83085486 edges, 140926 markings/sec, 150 secs
lola: 32509782 markings, 85212794 edges, 156604 markings/sec, 155 secs
lola: 33504354 markings, 87948601 edges, 198914 markings/sec, 160 secs
lola: 34298269 markings, 90740438 edges, 158783 markings/sec, 165 secs
lola: 35063299 markings, 93455825 edges, 153006 markings/sec, 170 secs
lola: 35811298 markings, 96124546 edges, 149600 markings/sec, 175 secs
lola: 36551007 markings, 98773699 edges, 147942 markings/sec, 180 secs
lola: 37299639 markings, 101463209 edges, 149726 markings/sec, 185 secs
lola: 38028205 markings, 104091992 edges, 145713 markings/sec, 190 secs
lola: 38671037 markings, 106547955 edges, 128566 markings/sec, 195 secs
lola: 39235025 markings, 108736134 edges, 112798 markings/sec, 200 secs
lola: 39792239 markings, 110907384 edges, 111443 markings/sec, 205 secs
lola: 40511770 markings, 113233415 edges, 143906 markings/sec, 210 secs
lola: 41539184 markings, 115641837 edges, 205483 markings/sec, 215 secs
lola: 42391806 markings, 117878699 edges, 170524 markings/sec, 220 secs
lola: 43205497 markings, 120031715 edges, 162738 markings/sec, 225 secs
lola: 43920001 markings, 121936306 edges, 142901 markings/sec, 230 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((Cb + 1 <= Uf))) OR A (X (((CwG <= Cb) AND (2 <= SpA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Uf <= Cb)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (Uf <= Cb))
lola: processed formula length: 20
lola: 8 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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: result: no
lola: The Boolean predicate is false.
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (X (E (F (((Si <= SpA) OR (3 <= CwA))))))
lola: lola: ========================================
========================================lola:
SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U ((Si <= SpA) OR (3 <= CwA))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 4 will run for 275 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(A (G ((3 <= Ci))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U (Ci <= 2)))
lola: processed formula length: 29
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Uf <= MtF) OR E ((((2 <= SA) OR (SpA <= Cb)) U ((3 <= CR) AND (2 <= SF)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 300 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Uf <= MtF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Uf <= MtF)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((2 <= SA) OR (SpA <= Cb)) U ((3 <= CR) AND (2 <= SF))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((2 <= SA) OR (SpA <= Cb)) U ((3 <= CR) AND (2 <= SF)))
lola: processed formula length: 58
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 330 seconds at most (--localtimelimit=-1)
lola: lola: ========================================
========================================
lola: ...considering subproblem: NOT(A ((((1 <= Ci) OR (2 <= MpA)) U (2 <= SpA))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(((1 <= Ci) OR (2 <= MpA)) U (2 <= SpA)))
lola: processed formula length: 47
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 7 will run for 367 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F (E (G ((3 <= Si))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (Si <= 2)))))
lola: processed formula length: 39
lola: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 8 will run for 412 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((StF <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (StF <= 2)))))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 9 will run for 471 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= Uf)))
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: state equation: write sara problem file to ClientsAndServers-PT-N0020P3-CTLCardinality-9.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((CR + 1 <= CF) U ((1 <= MpA) OR (2 <= StR)))) OR (NOT(A (F ((3 <= CwG)))) OR (E (G ((1 <= SwA))) OR E (F ((2 <= SA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 550 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((CR + 1 <= CF) U ((1 <= MpA) OR (2 <= StR))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((CR + 1 <= CF) U ((1 <= MpA) OR (2 <= StR)))
lola: processed formula length: 47
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CwG <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= CwG)))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 11 will run for 660 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (((CwA <= Si) AND (2 <= CwG))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U ((CwA <= Si) AND (2 <= CwG))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 825 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((CG <= CF)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (CF + 1 <= CG)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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: 1080759 markings, 3127177 edges, 3096153000683503616 markings/sec, 0 secs
lola: 2024544 markings, 5970994 edges, 188757 markings/sec, 5 secs
lola: 2894801 markings, 8612944 edges, 174051 markings/sec, 10 secs
lola: 3724017 markings, 11178666 edges, 165843 markings/sec, 15 secs
lola: 4542218 markings, 13696070 edges, 163640 markings/sec, 20 secs
lola: 5333470 markings, 16159350 edges, 158250 markings/sec, 25 secs
lola: 6155188 markings, 18692191 edges, 164344 markings/sec, 30 secs
lola: 6967166 markings, 21194042 edges, 162396 markings/sec, 35 secs
lola: 7732822 markings, 23564128 edges, 153131 markings/sec, 40 secs
lola: 8469223 markings, 25909775 edges, 147280 markings/sec, 45 secs
lola: 9251732 markings, 28310588 edges, 156502 markings/sec, 50 secs
lola: 9953333 markings, 30559863 edges, 140320 markings/sec, 55 secs
lola: 10733623 markings, 32952427 edges, 156058 markings/sec, 60 secs
lola: 11442098 markings, 35226154 edges, 141695 markings/sec, 65 secs
lola: 12176540 markings, 37494267 edges, 146888 markings/sec, 70 secs
lola: 12916327 markings, 39836706 edges, 147957 markings/sec, 75 secs
lola: 13574196 markings, 41970834 edges, 131574 markings/sec, 80 secs
lola: 14360321 markings, 44363984 edges, 157225 markings/sec, 85 secs
lola: 15058673 markings, 46605221 edges, 139670 markings/sec, 90 secs
lola: 15713010 markings, 48733868 edges, 130867 markings/sec, 95 secs
lola: 16396943 markings, 51167316 edges, 136787 markings/sec, 100 secs
lola: 16832872 markings, 53536398 edges, 87186 markings/sec, 105 secs
lola: 17247317 markings, 55822622 edges, 82889 markings/sec, 110 secs
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((CwG <= SF) OR (3 <= MpA) OR (CwG <= StF)) AND A ((((SA <= SpG) OR (3 <= StF)) U ((3 <= CF) OR (1 <= SpG)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1062 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((CwG <= SF) OR (3 <= MpA) OR (CwG <= StF))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((CwG <= SF) OR (3 <= MpA) OR (CwG <= StF))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-CTLCardinality.task
lola: processed formula with 3 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 14 will run for 1593 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((SA <= SpG) OR (3 <= StF)) U ((3 <= CF) OR (1 <= SpG))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((SA <= SpG) OR (3 <= StF)) U ((3 <= CF) OR (1 <= SpG)))
lola: processed formula length: 60
lola: 1 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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: 1198674 markings, 3196615 edges, 239735 markings/sec, 0 secs
lola: 2199866 markings, 6080332 edges, 200238 markings/sec, 5 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 14 will run for 1588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((MpA <= SpA))) U (3 <= SpA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (MpA <= SpA)) U (3 <= SpA))
lola: processed formula length: 38
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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 15 will run for 3176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((SR <= StF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (StF + 1 <= SR))))
lola: processed formula length: 34
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0020P3-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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: RESULT
lola:
SUMMARY: yes unknown no yes yes yes yes no yes no yes no no yes no no
lola: ========================================
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-1 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0020P3-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496603926081

--------------------
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-N0020P3"
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-N0020P3.tgz
mv ClientsAndServers-PT-N0020P3 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-N0020P3, 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-149580920100246"
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 ;