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

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

=== Now, execution of the tool begins

BK_START 1496600970598


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


checking for too many tokens
===========================================================================================
ClientsAndServers-PT-N0005P0: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ ClientsAndServers-PT-N0005P0 @ 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-N0005P0-CTLFireability.task
lola: A (F (E (G ((FIREABLE(msG) AND FIREABLE(srA) AND (FIREABLE(maU) OR FIREABLE(srF))))))) : E (G (A (F (FIREABLE(crA))))) : A ((E (G ((FIREABLE(msA) OR FIREABLE(msG)))) U A (F ((FIREABLE(ssF) AND FIREABLE(msA)))))) : E (F ((FIREABLE(crA) AND (FIREABLE(crA) OR FIREABLE(srG) OR NOT FIREABLE(ssG) OR FIREABLE(csF) OR FIREABLE(csR))))) : E (G (E (F ((FIREABLE(ssR) OR FIREABLE(srG)))))) : (FIREABLE(csF) OR (FIREABLE(srF) OR A (F (E (X (FIREABLE(mrF))))))) : E ((E (G (FIREABLE(srR))) U A (F ((FIREABLE(crG) AND FIREABLE(srR)))))) : (FIREABLE(msA) OR E (G (E ((FIREABLE(mfU) U FIREABLE(csR)))))) : E (X (A (F (A (X (FIREABLE(crG))))))) : A (G ((A (F ((FIREABLE(ssR) OR FIREABLE(ssG)))) OR (FIREABLE(srR) OR E (F (FIREABLE(srA))))))) : A ((NOT(A (X (FIREABLE(srA)))) U NOT(E (F (FIREABLE(crG)))))) : NOT((((NOT FIREABLE(csF) AND NOT FIREABLE(crG)) OR E (G ((FIREABLE(srF) AND FIREABLE(crA))))) OR (E (F (NOT FIREABLE(csF))) AND A (F ((FIREABLE(ssA) OR FIREABLE(mrR))))))) : NOT(((NOT(A (G (FIREABLE(srG)))) AND NOT(A (G (FIREABLE(mrF))))) AND (NOT FIREABLE(crA) AND (FIREABLE(crA) OR A (F (FIREABLE(crA))))))) : ((NOT(E (X (NOT FIREABLE(mrF)))) OR A (F ((FIREABLE(maU) OR FIREABLE(ssF) OR (FIREABLE(srA) AND FIREABLE(srR)))))) OR A (F (FIREABLE(msA)))) : E (G (E (F (FIREABLE(csF))))) : NOT(A (F ((() AND A (F (FIREABLE(ssR)))))))
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 (F (E (G ((FIREABLE(msG) AND FIREABLE(srA) AND (FIREABLE(maU) OR FIREABLE(srF)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(A(TRUE U (NOT FIREABLE(msG) OR NOT FIREABLE(srA) OR (NOT FIREABLE(maU) AND NOT FIREABLE(srF))))))
lola: processed formula length: 112
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (FIREABLE(crA)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U FIREABLE(crA)))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (G ((FIREABLE(msA) OR FIREABLE(msG)))) U A (F ((FIREABLE(ssF) AND FIREABLE(msA))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(A(TRUE U (NOT FIREABLE(msA) AND NOT FIREABLE(msG)))) U A(TRUE U (FIREABLE(ssF) AND FIREABLE(msA))))
lola: processed formula length: 105
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(crA) AND (FIREABLE(crA) OR FIREABLE(srG) OR NOT FIREABLE(ssG) OR FIREABLE(csF) OR FIREABLE(csR)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F ((FIREABLE(ssR) OR FIREABLE(srG))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U (FIREABLE(ssR) OR FIREABLE(srG))))))
lola: processed formula length: 63
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(csF) OR (FIREABLE(srF) OR A (F (E (X (FIREABLE(mrF)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(csF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(csF)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.task
lola: processed formula with 0 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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(srF)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(srF)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.task
lola: processed formula with 0 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 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X (FIREABLE(mrF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX(FIREABLE(mrF)))
lola: processed formula length: 27
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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: SUBRESULT
lola: result: no
========================================
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (G (FIREABLE(srR))) U A (F ((FIREABLE(crG) AND FIREABLE(srR))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(NOT(A(TRUE U NOT FIREABLE(srR))) U A(TRUE U (FIREABLE(crG) AND FIREABLE(srR))))
lola: processed formula length: 81
lola: 4 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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: 1250269 markings, 3432685 edges, 3689348869717491712 markings/sec, 0 secs
lola: 2305276 markings, 6385699 edges, 211001 markings/sec, 5 secs
lola: 3419748 markings, 9574777 edges, 222894 markings/sec, 10 secs
lola: 4536471 markings, 12819474 edges, 223345 markings/sec, 15 secs
lola: 5611232 markings, 15976919 edges, 214952 markings/sec, 20 secs
lola: 6678791 markings, 19152915 edges, 213512 markings/sec, 25 secs
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 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(msA) OR E (G (E ((FIREABLE(mfU) U FIREABLE(csR))))))
========================================lola:
========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(msA)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(msA)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.task
lola: processed formula with 0 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 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E ((FIREABLE(mfU) U FIREABLE(csR)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(FIREABLE(mfU) U FIREABLE(csR)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (A (X (FIREABLE(crG)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U AX(FIREABLE(crG))))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 9 will run for 501 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((A (F ((FIREABLE(ssR) OR FIREABLE(ssG)))) OR (FIREABLE(srR) OR E (F (FIREABLE(srA)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U (NOT(A(TRUE U (FIREABLE(ssR) OR FIREABLE(ssG)))) AND (NOT FIREABLE(srR) AND NOT(E(TRUE U FIREABLE(srA)))))))
lola: processed formula length: 122
lola: 6 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 10 will run for 584 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((NOT(A (X (FIREABLE(srA)))) U NOT(E (F (FIREABLE(crG))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(EX(NOT FIREABLE(srA)) U NOT(E(TRUE U FIREABLE(crG))))
lola: processed formula length: 55
lola: 10 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 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 11 will run for 701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((((NOT FIREABLE(csF) AND NOT FIREABLE(crG)) OR E (G ((FIREABLE(srF) AND FIREABLE(crA))))) OR (E (F (NOT FIREABLE(csF))) AND A (F ((FIREABLE(ssA) OR FIREABLE(mrR)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 701 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(csF) OR FIREABLE(crG))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FIREABLE(csF) OR FIREABLE(crG))
lola: processed formula length: 33
lola: 14 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.task
lola: processed formula with 0 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: subprocess 12 will run for 877 seconds at most (--localtimelimit=-1)
lola: ========================================lola:
========================================
lola: ...considering subproblem: NOT(((NOT(A (G (FIREABLE(srG)))) AND NOT(A (G (FIREABLE(mrF))))) AND (NOT FIREABLE(crA) AND (FIREABLE(crA) OR A (F (FIREABLE(crA)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 877 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(srG)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1169 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (FIREABLE(mrF)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1754 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(crA)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(crA)
lola: processed formula length: 13
lola: 22 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.task
lola: processed formula with 0 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 15 will run for 3509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(crA)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(crA)
lola: processed formula length: 17
lola: 22 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 13 will run for 1169 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT(E (X (NOT FIREABLE(mrF)))) OR A (F ((FIREABLE(maU) OR FIREABLE(ssF) OR (FIREABLE(srA) AND FIREABLE(srR)))))) OR A (F (FIREABLE(msA))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1169 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (FIREABLE(mrF)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(FIREABLE(mrF))
lola: processed formula length: 17
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1754 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(maU) OR FIREABLE(ssF) OR (FIREABLE(srA) AND FIREABLE(srR)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(maU) OR FIREABLE(ssF) OR (FIREABLE(srA) AND FIREABLE(srR))))
lola: processed formula length: 81
lola: 5 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 14 will run for 1754 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (E (F (FIREABLE(csF)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(E(TRUE U FIREABLE(csF)))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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 15 will run for 3509 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(A (F ((() AND A (F (FIREABLE(ssR)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(ssR)))
lola: processed formula length: 28
lola: 8 rewrites
lola: formula mentions 0 of 25 places; total mentions: 0
lola: closed formula file ClientsAndServers-PT-N0005P0-CTLFireability.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: RESULT
lola:
SUMMARY: no no no yes yes no no yes no no no no unknown yes yes nolola:
========================================
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ClientsAndServers-PT-N0005P0-CTLFireability-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496601001474

--------------------
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-N0005P0"
export BK_EXAMINATION="CTLFireability"
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-N0005P0.tgz
mv ClientsAndServers-PT-N0005P0 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-N0005P0, examination is CTLFireability"
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-149580919900175"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.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 ;