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

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

=== Now, execution of the tool begins

BK_START 1463605284301

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
ReachabilityCardinality @ Diffusion2D-PT-D30N150
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-1 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-4 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-5 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-6 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-8 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-9 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-10 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-11 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-12 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-13 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-ReachabilityCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA Diffusion2D-PT-D30N150-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: 7744/65536 symbol table entries, 1051 collisions
lola: preprocessing...
lola: finding significant places
lola: 900 places, 6844 transitions, 899 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 900 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D30N150-ReachabilityCardinality.task
lola: read: AG (cAMP__3_13_ <= cAMP__17_5_) : EF ((((cAMP__30_25_ <= cAMP__3_8_ AND 3 <= cAMP__19_25_) AND !(cAMP__13_25_ <= cAMP__13_23_)) OR (cAMP__16_19_ <= cAMP__4_5_ AND (3 <= cAMP__17_22_ OR 1 <= cAMP__4_11_)))) : AG ((!((1 <= cAMP__8_24_ AND 3 <= cAMP__8_1_)) OR ((cAMP__22_8_ <= cAMP__23_19_ OR 3 <= cAMP__9_14_) AND (1 <= cAMP__13_2_ AND 2 <= cAMP__10_2_)))) : AG ((((3 <= cAMP__7_1_ OR cAMP__30_10_ <= ... (shortened)
lola: formula length: 1117
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 (-cAMP__17_5_ + cAMP__3_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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality.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: EF (((cAMP__30_25_ + -cAMP__3_8_ <= 0 AND (-cAMP__19_25_ <= -3 AND cAMP__13_25_ + -cAMP__13_23_ > 0)) OR (-cAMP__4_5_ + cAMP__16_19_ <= 0 AND (-cAMP__17_22_ <= -3 OR -cAMP__4_11_ <= -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 3596 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 7 literals
lola: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cAMP__8_24_ > -1 OR (-cAMP__8_1_ > -3 OR ((-cAMP__23_19_ + cAMP__22_8_ <= 0 OR -cAMP__9_14_ <= -3) AND (-cAMP__13_2_ <= -1 AND -cAMP__10_2_ <= -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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-2.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-2.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 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((((-cAMP__7_1_ <= -3 OR -cAMP__15_13_ + cAMP__30_10_ <= 0) AND cAMP__24_14_ + -cAMP__17_4_ <= 0) OR -cAMP__9_13_ + cAMP__23_5_ <= 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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-3.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-3.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 4 will run for 293 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (cAMP__1_14_ + -cAMP__8_2_ > 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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-4.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 320 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__20_12_ + cAMP__5_19_ <= 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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-5.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-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 351 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((cAMP__18_3_ + -cAMP__18_19_ <= 0 OR (cAMP__13_20_ + -cAMP__8_2_ <= 0 OR -cAMP__17_8_ <= -3)) AND -cAMP__21_27_ + cAMP__16_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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-6.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-6.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 7 will run for 390 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cAMP__10_12_ > -2 OR (-cAMP__14_4_ > -3 AND -cAMP__9_29_ <= -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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-7.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 438 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (cAMP__30_5_ + -cAMP__6_3_ > 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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-8.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 501 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__2_24_ <= -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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-9.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 584 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (cAMP__24_3_ + -cAMP__5_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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-10.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-10.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 11 will run for 699 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-cAMP__30_26_ <= -2 OR -cAMP__11_16_ <= -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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-11.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 874 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__13_19_ + cAMP__23_1_ <= 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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-12.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-12.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 13 will run for 1164 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG ((-cAMP__9_1_ > -2 OR (cAMP__30_4_ + -cAMP__11_6_ <= 0 AND (cAMP__22_18_ + -cAMP__13_10_ <= 0 AND -cAMP__30_28_ > -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 3596 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 6 literals
lola: write sara problem file to Diffusion2D-PT-D30N150-ReachabilityCardinality-13.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-13.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 14 will run for 1743 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (-cAMP__12_28_ + cAMP__14_25_ <= 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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-14.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (-cAMP__25_7_ <= -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 3596 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 Diffusion2D-PT-D30N150-ReachabilityCardinality-15.sara
lola: calling and running sara
sara: try reading problem file Diffusion2D-PT-D30N150-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola: summary: no yes no no yes no no no yes yes no yes no no no yes

BK_STOP 1463605338173

--------------------
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="Diffusion2D-PT-D30N150"
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/Diffusion2D-PT-D30N150.tgz
mv Diffusion2D-PT-D30N150 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 Diffusion2D-PT-D30N150, 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-146348010700241"
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 ;