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 Dekker-PT-100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r026kn-smll-146348010400043
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463495811755

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Dekker-PT-100
FORMULA Dekker-PT-100-ReachabilityCardinality-0 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-14 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Dekker-PT-100-ReachabilityCardinality-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: 10700/65536 symbol table entries, 4008 collisions
lola: preprocessing...
lola: finding significant places
lola: 500 places, 10200 transitions, 200 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 20300 transition conflict sets
lola: TASK
lola: reading formula from Dekker-PT-100-ReachabilityCardinality.task
lola: read: EF (1 <= p3_62) : AG (((!(p1_47 <= p0_79) OR !(p0_53 <= p3_42)) OR (!(p3_60 <= flag_1_45) OR p3_24 <= p0_43))) : AG (flag_1_59 <= p0_4) : AG ((!((flag_0_14 <= flag_0_30 AND 3 <= p1_63)) AND !(3 <= p0_98))) : EF ((!(!(flag_0_24 <= p0_15)) AND ((3 <= flag_1_41 OR 3 <= p1_19) OR (p1_86 <= flag_0_62 AND 2 <= flag_0_44)))) : EF (((!(1 <= p1_32) AND (2 <= p1_4 AND p3_12 <= p3_72)) AND !(p3_67 <= flag_1_... (shortened)
lola: formula length: 1367
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-p3_62 <= -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p0_79 + p1_47 > 0 OR (-p3_42 + p0_53 > 0 OR (p3_60 + -flag_1_45 > 0 OR p3_24 + -p0_43 <= 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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-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 251 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-p0_4 + flag_1_59 <= 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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-2.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-flag_0_30 + flag_0_14 > 0 OR -p1_63 > -3) AND -p0_98 > -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityCardinality-3.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 4 will run for 292 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p0_15 + flag_0_24 <= 0 AND (-flag_1_41 <= -3 OR (-p1_19 <= -3 OR (-flag_0_62 + p1_86 <= 0 AND -flag_0_44 <= -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityCardinality-4.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 5 will run for 318 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p1_32 > -1 AND (-p1_4 <= -2 AND (-p3_72 + p3_12 <= 0 AND p3_67 + -flag_1_54 > 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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityCardinality-5.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 6 will run for 348 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-flag_1_63 <= -2 OR -p3_0 <= -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityCardinality-6.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 7 will run for 385 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p1_46 <= -3 OR (p3_11 + -flag_0_61 <= 0 AND -p1_21 <= -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityCardinality-7.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 8 will run for 432 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-flag_0_61 + flag_1_57 <= 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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-8.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 494 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p0_38 + flag_0_76 <= 0 OR ((p3_28 + -flag_0_29 <= 0 OR -p3_85 + p1_88 <= 0) AND flag_0_77 + -flag_0_21 <= 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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 576 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-p0_62 > -2 OR (-flag_0_48 > -1 OR (-flag_0_21 > -1 AND -p1_42 > -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityCardinality-10.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 11 will run for 689 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((flag_0_87 + -flag_1_83 <= 0 AND -p0_52 <= -1) OR (-flag_0_11 > -1 OR -p3_94 > -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-11.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 861 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-p1_4 <= -2 OR p0_86 + -p1_83 <= 0) AND (-flag_1_43 <= -3 AND -p0_9 <= -1)) OR (-flag_0_69 + flag_1_36 <= 0 OR -p0_36 > -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-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 1144 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-p0_26 + flag_0_76 <= 0 OR -flag_1_21 + flag_1_2 <= 0) AND (flag_1_41 + -flag_1_31 <= 0 OR -flag_0_69 <= -1)) OR (-flag_0_66 + flag_1_37 <= 0 AND (-flag_0_56 <= -3 AND -flag_1_75 <= -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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-13.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1716 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-flag_1_30 <= -1 AND (-flag_1_4 <= -3 AND (-p0_90 + flag_1_29 <= 0 AND -p3_67 + flag_0_70 <= 0))) OR ((-flag_1_93 <= -3 AND -p0_82 <= -3) OR -flag_0_20 > -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 28 bytes per marking, with 24 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 24 literals
lola: write sara problem file to Dekker-PT-100-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file Dekker-PT-100-ReachabilityCardinality-14.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 15 will run for 3418 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((flag_0_60 + -flag_1_83 > 0 AND p0_99 + -flag_1_97 > 0) OR ((flag_0_73 + -flag_0_33 <= 0 OR -p3_96 <= -1) AND -p0_90 + flag_1_13 <= 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 28 bytes per marking, with 24 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 Dekker-PT-100-ReachabilityCardinality-15.sara
lola: calling and running sara
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola: summary: yes no no yes no no yes no no no yes no yes no yes no

BK_STOP 1463495933865

--------------------
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="Dekker-PT-100"
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/Dekker-PT-100.tgz
mv Dekker-PT-100 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 Dekker-PT-100, 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 r026kn-smll-146348010400043"
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 ;