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-2979
Executing tool lola
Input is CircularTrains-PT-012, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014kn-qhx2-146347846200058
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463489034158

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLFireability @ CircularTrains-PT-012
FORMULA CircularTrains-PT-012-CTLFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CircularTrains-PT-012-CTLFireability-15 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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: 36/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 24 places, 12 transitions, 11 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 24 transition conflict sets
lola: TASK
lola: reading formula from CircularTrains-PT-012-CTLFireability.task
lola: read: AG (FIREABLE(t2_to_3)) : ((((!((FIREABLE(t10_to_11) OR FIREABLE(t11_to_12))) OR EF (FIREABLE(t5_to_6))) AND !(((FIREABLE(t1_to_2) AND FIREABLE(t5_to_6)) AND FIREABLE(t8_to_9)))) AND EF (EG (FIREABLE(t12_to_1)))) OR (EF (EF (FIREABLE(t4_to_5))) AND (FIREABLE(t9_to_10) OR (!(!(FIREABLE(t10_to_11))) OR EF (FIREABLE(t8_to_9)))))) : (E(((FIREABLE(t6_to_7) AND FIREABLE(t4_to_5)) AND (FIREABLE(t9_to_10) ... (shortened)
lola: formula length: 1825
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (FIREABLE(t2_to_3))
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 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((((! FIREABLE(t10_to_11) AND ! FIREABLE(t11_to_12)) OR EF (FIREABLE(t5_to_6))) AND ((! FIREABLE(t1_to_2) OR (! FIREABLE(t5_to_6) OR ! FIREABLE(t8_to_9))) AND EF (EG (FIREABLE(t12_to_1))))) OR (EF (FIREABLE(t4_to_5)) AND (FIREABLE(t9_to_10) OR (FIREABLE(t10_to_11) OR EF (FIREABLE(t8_to_9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (! FIREABLE(t10_to_11) AND ! FIREABLE(t11_to_12))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (! FIREABLE(t1_to_2) OR (! FIREABLE(t5_to_6) OR ! FIREABLE(t8_to_9)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG (FIREABLE(t12_to_1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !(FIREABLE(t12_to_1)))))
lola: processed formula length: 44
lola: 109 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t4_to_5))
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 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t9_to_10)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((FIREABLE(t6_to_7) AND (FIREABLE(t4_to_5) AND (FIREABLE(t9_to_10) AND FIREABLE(t9_to_10)))) U EG (FIREABLE(t2_to_3))) AND ((FIREABLE(t12_to_1) AND ((! FIREABLE(t10_to_11) OR (FIREABLE(t11_to_12) OR FIREABLE(t7_to_8))) AND ((FIREABLE(t6_to_7) OR FIREABLE(t11_to_12)) AND (FIREABLE(t2_to_3) OR FIREABLE(t5_to_6))))) OR ((FIREABLE(t1_to_2) OR FIREABLE(t2_to_3)) AND FIREABLE(t6_to_7))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((FIREABLE(t6_to_7) AND (FIREABLE(t4_to_5) AND (FIREABLE(t9_to_10) AND FIREABLE(t9_to_10)))) U EG (FIREABLE(t2_to_3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((FIREABLE(t6_to_7) AND (FIREABLE(t4_to_5) AND (FIREABLE(t9_to_10) AND FIREABLE(t9_to_10)))) U !(A(TRUE U !(FIREABLE(t2_to_3)))))
lola: processed formula length: 130
lola: 109 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t5_to_6) OR FIREABLE(t3_to_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t4_to_5) OR ((FIREABLE(t4_to_5) AND FIREABLE(t1_to_2)) OR ((FIREABLE(t5_to_6) AND FIREABLE(t3_to_4)) OR AG (! FIREABLE(t1_to_2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t4_to_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t4_to_5) AND FIREABLE(t1_to_2))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t5_to_6) AND FIREABLE(t3_to_4))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (! FIREABLE(t1_to_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 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF (AX (! FIREABLE(t3_to_4))) OR EF (FIREABLE(t4_to_5)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (AX (! FIREABLE(t3_to_4)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U AX(! FIREABLE(t3_to_4)))
lola: processed formula length: 33
lola: 109 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(EF (! FIREABLE(t6_to_7)) U (! FIREABLE(t7_to_8) AND (! FIREABLE(t11_to_12) AND (! FIREABLE(t11_to_12) AND ! FIREABLE(t4_to_5)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(E(TRUE U ! FIREABLE(t6_to_7)) U (! FIREABLE(t7_to_8) AND (! FIREABLE(t11_to_12) AND (! FIREABLE(t11_to_12) AND ! FIREABLE(t4_to_5)))))
lola: processed formula length: 136
lola: 109 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((EF (FIREABLE(t6_to_7)) OR ((! FIREABLE(t12_to_1) AND ! FIREABLE(t2_to_3)) OR EF (FIREABLE(t5_to_6)))) AND FIREABLE(t2_to_3)) OR AX ((! FIREABLE(t7_to_8) AND (! FIREABLE(t8_to_9) AND (! FIREABLE(t3_to_4) AND ! FIREABLE(t5_to_6))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (FIREABLE(t6_to_7))
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 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t2_to_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((! FIREABLE(t7_to_8) AND (! FIREABLE(t8_to_9) AND (! FIREABLE(t3_to_4) AND ! FIREABLE(t5_to_6)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((! FIREABLE(t7_to_8) AND (! FIREABLE(t8_to_9) AND (! FIREABLE(t3_to_4) AND ! FIREABLE(t5_to_6)))))
lola: processed formula length: 101
lola: 108 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(t4_to_5) AND AX (EX ((FIREABLE(t3_to_4) AND FIREABLE(t4_to_5)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t4_to_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t1_to_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AG ((FIREABLE(t2_to_3) OR FIREABLE(t5_to_6))) OR AX (AG ((FIREABLE(t4_to_5) AND FIREABLE(t10_to_11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t2_to_3) OR FIREABLE(t5_to_6)))
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 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AG ((FIREABLE(t4_to_5) AND FIREABLE(t10_to_11))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(E(TRUE U !((FIREABLE(t4_to_5) AND FIREABLE(t10_to_11))))))
lola: processed formula length: 63
lola: 109 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(t10_to_11) OR ! FIREABLE(t4_to_5)))
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 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(! FIREABLE(t10_to_11) R ! FIREABLE(t7_to_8)) OR (EG (FIREABLE(t1_to_2)) OR AG ((FIREABLE(t10_to_11) OR FIREABLE(t10_to_11)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(! FIREABLE(t10_to_11) R ! FIREABLE(t7_to_8))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(!(! FIREABLE(t10_to_11)) U !(! FIREABLE(t7_to_8))))
lola: processed formula length: 55
lola: 108 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (FIREABLE(t6_to_7))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(FIREABLE(t6_to_7))))
lola: processed formula length: 33
lola: 108 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (FIREABLE(t8_to_9))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U FIREABLE(t8_to_9))
lola: processed formula length: 27
lola: 108 rewrites
lola: formula mentions 0 of 24 places; total mentions: 0
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 44 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FIREABLE(t3_to_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CircularTrains-PT-012-CTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: RESULT
lola: summary: no yes no yes no yes yes no no no no no yes no yes yes

BK_STOP 1463489034547

--------------------
content from 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="CircularTrains-PT-012"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/fko/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/CircularTrains-PT-012.tgz
mv CircularTrains-PT-012 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is CircularTrains-PT-012, 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 r014kn-qhx2-146347846200058"
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 ;