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 Peterson-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088100060
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463691925323

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
LTLFireability @ Peterson-PT-2
FORMULA Peterson-COL-2-LTLFireability-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-2 CANNOT_COMPUTE
FORMULA Peterson-COL-2-LTLFireability-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-4 CANNOT_COMPUTE
FORMULA Peterson-COL-2-LTLFireability-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-7 CANNOT_COMPUTE
FORMULA Peterson-COL-2-LTLFireability-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-11 CANNOT_COMPUTE
FORMULA Peterson-COL-2-LTLFireability-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Peterson-COL-2-LTLFireability-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: 228/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 102 places, 126 transitions, 91 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 189 transition conflict sets
lola: TASK
lola: reading formula from Peterson-COL-2-LTLFireability.task
lola: read: A(((((((((((((((((FIREABLE(ContinueLoop_2_1_0) OR FIREABLE(ContinueLoop_0_2_0)) OR FIREABLE(ContinueLoop_1_2_0)) OR FIREABLE(ContinueLoop_2_2_0)) OR FIREABLE(ContinueLoop_0_0_1)) OR FIREABLE(ContinueLoop_1_0_1)) OR FIREABLE(ContinueLoop_2_0_1)) OR FIREABLE(ContinueLoop_0_1_1)) OR FIREABLE(ContinueLoop_0_0_0)) OR FIREABLE(ContinueLoop_1_0_0)) OR FIREABLE(ContinueLoop_2_0_0)) OR FIREABLE(ContinueLoo... (shortened)
lola: formula length: 7713
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(ContinueLoop_2_1_0) OR (FIREABLE(ContinueLoop_0_2_0) OR (FIREABLE(ContinueLoop_1_2_0) OR (FIREABLE(ContinueLoop_2_2_0) OR (FIREABLE(ContinueLoop_0_0_1) OR (FIREABLE(ContinueLoop_1_0_1) OR (FIREABLE(ContinueLoop_2_0_1) OR (FIREABLE(ContinueLoop_0_1_1) OR (FIREABLE(ContinueLoop_0_0_0) OR (FIREABLE(ContinueLoop_1_0_0) OR (FIREABLE(ContinueLoop_2_0_0) OR (FIREABLE(ContinueLoop_0_1_0) OR (FIR... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-LTLFireability.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: (FIREABLE(NoIdentity_2_0_0) OR (FIREABLE(NoIdentity_1_0_0) OR (FIREABLE(NoIdentity_2_1_0) OR (FIREABLE(NoIdentity_0_1_0) OR (FIREABLE(NoIdentity_0_1_1) OR (FIREABLE(NoIdentity_2_1_1) OR (FIREABLE(NoIdentity_0_2_1) OR (FIREABLE(NoIdentity_1_2_1) OR (FIREABLE(NoIdentity_0_2_0) OR (FIREABLE(NoIdentity_1_2_0) OR (FIREABLE(NoIdentity_1_0_1) OR FIREABLE(NoIdentity_2_0_1))))))))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A((F ((FIREABLE(TurnEqual_1_0) OR (FIREABLE(TurnEqual_2_0) OR (FIREABLE(TurnEqual_0_0) OR (FIREABLE(TurnEqual_2_1) OR (FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_1_1))))))) U (FIREABLE(TurnDiff_1_0_1) OR (FIREABLE(TurnDiff_1_2_0) OR (FIREABLE(TurnDiff_0_2_0) OR (FIREABLE(TurnDiff_2_1_0) OR (FIREABLE(TurnDiff_0_2_1) OR (FIREABLE(TurnDiff_2_1_1) OR (FIREABLE(TurnDiff_0_1_1) OR (FIREABLE(TurnDiff_... (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 3 will run for 269 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G ((F ((FIREABLE(TurnDiff_1_0_1) OR (FIREABLE(TurnDiff_1_2_0) OR (FIREABLE(TurnDiff_0_2_0) OR (FIREABLE(TurnDiff_2_1_0) OR (FIREABLE(TurnDiff_0_2_1) OR (FIREABLE(TurnDiff_2_1_1) OR (FIREABLE(TurnDiff_0_1_1) OR (FIREABLE(TurnDiff_2_0_1) OR (FIREABLE(TurnDiff_0_1_0) OR (FIREABLE(TurnDiff_2_0_0) OR (FIREABLE(TurnDiff_1_0_0) OR FIREABLE(TurnDiff_1_2_1))))))))))))) U G ((FIREABLE(NoIdentity_2_0_0) ... (shortened)
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 12 bytes per marking, with 5 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 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A(X (X (X ((FIREABLE(AccessCS_2) OR (FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0)))))) U (G ((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0)))) U (FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotA... (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 5 will run for 287 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X ((FIREABLE(Ask_1) OR (FIREABLE(Ask_2) OR FIREABLE(Ask_0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 10 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 315 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((FIREABLE(AccessCS_2) OR (FIREABLE(AccessCS_1) OR FIREABLE(AccessCS_0))) U (FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0))))))))
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 12 bytes per marking, with 5 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 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G (((FIREABLE(UpdateTurn_0_0_0) OR (FIREABLE(UpdateTurn_1_0_0) OR (FIREABLE(UpdateTurn_1_1_0) OR (FIREABLE(UpdateTurn_2_1_0) OR (FIREABLE(UpdateTurn_2_0_0) OR (FIREABLE(UpdateTurn_0_1_0) OR (FIREABLE(UpdateTurn_0_2_1) OR (FIREABLE(UpdateTurn_2_1_1) OR (FIREABLE(UpdateTurn_2_2_1) OR (FIREABLE(UpdateTurn_1_2_1) OR (FIREABLE(UpdateTurn_2_0_1) OR (FIREABLE(UpdateTurn_1_0_1) OR (FIREABLE(UpdateTurn... (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 8 will run for 375 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (G ((FIREABLE(Loop_0_0_0) OR (FIREABLE(Loop_2_0_1) OR (FIREABLE(Loop_1_0_1) OR (FIREABLE(Loop_0_0_1) OR (FIREABLE(Loop_2_1_0) OR (FIREABLE(Loop_1_1_0) OR (FIREABLE(Loop_0_1_0) OR (FIREABLE(Loop_2_0_0) OR (FIREABLE(Loop_1_0_0) OR (FIREABLE(Loop_2_1_1) OR (FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_1_1)))))))))))))))
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 12 bytes per marking, with 5 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 9 will run for 429 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (G (F (((FIREABLE(Loop_0_0_0) OR (FIREABLE(Loop_2_0_1) OR (FIREABLE(Loop_1_0_1) OR (FIREABLE(Loop_0_0_1) OR (FIREABLE(Loop_2_1_0) OR (FIREABLE(Loop_1_1_0) OR (FIREABLE(Loop_0_1_0) OR (FIREABLE(Loop_2_0_0) OR (FIREABLE(Loop_1_0_0) OR (FIREABLE(Loop_2_1_1) OR (FIREABLE(Loop_1_1_1) OR FIREABLE(Loop_0_1_1)))))))))))) U (FIREABLE(Alone1_0_2_0) OR (FIREABLE(Alone1_2_1_0) OR (FIREABLE(Alone1_0_1_0) OR... (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 12 bytes per marking, with 5 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 463 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(BecomeIdle_2) OR (FIREABLE(BecomeIdle_1) OR FIREABLE(BecomeIdle_0)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-LTLFireability.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 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((((FIREABLE(UpdateTurn_0_0_0) OR (FIREABLE(UpdateTurn_1_0_0) OR (FIREABLE(UpdateTurn_1_1_0) OR (FIREABLE(UpdateTurn_2_1_0) OR (FIREABLE(UpdateTurn_2_0_0) OR (FIREABLE(UpdateTurn_0_1_0) OR (FIREABLE(UpdateTurn_0_2_1) OR (FIREABLE(UpdateTurn_2_1_1) OR (FIREABLE(UpdateTurn_2_2_1) OR (FIREABLE(UpdateTurn_1_2_1) OR (FIREABLE(UpdateTurn_2_0_1) OR (FIREABLE(UpdateTurn_1_0_1) OR (FIREABLE(UpdateTurn_1... (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 12 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (G ((FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_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 12 bytes per marking, with 5 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 742 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (X (F (G (X ((FIREABLE(TurnEqual_1_0) OR (FIREABLE(TurnEqual_2_0) OR (FIREABLE(TurnEqual_0_0) OR (FIREABLE(TurnEqual_2_1) OR (FIREABLE(TurnEqual_0_1) OR FIREABLE(TurnEqual_1_1)))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: the resulting Büchi automaton has 66 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 5 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 14 will run for 1042 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FIREABLE(EndLoop_2_1) OR (FIREABLE(EndLoop_0_1) OR (FIREABLE(EndLoop_1_1) OR (FIREABLE(EndLoop_1_0) OR (FIREABLE(EndLoop_2_0) OR FIREABLE(EndLoop_0_0))))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 0 atomic propositions
lola: closed formula file Peterson-COL-2-LTLFireability.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 15 will run for 2085 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF (((FIREABLE(NotAlone_0_1_0) OR (FIREABLE(NotAlone_2_0_0) OR (FIREABLE(NotAlone_0_2_0) OR (FIREABLE(NotAlone_2_1_0) OR (FIREABLE(NotAlone_1_0_1) OR (FIREABLE(NotAlone_1_2_0) OR (FIREABLE(NotAlone_0_1_1) OR (FIREABLE(NotAlone_2_0_1) OR (FIREABLE(NotAlone_1_0_0) OR (FIREABLE(NotAlone_2_1_1) OR (FIREABLE(NotAlone_0_2_1) OR FIREABLE(NotAlone_1_2_1)))))))))))) U (FIREABLE(AccessCS_2) OR (FIREABLE(Acc... (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 12 bytes per marking, with 5 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 no unknown no unknown no no unknown no no no unknown no no no no
lola: ========================================

BK_STOP 1463693380433

--------------------
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="Peterson-PT-2"
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/Peterson-PT-2.tgz
mv Peterson-PT-2 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 Peterson-PT-2, 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 r086kn-ebro-146369088100060"
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 ;