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 CSRepetitions-PT-03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347662600501
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463504637269

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLFireability @ CSRepetitions-PT-03
FORMULA CSRepetitions-COL-03-LTLFireability-0 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-03-LTLFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-2 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-03-LTLFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-10 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-03-LTLFireability-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-13 CANNOT_COMPUTE
FORMULA CSRepetitions-COL-03-LTLFireability-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA CSRepetitions-COL-03-LTLFireability-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: 139/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 58 places, 81 transitions, 46 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 127 transition conflict sets
lola: TASK
lola: reading formula from CSRepetitions-COL-03-LTLFireability.task
lola: read: AX (G (X (((((((((((((((((((((((((((FIREABLE(Read_Request_8_3) OR FIREABLE(Read_Request_9_1)) OR FIREABLE(Read_Request_5_1)) OR FIREABLE(Read_Request_7_3)) OR FIREABLE(Read_Request_3_2)) OR FIREABLE(Read_Request_9_2)) OR FIREABLE(Read_Request_1_3)) OR FIREABLE(Read_Request_2_3)) OR FIREABLE(Read_Request_6_1)) OR FIREABLE(Read_Request_6_3)) OR FIREABLE(Read_Request_2_2)) OR FIREABLE(Read_Request_5_... (shortened)
lola: formula length: 9188
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (X ((FIREABLE(Read_Request_8_3) OR (FIREABLE(Read_Request_9_1) OR (FIREABLE(Read_Request_5_1) OR (FIREABLE(Read_Request_7_3) OR (FIREABLE(Read_Request_3_2) OR (FIREABLE(Read_Request_9_2) OR (FIREABLE(Read_Request_1_3) OR (FIREABLE(Read_Request_2_3) OR (FIREABLE(Read_Request_6_1) OR (FIREABLE(Read_Request_6_3) OR (FIREABLE(Read_Request_2_2) OR (FIREABLE(Read_Request_5_3) OR (FIREABLE(Read_Req... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (G (X ((FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_2) OR (FIREABLE(Lose_Request_3) OR (FIREABLE(Lose_Request_1) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6))))))))))))
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 184 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 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (X (G (((FIREABLE(Send_Request_6) OR (FIREABLE(Send_Request_5) OR (FIREABLE(Send_Request_1) OR (FIREABLE(Send_Request_4) OR (FIREABLE(Send_Request_3) OR (FIREABLE(Send_Request_9) OR (FIREABLE(Send_Request_2) OR (FIREABLE(Send_Request_8) OR FIREABLE(Send_Request_7))))))))) U (FIREABLE(Read_Request_8_3) OR (FIREABLE(Read_Request_9_1) OR (FIREABLE(Read_Request_5_1) OR (FIREABLE(Read_Request_7_3) O... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 3 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (F (G ((FIREABLE(Prepare_Request_7) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6))))))))))))
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 184 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 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((FIREABLE(Send_Request_6) OR (FIREABLE(Send_Request_5) OR (FIREABLE(Send_Request_1) OR (FIREABLE(Send_Request_4) OR (FIREABLE(Send_Request_3) OR (FIREABLE(Send_Request_9) OR (FIREABLE(Send_Request_2) OR (FIREABLE(Send_Request_8) OR FIREABLE(Send_Request_7))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((FIREABLE(Send_Request_6) OR (FIREABLE(Send_Request_5) OR (FIREABLE(Send_Request_1) OR (FIREABLE(Send_Request_4) OR (FIREABLE(Send_Request_3) OR (FIREABLE(Send_Request_9) OR (FIREABLE(Send_Request_2) OR (FIREABLE(Send_Request_8) OR FIREABLE(Send_Request_7))))))))))
lola: processed formula length: 268
lola: 2106 rewrites
lola: formula mentions 0 of 58 places; total mentions: 0
lola: closed formula file CSRepetitions-COL-03-LTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 184 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: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 5 will run for 280 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G ((FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_2) OR (FIREABLE(Lose_Request_3) OR (FIREABLE(Lose_Request_1) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6)))))))))))
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 184 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 6 will run for 308 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G ((FIREABLE(Prepare_Request_7) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6)))))))))))
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 184 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 7 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX (X (F (G ((FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_2) OR (FIREABLE(Lose_Request_3) OR (FIREABLE(Lose_Request_1) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6)))))))))))))
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 184 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 8 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_2) OR (FIREABLE(Lose_Request_3) OR (FIREABLE(Lose_Request_1) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6))))))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_2) OR (FIREABLE(Lose_Request_3) OR (FIREABLE(Lose_Request_1) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6))))))))))
lola: processed formula length: 268
lola: 2106 rewrites
lola: formula mentions 0 of 58 places; total mentions: 0
lola: closed formula file CSRepetitions-COL-03-LTLFireability.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 184 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 9 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((FIREABLE(Prepare_Request_7) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_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 184 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 10 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((((FIREABLE(Send_Answer_8_2) OR (FIREABLE(Send_Answer_2_2) OR (FIREABLE(Send_Answer_9_2) OR (FIREABLE(Send_Answer_7_3) OR (FIREABLE(Send_Answer_5_1) OR (FIREABLE(Send_Answer_1_3) OR (FIREABLE(Send_Answer_6_1) OR (FIREABLE(Send_Answer_1_2) OR (FIREABLE(Send_Answer_4_2) OR (FIREABLE(Send_Answer_2_3) OR (FIREABLE(Send_Answer_3_1) OR (FIREABLE(Send_Answer_6_3) OR (FIREABLE(Send_Answer_5_3) OR (FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_2) OR (FIREABLE(Lose_Request_3) OR (FIREABLE(Lose_Request_1) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6)))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file CSRepetitions-COL-03-LTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 12 will run for 642 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (X (F (X ((FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (FIREABLE(Lose_Request_2) OR (FIREABLE(Lose_Request_3) OR (FIREABLE(Lose_Request_1) OR (FIREABLE(Lose_Request_8) OR (FIREABLE(Lose_Request_9) OR FIREABLE(Lose_Request_6))))))))))))))
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 184 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 856 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (F (X (G ((FIREABLE(Read_Request_8_3) OR (FIREABLE(Read_Request_9_1) OR (FIREABLE(Read_Request_5_1) OR (FIREABLE(Read_Request_7_3) OR (FIREABLE(Read_Request_3_2) OR (FIREABLE(Read_Request_9_2) OR (FIREABLE(Read_Request_1_3) OR (FIREABLE(Read_Request_2_3) OR (FIREABLE(Read_Request_6_1) OR (FIREABLE(Read_Request_6_3) OR (FIREABLE(Read_Request_2_2) OR (FIREABLE(Read_Request_5_3) OR (FIREABLE(Read_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 14 will run for 1099 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (X (X ((FIREABLE(Prepare_Request_7) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6)))))))))))) U (X ((FIREABLE(Lose_Request_7) OR (FIREABLE(Lose_Request_4) OR (FIREABLE(Lose_Request_5) OR (... (shortened)
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 184 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 15 will run for 2199 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((F ((FIREABLE(Prepare_Request_7) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_2) OR (FIREABLE(Prepare_Request_9) OR (FIREABLE(Prepare_Request_1) OR (FIREABLE(Prepare_Request_3) OR (FIREABLE(Prepare_Request_4) OR (FIREABLE(Prepare_Request_5) OR FIREABLE(Prepare_Request_6)))))))))) U F ((FIREABLE(Prepare_Request_7) OR (FIREABLE(Prepare_Request_8) OR (FIREABLE(Prepare_Request_2) O... (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 184 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: RESULT
lola: summary: unknown no unknown no yes no no no no no unknown no no unknown yes yes

BK_STOP 1463505978977

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