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 PolyORBLF-PT-S02J06T08, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088900698
=====================================================================

--------------------
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 PolyORBLF-COL-S02J06T08-LTLCardinality-0
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-1
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-15
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-2
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-3
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-4
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-5
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-6
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-7
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-8
FORMULA_NAME PolyORBLF-COL-S02J06T08-LTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463721825256

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ PolyORBLF-PT-S02J06T08
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-9 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-14 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T08-LTLCardinality-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: 2124/65536 symbol table entries, 10 collisions
lola: preprocessing...
lola: finding significant places
lola: 690 places, 1434 transitions, 636 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2005 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: read: AIsMonitoring <= nyo_3 + nyo_4 + nyo_8 + nyo_7 + nyo_6 + nyo_5 + nyo_2 + nyo_1 : AF (F (Try_Check_Sources_E_5 + Try_Check_Sources_E_2 + Try_Check_Sources_E_8 + Try_Check_Sources_E_3 + Try_Check_Sources_E_1 + Try_Check_Sources_E_6 + Try_Check_Sources_E_7 + Try_Check_Sources_E_4 <= NotifyEventJobQueuedB_3_2 + NotifyEventJobQueuedB_2_5 + NotifyEventJobQueuedB_1_6 + NotifyEventJobQueuedB_5_2 + NotifyE... (shortened)
lola: formula length: 6215
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: IsMonitoring + -nyo_8 + -nyo_7 + -nyo_6 + -nyo_5 + -nyo_4 + -nyo_3 + -nyo_2 + -nyo_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_8_6 + -NotifyEventJobQueuedB_8_5 + -NotifyEventJobQueuedB_8_4 + -NotifyEventJobQueuedB_8_3 + -NotifyEventJobQueuedB_8_2 + -NotifyEventJobQueuedB_8_1 + -NotifyEventJobQueu... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_8_6 + -NotifyEventJobQueuedB_8_5 + -NotifyEventJobQueuedB_8_4 + -NotifyEventJobQueuedB_8_3 + -NotifyEventJobQueuedB_8_2 + -NotifyEventJobQueuedB_8_1 + -NotifyEventJo... (shortened)
lola: processed formula length: 1828
lola: 7868 rewrites
lola: formula mentions 64 of 690 places; total mentions: 64
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -ORB_Lock <= -3
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G ((-ORB_Lock <= -1 U -Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_7_1 + -Insert_Source_B_7_2 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + -Insert_Source_B_8_1 + -Insert_Source_B_8_2 + -Insert_Source_B_4_2 + -Insert_Source_B_4_1 + -Insert_Source_B_3_2 + -Insert_Source_B_3_1 + -Insert_Source_B_2_2 + -Insert_Source_B_2_1 + -Insert_Source_B_1_2 + -Insert_Source_B_1_1 + ORB_Lo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_7_1 + -Insert_Source_B_7_2 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + -Insert_Source_B_8_1 + -Insert_Source_B_8_2 + -Insert_Source_B_4_2 + -Insert_Source_B_4_1 + -Insert_Source_B_3_2 + -Insert_Source_B_3_1 + -Insert_Source_B_2_2 + -Insert_Source_B_2_1 + -Insert_Source_B_1_2 + -Insert_Source_B_1_1 <= -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 2544 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_4 + -AvailableJobId_5 + -AvailableJobId_6 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((-MarkerWrite + P_1160_8 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + P_1160_6 + P_1160_7 <= 0 U -P_1712_6 + -P_1712_5 + -P_1712_4 + -P_1712_3 + -P_1712_2 + -P_1712_1 + -P_1712_0 <= -2) U (-DisablePollingB_4_2 + -DisablePollingB_2_1 + -DisablePollingB_2_2 + -DisablePollingB_1_2 + -DisablePollingB_1_1 + -DisablePollingB_3_1 + -DisablePollingB_3_2 + QueueJobE_8 + QueueJobE_7 + QueueJob... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-cIsMonitoring <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -cIsMonitoring <= -1)
lola: processed formula length: 30
lola: 7868 rewrites
lola: formula mentions 1 of 690 places; total mentions: 1
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: P_1158_8 + P_1158_7 + P_1158_6 + P_1158_5 + P_1158_4 + P_1158_3 + P_1158_2 + P_1158_1 + -Idle_8 + -Idle_7 + -Idle_6 + -Idle_5 + -Idle_4 + -Idle_3 + -Idle_2 + -Idle_1 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (-QueueJobB_8_6 + -QueueJobB_8_5 + -QueueJobB_8_4 + -QueueJobB_8_3 + -QueueJobB_8_2 + -QueueJobB_8_1 + -QueueJobB_8_0 + -QueueJobB_7_6 + -QueueJobB_7_5 + -QueueJobB_7_4 + -QueueJobB_7_3 + -QueueJobB_7_2 + -QueueJobB_7_1 + -QueueJobB_7_0 + -QueueJobB_6_6 + -QueueJobB_6_5 + -QueueJobB_6_4 + -QueueJobB_6_3 + -QueueJobB_6_2 + -QueueJobB_6_1 + -QueueJobB_6_0 + RunB_8 + RunB_7 + RunB_6 + RunB_5 + ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (G (P_1119_8_2 + P_1119_8_1 + P_1119_7_2 + P_1119_7_1 + P_1119_6_2 + P_1119_6_1 + P_1119_5_2 + P_1119_5_1 + P_1119_4_2 + P_1119_4_1 + P_1119_3_2 + P_1119_3_1 + P_1119_2_2 + P_1119_2_1 + P_1119_1_2 + P_1119_1_1 + -cIdleTasks <= 0)) U G (-P_1093 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (G (-ScheduleTaskE_Idle_8 + -ScheduleTaskE_Idle_7 + -ScheduleTaskE_Idle_6 + -ScheduleTaskE_Idle_5 + -ScheduleTaskE_Idle_4 + -ScheduleTaskE_Idle_3 + -ScheduleTaskE_Idle_2 + -ScheduleTaskE_Idle_1 <= -3)) U F (-P_1712_6 + -P_1712_5 + -P_1712_4 + -P_1712_3 + -P_1712_2 + -P_1712_1 + -P_1712_0 <= -2))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: ========================================
lola: subprocess 12 will run for 829 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (-cPollingAbort <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U -cPollingAbort <= -1)
lola: processed formula length: 30
lola: 7868 rewrites
lola: formula mentions 1 of 690 places; total mentions: 1
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 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 13 will run for 1106 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -Try_Check_Sources_E_8 + -Try_Check_Sources_E_7 + -Try_Check_Sources_E_6 + -Try_Check_Sources_E_5 + -Try_Check_Sources_E_4 + -Try_Check_Sources_E_3 + -Try_Check_Sources_E_2 + -Try_Check_Sources_E_1 + NotifyEventSourceAddedB_8 + NotifyEventSourceAddedB_7 + NotifyEventSourceAddedB_6 + NotifyEventSourceAddedB_5 + NotifyEventSourceAddedB_4 + NotifyEventSourceAddedB_3 + NotifyEventSourceAddedB_2 + Noti... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S02J06T08-LTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1659 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cJobCnt <= -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 2544 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: Child process aborted or communication problem between parent and child process
lola: subprocess 15 will run for 2283 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G ((-Insert_Source_B_6_2 + -Insert_Source_B_6_1 + -Insert_Source_B_7_1 + -Insert_Source_B_7_2 + -Insert_Source_B_5_2 + -Insert_Source_B_5_1 + -Insert_Source_B_8_1 + -Insert_Source_B_8_2 + -Insert_Source_B_4_2 + -Insert_Source_B_4_1 + -Insert_Source_B_3_2 + -Insert_Source_B_3_1 + -Insert_Source_B_2_2 + -Insert_Source_B_2_1 + -Insert_Source_B_1_2 + -Insert_Source_B_1_1 <= -3 U -cPollingAbort <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 2544 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: not using stubborn set method (--stubborn=off)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: RESULT
lola: summary: no yes no no no yes yes yes yes unknown no no yes yes unknown no
lola: ========================================

BK_STOP 1463723090840

--------------------
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="PolyORBLF-PT-S02J06T08"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/users/gast00/fkordon/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/PolyORBLF-PT-S02J06T08.tgz
mv PolyORBLF-PT-S02J06T08 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 PolyORBLF-PT-S02J06T08, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r086kn-ebro-146369088900698"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;