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 ARMCacheCoherence-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002kn-ebro-146347661900007
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463479818421

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ ARMCacheCoherence-PT-none
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-0 CANNOT_COMPUTE
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-3 CANNOT_COMPUTE
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-4 CANNOT_COMPUTE
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-5 CANNOT_COMPUTE
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-6 CANNOT_COMPUTE
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-8 CANNOT_COMPUTE
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-9 CANNOT_COMPUTE
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA ARMCacheCoherence-PT-none-ReachabilityCardinality-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: 33763/65536 symbol table entries, 18925 collisions
lola: preprocessing...
lola: finding significant places
lola: 87 places, 33676 transitions, 75 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1209 transition conflict sets
lola: TASK
lola: reading formula from ARMCacheCoherence-PT-none-ReachabilityCardinality.task
lola: read: AG ((p53 <= p53 AND !(3 <= p65))) : AG (p28 <= p66) : AG ((((1 <= p58 OR p51 <= p33) AND (p46 <= p4 OR 3 <= p18)) OR p81 <= p36)) : AG ((!((1 <= p4 AND 3 <= p50)) OR p79 <= p60)) : AG (!(2 <= p31)) : AG ((!((3 <= p37 OR 3 <= p84)) AND ((p14 <= p64 OR 1 <= p48) AND !(2 <= p17)))) : AG (!(2 <= p10)) : AG (((!(1 <= p52) OR 1 <= p85) OR !((p55 <= p7 AND 1 <= p34)))) : AG (!(2 <= p37)) : EF (3 <= p76) ... (shortened)
lola: formula length: 745
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 (-p65 > -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality.sara.
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: AG (-p66 + p28 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-p58 <= -1 OR p51 + -p33 <= 0) AND (p46 + -p4 <= 0 OR -p18 <= -3)) OR -p36 + p81 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 6 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p4 > -1 OR (-p50 > -3 OR -p60 + p79 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 3 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-3.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p31 > -2)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-4.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 5 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p37 > -3 AND (-p84 > -3 AND ((-p64 + p14 <= 0 OR -p48 <= -1) AND -p17 > -2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 5 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-5.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 6 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p10 > -2)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-6.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p52 > -1 OR (-p85 <= -1 OR (-p7 + p55 > 0 OR -p34 > -1))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p37 > -2)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-8.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 9 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p76 <= -3)
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-9.sara.
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 285 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((p77 + -p53 > 0 AND (-p45 > -3 AND (-p66 > -2 AND p20 + -p3 > 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-10.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 342 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-p37 + p2 > 0 OR -p53 + p14 > 0) AND -p63 <= -1))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 4 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 427 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p17 > -3 AND (-p12 + p11 > 0 AND (p33 + -p29 > 0 OR p70 + -p21 > 0))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 6 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-p79 <= -3 OR (-p76 + p36 <= 0 OR -p10 + p6 <= 0)) AND (-p28 > -3 OR (-p39 + p49 <= 0 AND p17 + -p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 7 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 837 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p16 + p14 <= 0 OR p69 + -p72 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 2 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 1673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p54 > -3)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 12 bytes per marking, with 21 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: Transformation into DNF: expect 1 literals
lola: write sara problem file to ARMCacheCoherence-PT-none-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file ARMCacheCoherence-PT-none-ReachabilityCardinality-15.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: yes
lola: The predicate is invariant.
lola: ========================================
lola: RESULT
lola: summary: unknown no no unknown unknown unknown unknown no unknown unknown yes yes yes no no yes

BK_STOP 1463482166868

--------------------
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="ARMCacheCoherence-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
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/ARMCacheCoherence-PT-none.tgz
mv ARMCacheCoherence-PT-none execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is ARMCacheCoherence-PT-none, examination is ReachabilityCardinality"
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-146347661900007"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;