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

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

=== Now, execution of the tool begins

BK_START 1463719911287

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLCardinality @ PolyORBLF-PT-S02J06T06
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-1 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-6 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-8 CANNOT_COMPUTE
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-LTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PolyORBLF-COL-S02J06T06-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: 1600/65536 symbol table entries, 7 collisions
lola: preprocessing...
lola: finding significant places
lola: 536 places, 1064 transitions, 486 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1483 transition conflict sets
lola: TASK
lola: reading formula from PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: read: AG (X ((1 <= ProcessingEvt_3 + ProcessingEvt_2 + ProcessingEvt_5 + ProcessingEvt_4 + ProcessingEvt_6 + ProcessingEvt_1 U 1 <= nyo_4 + nyo_3 + nyo_6 + nyo_5 + nyo_1 + nyo_2))) : AG (F (P_1160_6 + P_1160_3 + P_1160_4 + P_1160_2 + P_1160_1 + P_1160_5 <= P_1099)) : A((PollingAbort <= QueueJobE_2 + QueueJobE_1 + QueueJobE_6 + QueueJobE_5 + QueueJobE_4 + QueueJobE_3 U ScheduleTaskB_1 + ScheduleTaskB_3 +... (shortened)
lola: formula length: 5802
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 (X ((-ProcessingEvt_6 + -ProcessingEvt_5 + -ProcessingEvt_4 + -ProcessingEvt_3 + -ProcessingEvt_2 + -ProcessingEvt_1 <= -1 U -nyo_6 + -nyo_5 + -nyo_4 + -nyo_3 + -nyo_2 + -nyo_1 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 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 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (P_1160_6 + P_1160_1 + P_1160_2 + P_1160_3 + P_1160_4 + P_1160_5 + -P_1099 <= 0))
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 1944 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 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((PollingAbort + -QueueJobE_6 + -QueueJobE_5 + -QueueJobE_4 + -QueueJobE_3 + -QueueJobE_2 + -QueueJobE_1 <= 0 U -FetchJobE_6_6 + -FetchJobE_6_5 + -FetchJobE_6_4 + -FetchJobE_6_3 + -FetchJobE_6_2 + -FetchJobE_6_1 + -FetchJobE_6_0 + ScheduleTaskB_6 + ScheduleTaskB_5 + ScheduleTaskB_4 + ScheduleTaskB_3 + ScheduleTaskB_2 + ScheduleTaskB_1 + -FetchJobE_5_6 + -FetchJobE_5_5 + -FetchJobE_5_4 + -FetchJob... (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 1944 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 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (X (X (-cBlockedTasks <= -2))))
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 1944 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 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-ScheduleTaskE_Work_6_6 + -ScheduleTaskE_Work_6_5 + -ScheduleTaskE_Work_6_4 + -ScheduleTaskE_Work_6_3 + -ScheduleTaskE_Work_6_2 + -ScheduleTaskE_Work_6_1 + -ScheduleTaskE_Work_6_0 + -ScheduleTaskE_Work_5_6 + -ScheduleTaskE_Work_5_5 + -ScheduleTaskE_Work_5_4 + -ScheduleTaskE_Work_5_3 + -ScheduleTaskE_Work_5_2 + -ScheduleTaskE_Work_5_1 + -ScheduleTaskE_Work_5_0 + -ScheduleTaskE_Work_4_6 + -Sched... (shortened)
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 1944 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 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -NotifyEventEndOfCheckSourcesE_6 + -NotifyEventEndOfCheckSourcesE_5 + -NotifyEventEndOfCheckSourcesE_4 + -NotifyEventEndOfCheckSourcesE_3 + -NotifyEventEndOfCheckSourcesE_2 + -NotifyEventEndOfCheckSourcesE_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 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file PolyORBLF-COL-S02J06T06-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 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((X (-DataOnSrc_2 + -DataOnSrc_1 + P_1159_6 + P_1159_5 + P_1159_4 + P_1159_3 + P_1159_2 + P_1159_1 <= 0) U G (P_1155_6 + P_1155_5 + P_1155_4 + P_1155_3 + P_1155_2 + P_1155_1 + -cIsMonitoring <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 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: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 329 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(G (-PlaceSources_2 + -PlaceSources_1 <= -1) U P_1095 + -P_1725_6 + -P_1725_5 + -P_1725_4 + -P_1725_3 + -P_1725_2 + -P_1725_1 + -P_1725_0 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 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 8 will run for 371 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (G (F (P_2579_3_2 + P_2579_3_1 + -cBlockedTasks + P_2579_1_1 + P_2579_1_2 + P_2579_2_1 + P_2579_2_2 + P_2579_6_2 + P_2579_6_1 + P_2579_5_2 + P_2579_5_1 + P_2579_4_2 + P_2579_4_1 <= 0))))
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 1944 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 9 will run for 391 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (-AvailableJobId_0 + -AvailableJobId_1 + -AvailableJobId_2 + -AvailableJobId_3 + -AvailableJobId_4 + -AvailableJobId_5 + -AvailableJobId_6 <= -3) U F (G (-IsMonitoring <= -2)))
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 1944 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 10 will run for 456 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 <= -1)
lola: processed formula length: 67
lola: 5937 rewrites
lola: formula mentions 6 of 536 places; total mentions: 6
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 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: subprocess 11 will run for 547 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (-RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(-RunE_6 + -RunE_5 + -RunE_4 + -RunE_3 + -RunE_2 + -RunE_1 <= -1)
lola: processed formula length: 67
lola: 5937 rewrites
lola: formula mentions 6 of 536 places; total mentions: 6
lola: closed formula file PolyORBLF-COL-S02J06T06-LTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 1944 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: subprocess 12 will run for 684 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (-P_1093 + Abort_Check_Sources_B_6 + Abort_Check_Sources_B_5 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_1 <= 0))
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 1944 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 13 will run for 912 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-PollingAbort + Insert_Source_B_6_2 + Insert_Source_B_6_1 + Insert_Source_B_5_2 + Insert_Source_B_5_1 + 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 <= 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 1944 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 14 will run for 1368 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F ((-NotifyEventJobQueuedB_1_6 + -NotifyEventJobQueuedB_1_5 + -NotifyEventJobQueuedB_1_4 + -NotifyEventJobQueuedB_1_3 + -NotifyEventJobQueuedB_1_2 + -NotifyEventJobQueuedB_1_1 + -NotifyEventJobQueuedB_1_0 + -NotifyEventJobQueuedB_6_6 + -NotifyEventJobQueuedB_6_5 + -NotifyEventJobQueuedB_6_4 + -NotifyEventJobQueuedB_6_3 + -NotifyEventJobQueuedB_6_2 + -NotifyEventJobQueuedB_6_1 + -NotifyEventJob... (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 1944 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 15 will run for 2736 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(DataOnSrc_2 + DataOnSrc_1 + -Try_Check_Sources_B_6 + -Try_Check_Sources_B_5 + -Try_Check_Sources_B_4 + -Try_Check_Sources_B_3 + -Try_Check_Sources_B_2 + -Try_Check_Sources_B_1 <= 0 U F (G (-NotifyEventJobCompletedB_6 + -NotifyEventJobCompletedB_5 + -NotifyEventJobCompletedB_4 + -NotifyEventJobCompletedB_3 + -NotifyEventJobCompletedB_2 + -NotifyEventJobCompletedB_1 <= -3)))
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 1944 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 unknown no no no yes unknown yes unknown no no no no no no no
lola: ========================================

BK_STOP 1463720717311

--------------------
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-S02J06T06"
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-S02J06T06.tgz
mv PolyORBLF-PT-S02J06T06 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-S02J06T06, 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-146369088900689"
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 ;