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 Vasy2003-PT-none, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r134kn-smll-146384395500169
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463892837088

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Vasy2003-PT-none
FORMULA Vasy2003-PT-none-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-7 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-PT-none-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Vasy2003-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: 1261/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 485 places, 776 transitions, 419 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 962 transition conflict sets
lola: TASK
lola: reading formula from Vasy2003-PT-none-ReachabilityCardinality.task
lola: read: AG (p151 <= p326) : AG ((((2 <= p272 OR 1 <= p469) AND !(3 <= p89)) OR ((p65 <= p133 OR p226 <= p343) OR (3 <= p482 AND 3 <= p160)))) : AG (p37 <= p159) : EF (3 <= p242) : AG ((((p228 <= p118 OR 2 <= p381) AND (1 <= p220 AND 2 <= p251)) OR (!(2 <= p465) OR (p431 <= p257 OR p221 <= p127)))) : AG (p302 <= p92) : EF (3 <= p57) : EF (1 <= p407) : EF ((!((p44 <= p423 AND p484 <= p180)) AND 2 <= p146)) ... (shortened)
lola: formula length: 750
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 (-p326 + p151 <= 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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-p272 <= -2 OR -p469 <= -1) AND -p89 > -3) OR (-p133 + p65 <= 0 OR (-p343 + p226 <= 0 OR (-p482 <= -3 AND -p160 <= -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 56 bytes per marking, with 29 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 18 literals
lola: write sara problem file to Vasy2003-PT-none-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (p37 + -p159 <= 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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-2.sara
lola: SUBRESULT
lola: calling and running sara
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p242 <= -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 56 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-2.sara.
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 Vasy2003-PT-none-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
sara: place or transition ordering is non-deterministic


lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-p118 + p228 <= 0 OR -p381 <= -2) AND (-p220 <= -1 AND -p251 <= -2)) OR (-p465 > -2 OR (p431 + -p257 <= 0 OR -p127 + p221 <= 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 56 bytes per marking, with 29 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 13 literals
lola: write sara problem file to Vasy2003-PT-none-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-4.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: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p92 + p302 <= 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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p57 <= -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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p407 <= -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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((p44 + -p423 > 0 OR p484 + -p180 > 0) AND -p146 <= -2))
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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p338 <= -3 AND ((-p46 + p242 <= 0 OR -p30 <= -1) AND -p90 <= -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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p196 <= -1 OR p46 + -p144 <= 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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-10.sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p321 > -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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-11.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: subprocess 12 will run for 884 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p232 <= -3 OR (-p420 <= -1 OR (-p480 + p439 <= 0 OR (p276 + -p200 <= 0 OR -p16 > -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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-12.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: subprocess 13 will run for 1179 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (p297 + -p177 > 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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution produced
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1769 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((p430 + -p199 > 0 OR -p471 <= -2) AND (-p283 <= -1 AND (-p166 <= -1 AND (-p189 <= -3 AND -p469 <= -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 56 bytes per marking, with 29 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 10 literals
lola: write sara problem file to Vasy2003-PT-none-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-14.sara.
sara: place or transition ordering is non-deterministic

lola: sara:solution impossible
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3537 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p192 <= -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 56 bytes per marking, with 29 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 Vasy2003-PT-none-ReachabilityCardinality-15.sara
lola: SUBRESULT
lola: lola: calling and running sararesult: yes

lola: The predicate is reachable.
lola: RESULT
lola: summary: no no no no yes no no yes no no no yes yes yes no yes
lola: ========================================
sara: try reading problem file Vasy2003-PT-none-ReachabilityCardinality-15.sara.

BK_STOP 1463892840075

--------------------
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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/root/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/Vasy2003-PT-none.tgz
mv Vasy2003-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 Vasy2003-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 r134kn-smll-146384395500169"
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 ;