fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r062kn-blw3-146358896700039
Last Updated
June 30, 2016

About the Execution of LoLa for IBM5964-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
117.570 204.00 20.00 0.00 FFTTFF?FFTFFFTTF 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-2979
Executing tool lola
Input is IBM5964-PT-none, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358896700039
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1463590361352

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ IBM5964-PT-none
FORMULA IBM5964-PT-none-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IBM5964-PT-none-CTLCardinality-14 CANNOT_COMPUTE
FORMULA IBM5964-PT-none-CTLCardinality-15 FALSE 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: 402/65536 symbol table entries, 1 collisions
lola: preprocessing...
lola: finding significant places
lola: 263 places, 139 transitions, 135 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 133 transition conflict sets
lola: TASK
lola: reading formula from IBM5964-PT-none-CTLCardinality.task
lola: read: AF (AF ((3 <= callToTask_s00001746_input_s00000935 AND decision_s00001286_activated <= callToTask_s00002183_inputCriterion_s00000937_used))) : AX (A(decision_s00001286_activated <= join_s00001295_input_s00000985 U 3 <= callToProcess_s00004075_output_s00000938)) : (AF (!((callToTask_s00001746_output_s00000956 <= join_s00001295_input_s00000987 OR 1 <= callToProcess_s00002538_input_s00000952))) OR 1 ... (shortened)
lola: formula length: 3400
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-callToTask_s00001746_input_s00000935 <= -3 AND -callToTask_s00002183_inputCriterion_s00000937_used + decision_s00001286_activated <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-callToTask_s00001746_input_s00000935 <= -3 AND -callToTask_s00002183_inputCriterion_s00000937_used + decision_s00001286_activated <= 0))
lola: processed formula length: 147
lola: 236 rewrites
lola: formula mentions 3 of 263 places; total mentions: 3
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (A(-join_s00001295_input_s00000985 + decision_s00001286_activated <= 0 U -callToProcess_s00004075_output_s00000938 <= -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(-join_s00001295_input_s00000985 + decision_s00001286_activated <= 0 U -callToProcess_s00004075_output_s00000938 <= -3))
lola: processed formula length: 124
lola: 237 rewrites
lola: formula mentions 3 of 263 places; total mentions: 3
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (AF ((-join_s00001295_input_s00000987 + callToTask_s00001746_output_s00000956 > 0 AND -callToProcess_s00002538_input_s00000952 > -1)) OR -callToTask_s00005967_output_s00000938 <= -1)
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: AF ((-join_s00001295_input_s00000987 + callToTask_s00001746_output_s00000956 > 0 AND -callToProcess_s00002538_input_s00000952 > -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-join_s00001295_input_s00000987 + callToTask_s00001746_output_s00000956 > 0 AND -callToProcess_s00002538_input_s00000952 > -1))
lola: processed formula length: 137
lola: 236 rewrites
lola: formula mentions 3 of 263 places; total mentions: 3
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -callToTask_s00005967_output_s00000938 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IBM5964-PT-none-CTLCardinality.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 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-alpha + join_s00001295_input_s00000985 > 0 R -callToTask_s00005967_input_s00000950 > -1) OR EX (-join_s00001295_input_s00000935 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-alpha + join_s00001295_input_s00000985 > 0 R -callToTask_s00005967_input_s00000950 > -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(!(-alpha + join_s00001295_input_s00000985 > 0) U !(-callToTask_s00005967_input_s00000950 > -1)))
lola: processed formula length: 100
lola: 236 rewrites
lola: formula mentions 3 of 263 places; total mentions: 3
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (callToTask_s00005972_input_s00000950 + -callToTask_s00002741_input_s00000986 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U callToTask_s00005972_input_s00000950 + -callToTask_s00002741_input_s00000986 > 0)
lola: processed formula length: 90
lola: 236 rewrites
lola: formula mentions 2 of 263 places; total mentions: 2
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AF (callToTask_s00005966_output_s00000979 + -callToTask_s00002741_inputCriterion_s00000937_used > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U callToTask_s00005966_output_s00000979 + -callToTask_s00002741_inputCriterion_s00000937_used > 0))
lola: processed formula length: 109
lola: 237 rewrites
lola: formula mentions 2 of 263 places; total mentions: 2
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF (-callToTask_s00002186_inputCriterion_s00000937_used <= -1) AND -callToTask_s00001746_input_s00000952 + merge_s00001292_input_s00000950 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-callToTask_s00002186_inputCriterion_s00000937_used <= -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 540 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 unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-join_s00001295_input_s00000985 <= -1 OR AF (-callToTask_s00002186_input_s00000935 + merge_s00001290_activated > 0))
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: -join_s00001295_input_s00000985 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-callToTask_s00002186_input_s00000935 + merge_s00001290_activated > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -callToTask_s00002186_input_s00000935 + merge_s00001290_activated > 0)
lola: processed formula length: 79
lola: 236 rewrites
lola: formula mentions 2 of 263 places; total mentions: 2
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (AG (-callToTask_s00002741_input_s00000935 > -3))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(!(E(TRUE U !(-callToTask_s00002741_input_s00000935 > -3))))
lola: processed formula length: 62
lola: 237 rewrites
lola: formula mentions 1 of 263 places; total mentions: 1
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (A(-callToProcess_s00005925_output_s00000938 + callToTask_s00005967_output_s00000938 <= 0 U -callToProcess_s00002538_input_s00000950 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(-callToProcess_s00005925_output_s00000938 + callToTask_s00005967_output_s00000938 <= 0 U -callToProcess_s00002538_input_s00000950 <= -1))
lola: processed formula length: 142
lola: 237 rewrites
lola: formula mentions 3 of 263 places; total mentions: 3
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 10 will run for 590 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((callToTask_s00002186_output_s00000938 + -callToTask_s00005966_inputCriterion_s00000937_used <= 0 AND -merge_s00001066_activated <= -3) OR AG (-callToTask_s00005969_output_s00000960 > -2)) AND (-fork_s00001293_input_s00000952 <= -2 OR (((fork_s00001537_activated_s00000991 + -fork_s00001536_activated_s00000991 <= 0 OR -process_s00000383__s00005964_output_s00001610 + callToTask_s00005969_input_s00... (shortened)
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: (callToTask_s00002186_output_s00000938 + -callToTask_s00005966_inputCriterion_s00000937_used <= 0 AND -merge_s00001066_activated <= -3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 2 atomic propositions
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-callToTask_s00005969_output_s00000960 > -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 540 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 invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (-fork_s00001293_input_s00000952 <= -2 OR (((fork_s00001537_activated_s00000991 + -fork_s00001536_activated_s00000991 <= 0 OR -process_s00000383__s00005964_output_s00001610 + callToTask_s00005969_input_s00000952 <= 0) AND (callToProcess_s00004075_output_s00000956 + -callToTask_s00002741_output_s00000981 <= 0 OR -callToTask_s00002427_output_s00000956 + decision_s00001616_activated <= 0)) OR -join_s... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 6 atomic propositions
lola: closed formula file IBM5964-PT-none-CTLCardinality.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 11 will run for 708 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (join_s00001295_input_s00000952 + -merge_s00001120_input_s00000935 <= 0)
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 540 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 invariant.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-callToTask_s00002741_output_s00000960 + merge_s00001290_input_s00001009 <= 0 OR -merge_s00001066_activated > -2) U (-fork_s00001067_activated_s00000991 > -1 AND -callToProcess_s00004075_input_s00000935 + callToTask_s00002526_input_s00000935 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A((-callToTask_s00002741_output_s00000960 + merge_s00001290_input_s00001009 <= 0 OR -merge_s00001066_activated > -2) U (-fork_s00001067_activated_s00000991 > -1 AND -callToProcess_s00004075_input_s00000935 + callToTask_s00002526_input_s00000935 > 0))
lola: processed formula length: 250
lola: 236 rewrites
lola: formula mentions 6 of 263 places; total mentions: 6
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 13 will run for 1180 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(AF (decision_s00001615_activated + -callToTask_s00005849_inputCriterion_s00000937_used <= 0) U -callToTask_s00005849_input_s00000952 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U decision_s00001615_activated + -callToTask_s00005849_inputCriterion_s00000937_used <= 0) U -callToTask_s00005849_input_s00000952 <= -3)
lola: processed formula length: 146
lola: 237 rewrites
lola: formula mentions 3 of 263 places; total mentions: 3
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-callToTask_s00002186_input_s00000935 <= -3 AND callToTask_s00002190_output_s00000956 + -callToTask_s00005966_output_s00000979 <= 0)) OR (-callToTask_s00005849_input_s00000985 <= -2 OR (EF (-callToTask_s00005849_input_s00000952 + callToTask_s00002186_input_s00000950 > 0) AND AF (-callToTask_s00005971_inputCriterion_s00000937_used > -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-callToTask_s00002186_input_s00000935 <= -3 AND callToTask_s00002190_output_s00000956 + -callToTask_s00005966_output_s00000979 <= 0))
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 540 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 unreachable.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -callToTask_s00005849_input_s00000985 <= -2
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-callToTask_s00005971_inputCriterion_s00000937_used > -3)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -callToTask_s00005971_inputCriterion_s00000937_used > -3)
lola: processed formula length: 66
lola: 236 rewrites
lola: formula mentions 1 of 263 places; total mentions: 1
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E((-callToTask_s00001746_input_s00000950 + callToTask_s00002189_output_s00000938 <= 0 OR -callToProcess_s00002411_output_s00000956 + callToTask_s00005849_output_s00000938 <= 0) U -callToTask_s00002741_input_s00000985 <= -2) AND (-callToTask_s00005967_input_s00000952 + callToTask_s00005897_inputCriterion_s00000937_used > 0 OR (callToTask_s00005966_output_s00000956 + -callToTask_s00005970_inputCrit... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E((-callToTask_s00001746_input_s00000950 + callToTask_s00002189_output_s00000938 <= 0 OR -callToProcess_s00002411_output_s00000956 + callToTask_s00005849_output_s00000938 <= 0) U -callToTask_s00002741_input_s00000985 <= -2)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((-callToTask_s00001746_input_s00000950 + callToTask_s00002189_output_s00000938 <= 0 OR -callToProcess_s00002411_output_s00000956 + callToTask_s00005849_output_s00000938 <= 0) U -callToTask_s00002741_input_s00000985 <= -2)
lola: processed formula length: 223
lola: 236 rewrites
lola: formula mentions 5 of 263 places; total mentions: 5
lola: closed formula file IBM5964-PT-none-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 540 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: RESULT
lola: summary: no no no yes no no no yes yes no yes yes no no unknown no

BK_STOP 1463590361556

--------------------
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="IBM5964-PT-none"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/home/hulinhub/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/IBM5964-PT-none.tgz
mv IBM5964-PT-none 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 IBM5964-PT-none, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r062kn-blw3-146358896700039"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.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 ;