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-3253
Executing tool lola
Input is Diffusion2D-PT-D40N100, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309200394
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494637545056


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ Diffusion2D-PT-D40N100 @ 3540 seconds
----- Start make result stdout -----
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: 13924/65536 symbol table entries, 3777 collisions
lola: preprocessing...
lola: finding significant places
lola: 1600 places, 12324 transitions, 1599 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 1600 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D40N100-ReachabilityCardinality.task
lola: E (F ((1 <= cAMP__29_2_))) : E (F (((cAMP__30_17_ <= cAMP__13_11_) AND (cAMP__33_16_ <= cAMP__13_27_) AND (cAMP__17_14_ <= 1) AND (2 <= cAMP__29_13_)))) : A (G ((cAMP__37_11_ <= cAMP__39_39_))) : A (G ((cAMP__14_25_ <= cAMP__7_14_))) : A (G ((((3 <= cAMP__24_13_) OR (cAMP__15_24_ <= cAMP__1_10_)) AND (cAMP__33_36_ <= cAMP__37_25_) AND ((cAMP__20_10_ <= cAMP__3_11_) OR (cAMP__1_29_ <= cAMP__12_5_) OR (cAMP__10_2_ <= cAMP__40_2_) OR (3 <= cAMP__5_4_))))) : E (F (((1 <= cAMP__17_20_) AND (1 <= cAMP__31_35_) AND (cAMP__38_37_ <= 0) AND (2 <= cAMP__38_31_)))) : A (G ((cAMP__21_1_ <= 2))) : E (F (((2 <= cAMP__18_39_) AND (2 <= cAMP__15_28_)))) : E (F ((3 <= cAMP__37_15_))) : E (F ((cAMP__16_18_ + 1 <= cAMP__11_5_))) : A (G ((cAMP__3_19_ <= cAMP__36_9_))) : A (G ((cAMP__4_37_ <= cAMP__20_4_))) : A (G ((cAMP__31_10_ <= 1))) : A (G ((cAMP__6_31_ <= cAMP__21_30_))) : A (G (((3 <= cAMP__36_28_) OR ((cAMP__19_30_ <= cAMP__11_34_) AND (cAMP__6_3_ <= cAMP__27_7_)) OR ((1 <= cAMP__22_37_) AND (cAMP__28_31_ <= cAMP__19_32_))))) : E (F ((cAMP__33_26_ + 1 <= cAMP__37_18_)))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= cAMP__29_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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__30_17_ <= cAMP__13_11_) AND (cAMP__33_16_ <= cAMP__13_27_) AND (cAMP__17_14_ <= 1) AND (2 <= cAMP__29_13_))))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__37_11_ <= cAMP__39_39_)))
lola: ========================================
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__14_25_ <= cAMP__7_14_)))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((3 <= cAMP__24_13_) OR (cAMP__15_24_ <= cAMP__1_10_)) AND (cAMP__33_36_ <= cAMP__37_25_) AND ((cAMP__20_10_ <= cAMP__3_11_) OR (cAMP__1_29_ <= cAMP__12_5_) OR (cAMP__10_2_ <= cAMP__40_2_) OR (3 <= cAMP__5_4_)))))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 7 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= cAMP__17_20_) AND (1 <= cAMP__31_35_) AND (cAMP__38_37_ <= 0) AND (2 <= cAMP__38_31_))))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-5.sara.
lola: sara is running 0 secs || 4441 markings, 15063 edges, 888 markings/sec, 0 secs
lola: sara is running 5 secs || 8852 markings, 30594 edges, 882 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 13164 markings, 45670 edges, 862 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 352 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__21_1_ <= 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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-6.sara.
lola: sara is running 0 secs || 4249 markings, 15310 edges, 850 markings/sec, 0 secs
lola: sara is running 5 secs || 8495 markings, 30201 edges, 849 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 12724 markings, 45764 edges, 846 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 389 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__18_39_) AND (2 <= cAMP__15_28_))))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 4210 markings, 14930 edges, 842 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 8 will run for 437 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__37_15_)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: lola: ========================================
Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-8.sara.
lola: sara is running 0 secs || 4456 markings, 15935 edges, 891 markings/sec, 0 secs
lola: sara is running 5 secs || 8859 markings, 32249 edges, 881 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 13256 markings, 48588 edges, 879 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 497 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__16_18_ + 1 <= cAMP__11_5_)))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-9.sara.
lola: sara is running 0 secs || 4410 markings, 14871 edges, 882 markings/sec, 0 secs
lola: sara is running 5 secs || 8853 markings, 30455 edges, 889 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 13282 markings, 45260 edges, 886 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 577 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__3_19_ <= cAMP__36_9_)))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 4390 markings, 14557 edges, 878 markings/sec, 0 secs
lola: sara is running 5 secs || 8790 markings, 29942 edges, 880 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 10 secs || 13168 markings, 45759 edges, 876 markings/sec, 10 secs

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 11 will run for 689 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__4_37_ <= cAMP__20_4_)))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-11.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 12 will run for 861 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__31_10_ <= 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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1148 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__6_31_ <= cAMP__21_30_)))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 4422 markings, 14894 edges, 884 markings/sec, 0 secs
lola: sara is running 5 secs || 8834 markings, 30583 edges, 882 markings/sec, 5 secs
sara: place or transition ordering is non-deterministic

lola: sara is running 10 secs || 13256 markings, 45180 edges, 884 markings/sec, 10 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1713 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= cAMP__36_28_) OR ((cAMP__19_30_ <= cAMP__11_34_) AND (cAMP__6_3_ <= cAMP__27_7_)) OR ((1 <= cAMP__22_37_) AND (cAMP__28_31_ <= cAMP__19_32_)))))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 3426 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cAMP__33_26_ + 1 <= cAMP__37_18_)))
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 6396 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes no no no yes no yes yes yes no no no no no yes
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494637659292

--------------------
content from stderr:

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished 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-D40N100"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/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-D40N100.tgz
mv Diffusion2D-PT-D40N100 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is Diffusion2D-PT-D40N100, 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 r018-ebro-149436309200394"
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 ;