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 PhaseVariation-PT-D20CS010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086kn-ebro-146369088200169
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463700101399

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ PhaseVariation-PT-D20CS010
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-2 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-3 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA PhaseVariation-PT-D20CS010-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: 14659/65536 symbol table entries, 2626 collisions
lola: preprocessing...
lola: finding significant places
lola: 1202 places, 13457 transitions, 801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D20CS010-ReachabilityCardinality.task
lola: read: EF ((((cell___4_20__B_ <= cell___7_14__B_ AND 1 <= cell___19_1__A_) AND (pool__9_6_ <= cell___19_10__B_ AND 2 <= cell___1_19__B_)) AND 2 <= cell___1_7__B_)) : AG (((!(cell___15_11__A_ <= cell___2_14__A_) OR (3 <= cell___1_15__B_ AND 2 <= cell___7_4__B_)) OR (!(cell___10_19__B_ <= pool__13_8_) OR (2 <= cell___15_1__A_ OR cell___2_18__B_ <= cell___1_10__A_)))) : EF (!(cell___20_6__B_ <= cell___6_17_... (shortened)
lola: formula length: 1252
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 ((-cell___7_14__B_ + cell___4_20__B_ <= 0 AND (-cell___19_1__A_ <= -1 AND (-cell___19_10__B_ + pool__9_6_ <= 0 AND (-cell___1_19__B_ <= -2 AND -cell___1_7__B_ <= -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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality.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 1 will run for 231 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((cell___15_11__A_ + -cell___2_14__A_ > 0 OR ((-cell___1_15__B_ <= -3 AND -cell___7_4__B_ <= -2) OR (cell___10_19__B_ + -pool__13_8_ > 0 OR (-cell___15_1__A_ <= -2 OR cell___2_18__B_ + -cell___1_10__A_ <= 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 10 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cell___6_17__B_ + cell___20_6__B_ > 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 267 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((cell___5_10__A_ + -cell___12_5__B_ > 0 OR -pool__19_6_ + pool__11_13_ > 0) AND -pool__9_6_ + cell___4_1__A_ <= 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 4 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 289 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cell___15_13__A_ <= -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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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 310 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cell___20_18__A_ > -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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-5.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 6 will run for 335 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cell___20_8__A_ <= -3 AND -pool__8_10_ + cell___12_13__A_ <= 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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 365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cell___13_15__B_ + pool__14_6_ > 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 411 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((pool__8_6_ + -pool__11_7_ <= 0 AND (-cell___20_20__B_ > -1 AND -pool__8_10_ + cell___13_5__B_ > 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 470 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cell___16_11__B_ > -2 AND (cell___2_1__B_ + -cell___15_13__A_ > 0 AND -pool__17_16_ <= -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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 548 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cell___6_12__B_ <= -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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-10.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 11 will run for 646 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cell___6_18__A_ <= -1 OR (-cell___20_9__B_ > -3 OR -cell___14_1__A_ + cell___20_3__A_ > 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 3 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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 792 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cell___15_8__B_ <= -2 AND -cell___19_1__B_ <= -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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 2 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-12.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 13 will run for 1035 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cell___10_17__A_ <= -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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-13.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 14 will run for 1522 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-cell___6_5__B_ <= -3 AND (-cell___11_14__B_ <= -1 OR -pool__8_8_ <= -2)) OR cell___12_16__A_ + -cell___12_10__B_ <= 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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 5 literals
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3044 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-pool__13_6_ <= -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 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: Transformation into DNF: expect 1 literals
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: RESULT
lola: summary: no no yes yes no yes no no yes yes no yes no no no no
lola: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-15.sara
lola: calling and running sara
lola: ========================================
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-15.sara.

BK_STOP 1463700598663

--------------------
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="PhaseVariation-PT-D20CS010"
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/PhaseVariation-PT-D20CS010.tgz
mv PhaseVariation-PT-D20CS010 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 PhaseVariation-PT-D20CS010, 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 r086kn-ebro-146369088200169"
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 ;