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-3254
Executing tool lola
Input is S_ResAllocation-PT-R003C010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r148-csrt-149443432800076
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496439782265


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


checking for too many tokens
===========================================================================================
S_ResAllocation-PT-R003C010: translating PT formula CTLFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLFireability @ S_ResAllocation-PT-R003C010 @ 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: 100/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 60 places, 40 transitions, 30 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from ResAllocation-PT-R003C010-CTLFireability.task
lola: A (G ((FIREABLE(t_7_1) OR FIREABLE(t_2_0) OR NOT FIREABLE(t_6_3) OR (FIREABLE(t_0_2) AND FIREABLE(t_4_0)) OR NOT FIREABLE(t_3_1)))) : E (F (A ((FIREABLE(t_4_2) U (FIREABLE(t_3_1) AND FIREABLE(t_1_0)))))) : E (F (E (G (FIREABLE(t_9_2))))) : A (G ((E (X (NOT FIREABLE(t_8_3))) AND (A (F (FIREABLE(t_7_3))) OR A (F (FIREABLE(t_7_3))))))) : E (F (NOT((FIREABLE(t_7_2) OR E (F (FIREABLE(t_6_2))))))) : A (G (E (F ((NOT FIREABLE(t_8_0) AND NOT FIREABLE(t_5_0)))))) : NOT(E (X ((A (F (FIREABLE(t_5_1))) OR A (X (FIREABLE(t_9_2))))))) : ((E (X (A (F (FIREABLE(t_3_0))))) AND FIREABLE(t_7_3)) AND NOT(A (G ((NOT FIREABLE(t_4_2) AND NOT FIREABLE(t_0_3)))))) : E (F (A (G (E (X (FIREABLE(t_1_0))))))) : ((NOT((FIREABLE(t_0_1) OR A (F (FIREABLE(t_2_0))))) AND A ((NOT FIREABLE(t_3_3) U NOT FIREABLE(t_5_1)))) OR E ((E (X (FIREABLE(t_2_0))) U E (G (FIREABLE(t_1_0)))))) : E (F (NOT(E (F (NOT FIREABLE(t_9_0)))))) : (E (X (FIREABLE(t_0_0))) AND E (F (A (X (FIREABLE(t_3_3)))))) : NOT((E (F ((FIREABLE(t_5_1) AND FIREABLE(t_2_1) AND FIREABLE(t_1_2) AND FIREABLE(t_9_1)))) AND NOT(E (G ((FIREABLE(t_6_2) AND FIREABLE(t_1_2))))))) : NOT(((A (G ((FIREABLE(t_7_1) OR FIREABLE(t_3_1)))) OR FIREABLE(t_6_1)) OR E (F (FIREABLE(t_5_2))))) : (A (F ((FIREABLE(t_1_3) OR (FIREABLE(t_8_3) AND FIREABLE(t_3_2)) OR (NOT FIREABLE(t_4_1) AND FIREABLE(t_7_0))))) OR A (X (FIREABLE(t_0_3)))) : A (((A (F (FIREABLE(t_5_3))) AND E (G (FIREABLE(t_2_3)))) U (((FIREABLE(t_3_3) OR FIREABLE(t_2_3)) AND FIREABLE(t_0_1)) OR (FIREABLE(t_8_0) AND FIREABLE(t_0_1)))))
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 ((FIREABLE(t_7_1) OR FIREABLE(t_2_0) OR NOT FIREABLE(t_6_3) OR (FIREABLE(t_0_2) AND FIREABLE(t_4_0)) OR NOT FIREABLE(t_3_1))))
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 120 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 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A ((FIREABLE(t_4_2) U (FIREABLE(t_3_1) AND FIREABLE(t_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(FIREABLE(t_4_2) U (FIREABLE(t_3_1) AND FIREABLE(t_1_0))))
lola: processed formula length: 68
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (G (FIREABLE(t_9_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U NOT(A(TRUE U NOT FIREABLE(t_9_2))))
lola: processed formula length: 44
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((E (X (NOT FIREABLE(t_8_3))) AND (A (F (FIREABLE(t_7_3))) OR A (F (FIREABLE(t_7_3)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (X (NOT FIREABLE(t_8_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(EX(NOT FIREABLE(t_8_3)))))
lola: processed formula length: 43
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT((FIREABLE(t_7_2) OR E (F (FIREABLE(t_6_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (NOT FIREABLE(t_7_2) AND NOT(E(TRUE U FIREABLE(t_6_2)))))
lola: processed formula length: 66
lola: 8 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: A (G (E (F ((NOT FIREABLE(t_8_0) AND NOT FIREABLE(t_5_0))))))
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 (NOT FIREABLE(t_8_0) AND NOT FIREABLE(t_5_0))))))
lola: processed formula length: 75
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (X ((A (F (FIREABLE(t_5_1))) OR A (X (FIREABLE(t_9_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (NOT FIREABLE(t_5_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(NOT(A(TRUE U FIREABLE(t_5_1))))
lola: processed formula length: 34
lola: 15 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (E (X (NOT FIREABLE(t_9_2)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(EX(NOT FIREABLE(t_9_2)))
lola: processed formula length: 27
lola: 14 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (X (A (F (FIREABLE(t_3_0))))) AND FIREABLE(t_7_3)) AND NOT(A (G ((NOT FIREABLE(t_4_2) AND NOT FIREABLE(t_0_3))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (A (F (FIREABLE(t_3_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(A(TRUE U FIREABLE(t_3_0)))
lola: processed formula length: 29
lola: 6 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (E (X (FIREABLE(t_1_0)))))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking CTL
lola: processed formula: E(TRUE U NOT(E(TRUE U NOT(EX(FIREABLE(t_1_0))))))
lola: processed formula length: 49
lola: 3 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: 770229 markings, 5591975 edges, 3689348869717491712 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 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((NOT((FIREABLE(t_0_1) OR A (F (FIREABLE(t_2_0))))) AND A ((NOT FIREABLE(t_3_3) U NOT FIREABLE(t_5_1)))) OR E ((E (X (FIREABLE(t_2_0))) U E (G (FIREABLE(t_1_0))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t_0_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t_0_1)
lola: processed formula length: 19
lola: 6 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-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: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (NOT FIREABLE(t_2_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U FIREABLE(t_2_0)))
lola: processed formula length: 30
lola: 8 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 11 will run for 706 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((E (X (FIREABLE(t_2_0))) U E (G (FIREABLE(t_1_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(EX(FIREABLE(t_2_0)) U NOT(A(TRUE U NOT FIREABLE(t_1_0))))
lola: processed formula length: 59
lola: 10 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: ========================================
lola: subprocess 10 will run for 588 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (NOT(E (F (NOT FIREABLE(t_9_0))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U NOT FIREABLE(t_9_0))))
lola: processed formula length: 44
lola: 6 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 11 will run for 705 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (FIREABLE(t_0_0))) AND E (F (A (X (FIREABLE(t_3_3))))))
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: E (X (FIREABLE(t_0_0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(FIREABLE(t_0_0))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 12 will run for 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X (FIREABLE(t_3_3)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX(FIREABLE(t_3_3)))
lola: processed formula length: 29
lola: 2 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: lola: result: yes
========================================
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (F ((FIREABLE(t_5_1) AND FIREABLE(t_2_1) AND FIREABLE(t_1_2) AND FIREABLE(t_9_1)))) AND NOT(E (G ((FIREABLE(t_6_2) AND FIREABLE(t_1_2)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 882 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t_5_1) OR NOT FIREABLE(t_2_1) OR NOT FIREABLE(t_1_2) OR NOT FIREABLE(t_9_1))))
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 120 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 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIREABLE(t_6_2) AND FIREABLE(t_1_2))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT FIREABLE(t_6_2) OR NOT FIREABLE(t_1_2))))
lola: processed formula length: 60
lola: 12 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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 13 will run for 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(((A (G ((FIREABLE(t_7_1) OR FIREABLE(t_3_1)))) OR FIREABLE(t_6_1)) OR E (F (FIREABLE(t_5_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1176 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t_7_1) AND NOT FIREABLE(t_3_1))))
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 120 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 14 will run for 1764 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT FIREABLE(t_6_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: NOT FIREABLE(t_6_1)
lola: processed formula length: 19
lola: 10 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-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: subprocess 15 will run for 3529 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t_5_2)))
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 120 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1764 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F ((FIREABLE(t_1_3) OR (FIREABLE(t_8_3) AND FIREABLE(t_3_2)) OR (NOT FIREABLE(t_4_1) AND FIREABLE(t_7_0))))) OR A (X (FIREABLE(t_0_3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1764 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((FIREABLE(t_1_3) OR (FIREABLE(t_8_3) AND FIREABLE(t_3_2)) OR (NOT FIREABLE(t_4_1) AND FIREABLE(t_7_0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (FIREABLE(t_1_3) OR (FIREABLE(t_8_3) AND FIREABLE(t_3_2)) OR (NOT FIREABLE(t_4_1) AND FIREABLE(t_7_0))))
lola: processed formula length: 115
lola: 1 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: subprocess 15 will run for 3529 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (((A (F (FIREABLE(t_5_3))) AND E (G (FIREABLE(t_2_3)))) U (((FIREABLE(t_3_3) OR FIREABLE(t_2_3)) AND FIREABLE(t_0_1)) OR (FIREABLE(t_8_0) AND FIREABLE(t_0_1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((A(TRUE U FIREABLE(t_5_3)) AND NOT(A(TRUE U NOT FIREABLE(t_2_3)))) U (((FIREABLE(t_3_3) OR FIREABLE(t_2_3)) AND FIREABLE(t_0_1)) OR (FIREABLE(t_8_0) AND FIREABLE(t_0_1))))
lola: processed formula length: 175
lola: 4 rewrites
lola: formula mentions 0 of 60 places; total mentions: 0
lola: closed formula file ResAllocation-PT-R003C010-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 120 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: RESULT
lola:
SUMMARY: no yes yes no yes yes yes no no yes no yes no no yes no
lola: ========================================
FORMULA ResAllocation-PT-R003C010-CTLFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA ResAllocation-PT-R003C010-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496439793746

--------------------
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_ResAllocation-PT-R003C010"
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_ResAllocation-PT-R003C010.tgz
mv S_ResAllocation-PT-R003C010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_ResAllocation-PT-R003C010, 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 r148-csrt-149443432800076"
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 ;