About the Execution of LoLA for ClientsAndServers-PT-N0010P1
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15947.290 | 465265.00 | 466732.00 | 432.00 | FTTFFT?TTTTTFFTF | 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-N0010P1, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-ebro-149580920000201
=====================================================================
--------------------
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-N0010P1-CTLCardinality-0
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-1
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-10
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-11
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-12
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-13
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-14
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-15
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-2
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-3
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-4
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-5
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-6
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-7
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-8
FORMULA_NAME ClientsAndServers-PT-N0010P1-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1496601569598
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
ClientsAndServers-PT-N0010P1: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0010P1: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ ClientsAndServers-PT-N0010P1 @ 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-N0010P1-CTLCardinality.task
lola: A (G (((2 <= Si) AND (1 <= Si)))) : (E (F (E (X ((3 <= StF))))) AND (E (G (((Si <= CR) AND (Mi <= SwG)))) OR NOT(E (G ((MwU <= MtF)))))) : (A (X (E (F ((3 <= MpA))))) OR E (F ((((3 <= StF) OR (Cb <= SwA)) AND (2 <= Cb))))) : (E (X (E (F ((Mi <= MwU))))) OR (Uf <= MpG)) : E (F (((Cb + 1 <= CR) AND (Si + 1 <= SR)))) : E (F (A (G ((1 <= CwA))))) : A (F (A (X ((SpG + 1 <= SpA))))) : (A (((SG <= 2) U ((CG <= CwA) AND (Cb <= SA)))) AND NOT(E (G ((CwA <= Cb))))) : (E (X (E (G ((2 <= Ci))))) OR E (G (((SF <= Ci) OR (1 <= StR) OR (1 <= SF))))) : A (X (NOT(E (G ((SpA <= CwA)))))) : NOT((E (X ((2 <= SwA))) OR (((CF <= 2) OR (CA <= 2)) AND A (F ((3 <= SA)))))) : ((2 <= SA) OR NOT((A (F ((MtF <= SwG))) AND E (G (TRUE))))) : A (G (((MtF <= 1) OR A (X ((Mi <= MtF)))))) : E (F (((2 <= MpA) OR (Ci <= Uf)))) : A (G (E (F (((3 <= Cb) AND (CwG <= SpG)))))) : A (F (E (G (((2 <= StR) OR (MpA <= CG))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= Si) AND (1 <= Si))))
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 2 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to ClientsAndServers-PT-N0010P1-CTLCardinality.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: lola: state equation: calling and running sara========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (E (X ((3 <= StF))))) AND (E (G (((Si <= CR) AND (Mi <= SwG)))) OR NOT(E (G ((MwU <= MtF))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (X ((3 <= StF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U EX((3 <= StF)))
lola: processed formula length: 24
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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).
sara: try reading problem file ClientsAndServers-PT-N0010P1-CTLCardinality.sara.
lola: 809052 markings, 2536827 edges, 161810 markings/sec, 0 secs
lola: 1446350 markings, 4669738 edges, 127460 markings/sec, 5 secs
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 (((Si <= CR) AND (Mi <= SwG))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((CR + 1 <= Si) OR (SwG + 1 <= Mi))))
lola: processed formula length: 51
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((MtF + 1 <= MwU)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (MtF + 1 <= MwU))
lola: processed formula length: 26
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X (E (F ((3 <= MpA))))) OR E (F ((((3 <= StF) OR (Cb <= SwA)) AND (2 <= Cb)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (F ((3 <= MpA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(E(TRUE U (3 <= MpA)))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((Mi <= MwU))))) OR (Uf <= MpG))
lola: ========================================
lola: SUBTASK
lola: ========================================lola:
checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((Mi <= MwU)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U (Mi <= MwU)))
lola: processed formula length: 25
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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 4 will run for 293 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Cb + 1 <= CR) AND (Si + 1 <= SR))))
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 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G ((1 <= CwA)))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: lola: ========================================
possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U (CwA <= 0))))
lola: processed formula length: 35
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (X ((SpG + 1 <= SpA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX((SpG + 1 <= SpA)))
lola: processed formula length: 30
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((SG <= 2) U ((CG <= CwA) AND (Cb <= SA)))) AND NOT(E (G ((CwA <= Cb)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 391 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((SG <= 2) U ((CG <= CwA) AND (Cb <= SA))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((SG <= 2) U ((CG <= CwA) AND (Cb <= SA)))
lola: processed formula length: 43
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((Cb + 1 <= CwA)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (Cb + 1 <= CwA))
lola: processed formula length: 25
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (E (G ((2 <= Ci))))) OR E (G (((SF <= Ci) OR (1 <= StR) OR (1 <= SF)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G ((2 <= Ci)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (Ci <= 1))))
lola: processed formula length: 28
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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: subprocess 9 will run for 503 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (NOT(E (G ((SpA <= CwA))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U (CwA + 1 <= SpA)))
lola: processed formula length: 30
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 68 bytes per marking, with 0 unused bits
lola: 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 10 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (X ((2 <= SwA))) OR (((CF <= 2) OR (CA <= 2)) AND A (F ((3 <= SA))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 587 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((SwA <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((SwA <= 1))
lola: processed formula length: 14
lola: 10 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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 0 significant temporal operators and needs 0 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 11 will run for 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= CF) AND (3 <= CA))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= CF) AND (3 <= CA))
lola: processed formula length: 25
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-CTLCardinality.task
lola: processed formula with 2 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 12 will run for 881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SA <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= SA)))
lola: processed formula length: 24
lola: 11 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= SA) OR NOT((A (F ((MtF <= SwG))) AND E (G (TRUE)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 705 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: 7 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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 12 will run for 881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SwG + 1 <= MtF)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (MtF <= SwG)))
lola: processed formula length: 27
lola: 9 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 12 will run for 881 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((MtF <= 1) OR A (X ((Mi <= MtF))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U ((2 <= MtF) AND NOT(AX((Mi <= MtF))))))
lola: processed formula length: 52
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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: 984717 markings, 3116732 edges, 196866 markings/sec, 0 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 1174 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= MpA) OR (Ci <= Uf))))
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 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1761 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (((3 <= Cb) AND (CwG <= SpG))))))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U ((3 <= Cb) AND (CwG <= SpG))))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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: 1632622 markings, 3077003 edges, 3689348869717491712 markings/sec, 0 secs
lola: 3064403 markings, 5706487 edges, 286356 markings/sec, 5 secs
lola: 4459600 markings, 8240622 edges, 279039 markings/sec, 10 secs
lola: 5834308 markings, 10725385 edges, 274942 markings/sec, 15 secs
lola: 7189116 markings, 13156306 edges, 270962 markings/sec, 20 secs
lola: 8529100 markings, 15552459 edges, 267997 markings/sec, 25 secs
lola: 9859488 markings, 17939433 edges, 266078 markings/sec, 30 secs
lola: 11175833 markings, 20280831 edges, 263269 markings/sec, 35 secs
lola: 12480434 markings, 22569537 edges, 260920 markings/sec, 40 secs
lola: 13775079 markings, 24880235 edges, 258929 markings/sec, 45 secs
lola: 15062849 markings, 27150910 edges, 257554 markings/sec, 50 secs
lola: 16325539 markings, 29393076 edges, 252538 markings/sec, 55 secs
lola: 17594796 markings, 31631080 edges, 253851 markings/sec, 60 secs
lola: 18864784 markings, 33854045 edges, 253998 markings/sec, 65 secs
lola: 20123960 markings, 36060503 edges, 251835 markings/sec, 70 secs
lola: 21378000 markings, 38275869 edges, 250808 markings/sec, 75 secs
lola: 22612350 markings, 40443209 edges, 246870 markings/sec, 80 secs
lola: 23834066 markings, 42587705 edges, 244343 markings/sec, 85 secs
lola: 24893552 markings, 44435280 edges, 211897 markings/sec, 90 secs
lola: 25964805 markings, 46305349 edges, 214251 markings/sec, 95 secs
lola: 27047939 markings, 48201833 edges, 216627 markings/sec, 100 secs
lola: 28139812 markings, 50110633 edges, 218375 markings/sec, 105 secs
lola: 29233726 markings, 52017486 edges, 218783 markings/sec, 110 secs
lola: 30324799 markings, 53917525 edges, 218215 markings/sec, 115 secs
lola: 31430486 markings, 55856230 edges, 221137 markings/sec, 120 secs
lola: 32529408 markings, 57761839 edges, 219784 markings/sec, 125 secs
lola: 33633438 markings, 59682536 edges, 220806 markings/sec, 130 secs
lola: 34730317 markings, 61591000 edges, 219376 markings/sec, 135 secs
lola: 35833037 markings, 63494361 edges, 220544 markings/sec, 140 secs
lola: 36925662 markings, 65386245 edges, 218525 markings/sec, 145 secs
lola: 38029795 markings, 67319720 edges, 220827 markings/sec, 150 secs
lola: 39132052 markings, 69240547 edges, 220451 markings/sec, 155 secs
lola: 40229413 markings, 71147106 edges, 219472 markings/sec, 160 secs
lola: 41348571 markings, 73092982 edges, 223832 markings/sec, 165 secs
lola: 42456715 markings, 75016037 edges, 221629 markings/sec, 170 secs
lola: 43558563 markings, 76928314 edges, 220370 markings/sec, 175 secs
lola: 44652122 markings, 78821061 edges, 218712 markings/sec, 180 secs
lola: 45755525 markings, 80739960 edges, 220681 markings/sec, 185 secs
lola: 46858127 markings, 82639312 edges, 220520 markings/sec, 190 secs
lola: 47963091 markings, 84540392 edges, 220993 markings/sec, 195 secs
lola: 49072620 markings, 86469211 edges, 221906 markings/sec, 200 secs
lola: 50178103 markings, 88382612 edges, 221097 markings/sec, 205 secs
lola: 51282827 markings, 90297785 edges, 220945 markings/sec, 210 secs
lola: 52378538 markings, 92189661 edges, 219142 markings/sec, 215 secs
lola: 53468411 markings, 94067020 edges, 217975 markings/sec, 220 secs
lola: 54578249 markings, 95995622 edges, 221968 markings/sec, 225 secs
lola: 55680298 markings, 97900433 edges, 220410 markings/sec, 230 secs
lola: 56782110 markings, 99800382 edges, 220362 markings/sec, 235 secs
lola: 57890593 markings, 101702045 edges, 221697 markings/sec, 240 secs
lola: 59001336 markings, 103616507 edges, 222149 markings/sec, 245 secs
lola: 60110614 markings, 105536108 edges, 221856 markings/sec, 250 secs
lola: 61217752 markings, 107446521 edges, 221428 markings/sec, 255 secs
lola: 62319100 markings, 109341210 edges, 220270 markings/sec, 260 secs
lola: 63429286 markings, 111260560 edges, 222037 markings/sec, 265 secs
lola: 64533515 markings, 113159541 edges, 220846 markings/sec, 270 secs
lola: 65637205 markings, 115046944 edges, 220738 markings/sec, 275 secs
lola: 66729610 markings, 116933809 edges, 218481 markings/sec, 280 secs
lola: 67816654 markings, 118796025 edges, 217409 markings/sec, 285 secs
lola: 68903156 markings, 120655643 edges, 217300 markings/sec, 290 secs
lola: 69987939 markings, 122522655 edges, 216957 markings/sec, 295 secs
lola: 71078372 markings, 124392366 edges, 218087 markings/sec, 300 secs
lola: 72169616 markings, 126261722 edges, 218249 markings/sec, 305 secs
lola: 73260940 markings, 128127002 edges, 218265 markings/sec, 310 secs
lola: 74357399 markings, 129998407 edges, 219292 markings/sec, 315 secs
lola: 75463417 markings, 131901220 edges, 221204 markings/sec, 320 secs
lola: 76566947 markings, 133787648 edges, 220706 markings/sec, 325 secs
lola: 77674627 markings, 135685680 edges, 221536 markings/sec, 330 secs
lola: 78779203 markings, 137577781 edges, 220915 markings/sec, 335 secs
lola: 79878887 markings, 139465335 edges, 219937 markings/sec, 340 secs
lola: 80983588 markings, 141367287 edges, 220940 markings/sec, 345 secs
lola: 82083209 markings, 143259305 edges, 219924 markings/sec, 350 secs
lola: 83170760 markings, 145090178 edges, 217510 markings/sec, 355 secs
lola: 84268345 markings, 146979268 edges, 219517 markings/sec, 360 secs
lola: 85365447 markings, 148865355 edges, 219420 markings/sec, 365 secs
lola: 86457587 markings, 150724689 edges, 218428 markings/sec, 370 secs
lola: 87556757 markings, 152609238 edges, 219834 markings/sec, 375 secs
lola: 88657596 markings, 154505172 edges, 220168 markings/sec, 380 secs
lola: 89754217 markings, 156387928 edges, 219324 markings/sec, 385 secs
lola: 90842676 markings, 158242241 edges, 217692 markings/sec, 390 secs
lola: 91948040 markings, 160141046 edges, 221073 markings/sec, 395 secs
lola: 93038389 markings, 162012303 edges, 218070 markings/sec, 400 secs
lola: 94131711 markings, 163871726 edges, 218664 markings/sec, 405 secs
lola: 95220092 markings, 165726453 edges, 217676 markings/sec, 410 secs
lola: 96314153 markings, 167608148 edges, 218812 markings/sec, 415 secs
lola: 97409324 markings, 169477292 edges, 219034 markings/sec, 420 secs
lola: 98500532 markings, 171333783 edges, 218242 markings/sec, 425 secs
lola: 99585193 markings, 173176133 edges, 216932 markings/sec, 430 secs
lola: 100544723 markings, 174816752 edges, 191906 markings/sec, 435 secs
lola: 101163213 markings, 175888925 edges, 123698 markings/sec, 440 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 3075 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (G (((2 <= StR) OR (MpA <= CG))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U ((StR <= 1) AND (CG + 1 <= MpA)))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0010P1-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: RESULT
lola:
SUMMARY: no yes yes yes yes yes no no yes no yes no no yes unknown yes
lola: ========================================
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0010P1-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496602034863
--------------------
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-N0010P1"
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-N0010P1.tgz
mv ClientsAndServers-PT-N0010P1 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-N0010P1, 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-149580920000201"
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 '
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 ;