About the Execution of LoLA for S_SwimmingPool-PT-01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
124.200 | 1655.00 | 1103.00 | 25.30 | FFTFFFFFTTTFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Waiting for the VM to be ready (probing ssh)
..............
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_SwimmingPool-PT-01, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464100166
=====================================================================
--------------------
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 SwimmingPool-PT-01-CTLFireability-0
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-1
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-10
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-11
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-12
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-13
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-14
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-15
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-2
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-3
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-4
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-5
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-6
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-7
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-8
FORMULA_NAME SwimmingPool-PT-01-CTLFireability-9
=== Now, execution of the tool begins
BK_START 1496563975014
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_SwimmingPool-PT-01: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_SwimmingPool-PT-01: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_SwimmingPool-PT-01 @ 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: 16/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 9 places, 7 transitions, 6 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 9 transition conflict sets
lola: TASK
lola: reading formula from SwimmingPool-PT-01-CTLFireability.task
lola: E (F (E (G ((NOT FIREABLE(GetK) AND FIREABLE(RKey)))))) : A ((A (G (FIREABLE(Enter))) U (A (X (FIREABLE(GetB))) OR FIREABLE(GetK)))) : A (G (E (F (A (X (FIREABLE(RBag))))))) : E (G ((A (F ((FIREABLE(RelK) OR FIREABLE(GetK2)))) OR ((FIREABLE(RelK) AND (FIREABLE(RBag))) OR A (G (FIREABLE(RelK))))))) : E (X (NOT((A (G (FIREABLE(Enter))) AND FIREABLE(GetK))))) : E (X (NOT(A (F (FIREABLE(RBag)))))) : A (F (A (G (A (F (FIREABLE(Enter))))))) : A (F ((((FIREABLE(GetK) OR FIREABLE(Enter) OR (FIREABLE(RBag) AND FIREABLE(RKey))) AND E (X (FIREABLE(RelK)))) OR A (G (FIREABLE(Enter)))))) : A (F (((NOT FIREABLE(GetK) OR FIREABLE(RelK)) AND NOT(A (F (FIREABLE(RBag))))))) : A (X (A (F (A (G (FIREABLE(Enter))))))) : ((A (F (A (F (FIREABLE(GetB))))) OR (E (G ((FIREABLE(RelK) AND FIREABLE(GetK)))) OR A ((FIREABLE(GetK) U FIREABLE(GetB))))) AND NOT FIREABLE(GetK)) : E (F ((NOT(A (F (FIREABLE(GetK2)))) AND E (F (FIREABLE(RBag)))))) : (NOT(A ((NOT FIREABLE(RBag) U FIREABLE(RBag)))) OR FIREABLE(GetB)) : (FIREABLE(RBag) OR E (X (E (G (NOT FIREABLE(GetB)))))) : E (G (NOT FIREABLE(RBag))) : E (G (((NOT FIREABLE(GetK2) AND FIREABLE(GetB) AND (NOT FIREABLE(RKey) OR NOT FIREABLE(GetB))) OR NOT(E (X (FIREABLE(GetK2)))))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((NOT FIREABLE(GetK) AND FIREABLE(RKey))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U (FIREABLE(GetK) OR NOT FIREABLE(RKey)))))
lola: processed formula length: 64
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: A ((A (G (FIREABLE(Enter))) U (A (X (FIREABLE(GetB))) OR FIREABLE(GetK))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(NOT(E(TRUE U NOT FIREABLE(Enter))) U (AX(FIREABLE(GetB)) OR FIREABLE(GetK)))
lola: processed formula length: 78
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (F (A (X (FIREABLE(RBag)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(E(TRUE U AX(FIREABLE(RBag))))))
lola: processed formula length: 48
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((FIREABLE(RelK) OR FIREABLE(GetK2)))) OR ((FIREABLE(RelK) AND (FIREABLE(RBag))) OR A (G (FIREABLE(RelK)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (FIREABLE(RelK) OR FIREABLE(GetK2)))) AND ((NOT FIREABLE(RelK) OR (NOT FIREABLE(RBag))) AND E(TRUE U NOT FIREABLE(RelK))))))
lola: processed formula length: 153
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT((A (G (FIREABLE(Enter))) AND FIREABLE(GetK)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (F (NOT FIREABLE(Enter)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(E(TRUE U NOT FIREABLE(Enter)))
lola: processed formula length: 33
lola: 8 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (F (FIREABLE(RBag))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: ========================================
lola: processed formula: EX(NOT(A(TRUE U FIREABLE(RBag))))
lola: processed formula length: 33
lola: 6 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G (A (F (FIREABLE(Enter)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U NOT(A(TRUE U FIREABLE(Enter))))))
lola: processed formula length: 55
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((FIREABLE(GetK) OR FIREABLE(Enter) OR (FIREABLE(RBag) AND FIREABLE(RKey))) AND E (X (FIREABLE(RelK)))) OR A (G (FIREABLE(Enter))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((FIREABLE(GetK) OR FIREABLE(Enter) OR (FIREABLE(RBag) AND FIREABLE(RKey))) AND EX(FIREABLE(RelK))) OR NOT(E(TRUE U NOT FIREABLE(Enter)))))
lola: processed formula length: 151
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((NOT FIREABLE(GetK) OR FIREABLE(RelK)) AND NOT(A (F (FIREABLE(RBag)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((NOT FIREABLE(GetK) OR FIREABLE(RelK)) AND NOT(A(TRUE U FIREABLE(RBag)))))
lola: processed formula length: 85
lola: 6 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (A (F (A (G (FIREABLE(Enter)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U NOT(E(TRUE U NOT FIREABLE(Enter)))))
lola: processed formula length: 48
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (F (A (F (FIREABLE(GetB))))) OR (E (G ((FIREABLE(RelK) AND FIREABLE(GetK)))) OR A ((FIREABLE(GetK) U FIREABLE(GetB))))) AND NOT FIREABLE(GetK))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (FIREABLE(GetB)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(GetB))
lola: processed formula length: 24
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(GetK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(GetK)
lola: processed formula length: 18
lola: 1 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT(A (F (FIREABLE(GetK2)))) AND E (F (FIREABLE(RBag))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT(A(TRUE U FIREABLE(GetK2))) AND E(TRUE U FIREABLE(RBag))))
lola: processed formula length: 71
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A ((NOT FIREABLE(RBag) U FIREABLE(RBag)))) OR FIREABLE(GetB))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((FIREABLE(RBag) R NOT FIREABLE(RBag)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(NOT FIREABLE(RBag) U FIREABLE(RBag)))
lola: processed formula length: 43
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(GetB)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(GetB)
lola: processed formula length: 14
lola: 4 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-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: ========================================
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(RBag) OR E (X (E (G (NOT FIREABLE(GetB))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: FIREABLE(RBag)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FIREABLE(RBag)
lola: processed formula length: 14
lola: 0 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (E (G (NOT FIREABLE(GetB)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U FIREABLE(GetB))))
lola: processed formula length: 33
lola: 3 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 14 will run for 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(RBag)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(RBag)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((NOT FIREABLE(GetK2) AND FIREABLE(GetB) AND (NOT FIREABLE(RKey) OR NOT FIREABLE(GetB))) OR NOT(E (X (FIREABLE(GetK2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((FIREABLE(GetK2) OR NOT FIREABLE(GetB) OR (FIREABLE(RKey) AND FIREABLE(GetB))) AND NOT(AX(NOT FIREABLE(GetK2))))))
lola: processed formula length: 130
lola: 7 rewrites
lola: formula mentions 0 of 9 places; total mentions: 0
lola: closed formula file SwimmingPool-PT-01-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 24 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: RESULT
lola:
SUMMARY: no no yes yes yes no yes yes no no yes no no no no no
FORMULA SwimmingPool-PT-01-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA SwimmingPool-PT-01-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496563976669
--------------------
content from stderr:
----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="S_SwimmingPool-PT-01"
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/S_SwimmingPool-PT-01.tgz
mv S_SwimmingPool-PT-01 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_SwimmingPool-PT-01, 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 r158-ebro-149443464100166"
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 '
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 ;