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-D50N150, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309300439
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494641167734


Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityCardinality @ Diffusion2D-PT-D50N150 @ 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: 21904/65536 symbol table entries, 8280 collisions
lola: preprocessing...
lola: finding significant places
lola: 2500 places, 19404 transitions, 2499 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2500 transition conflict sets
lola: TASK
lola: reading formula from Diffusion2D-PT-D50N150-ReachabilityCardinality.task
lola: E (F (((cAMP__25_27_ <= cAMP__37_27_) AND (2 <= cAMP__38_7_)))) : E (F ((((cAMP__44_50_ + 1 <= cAMP__47_2_) AND (cAMP__37_28_ + 1 <= cAMP__29_44_)) OR ((cAMP__15_19_ + 1 <= cAMP__31_16_) AND (cAMP__21_1_ + 1 <= cAMP__33_42_))))) : E (F ((3 <= cAMP__15_48_))) : E (F ((((cAMP__5_22_ + 1 <= cAMP__44_31_) OR (cAMP__44_32_ + 1 <= cAMP__36_25_)) AND (cAMP__50_2_ <= cAMP__42_20_)))) : E (F ((((1 <= cAMP__23_12_) AND (2 <= cAMP__29_36_) AND ((2 <= cAMP__30_24_) OR (cAMP__22_31_ <= cAMP__40_36_))) OR (3 <= cAMP__39_20_)))) : E (F (((2 <= cAMP__15_33_) OR ((cAMP__5_10_ + 1 <= cAMP__19_31_) AND (cAMP__1_42_ + 1 <= cAMP__44_33_))))) : A (G ((cAMP__45_31_ <= cAMP__21_8_))) : E (F (((cAMP__31_32_ + 1 <= cAMP__38_41_) OR (cAMP__46_8_ + 1 <= cAMP__36_44_) OR (2 <= cAMP__1_42_) OR ((cAMP__16_39_ <= cAMP__22_25_) AND (1 <= cAMP__49_13_))))) : A (G ((cAMP__29_41_ <= cAMP__5_31_))) : E (F (((cAMP__24_28_ <= 0) AND (cAMP__43_18_ <= 1) AND (1 <= cAMP__50_11_)))) : E (F (((3 <= cAMP__21_19_) AND ((cAMP__17_3_ <= cAMP__14_23_) OR (cAMP__3_12_ <= cAMP__22_10_) OR ((1 <= cAMP__42_44_) AND (2 <= cAMP__29_18_)))))) : E (F (((3 <= cAMP__20_48_) AND (1 <= cAMP__37_24_) AND ((cAMP__5_19_ <= cAMP__29_34_) OR (cAMP__11_25_ <= cAMP__30_15_)) AND (cAMP__6_7_ <= cAMP__6_1_)))) : A (G ((cAMP__30_16_ <= 2))) : A (G ((cAMP__1_32_ <= cAMP__36_25_))) : A (G (((((3 <= cAMP__14_26_) AND (2 <= cAMP__46_47_)) OR (cAMP__9_8_ <= 2)) AND ((2 <= cAMP__44_35_) OR (cAMP__34_41_ <= cAMP__35_37_))))) : E (F (((cAMP__11_42_ <= 1) AND (cAMP__37_2_ <= 2) AND ((cAMP__47_50_ + 1 <= cAMP__20_1_) OR (cAMP__15_31_ + 1 <= cAMP__13_22_)))))
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 (((cAMP__25_27_ <= cAMP__37_27_) AND (2 <= cAMP__38_7_))))
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 9996 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-D50N150-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__44_50_ + 1 <= cAMP__47_2_) AND (cAMP__37_28_ + 1 <= cAMP__29_44_)) OR ((cAMP__15_19_ + 1 <= cAMP__31_16_) AND (cAMP__21_1_ + 1 <= cAMP__33_42_)))))
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 9996 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 2464 markings, 8326 edges, 493 markings/sec, 0 secs
lola: sara is running 5 secs || 4904 markings, 17278 edges, 488 markings/sec, 5 secs
lola: sara is running 10 secs || 7405 markings, 26637 edges, 500 markings/sec, 10 secs
lola: sara is running 15 secs || 9906 markings, 35241 edges, 500 markings/sec, 15 secs
lola: sara is running 20 secs || 12404 markings, 44300 edges, 500 markings/sec, 20 secs
lola: sara is running 25 secs || 14923 markings, 52754 edges, 504 markings/sec, 25 secs
lola: sara is running 30 secs || 17444 markings, 60119 edges, 504 markings/sec, 30 secs
lola: sara is running 35 secs || 19950 markings, 67956 edges, 501 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 22452 markings, 76345 edges, 500 markings/sec, 40 secs

lola: sara is running 45 secs || 24958 markings, 85127 edges, 501 markings/sec, 45 secs
lola: sara is running 50 secs || 27476 markings, 93392 edges, 504 markings/sec, 50 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 248 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= cAMP__15_48_)))
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 9996 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-D50N150-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-2.sara.
lola: sara is running 0 secs || 2444 markings, 8942 edges, 489 markings/sec, 0 secs
lola: sara is running 5 secs || 4897 markings, 17653 edges, 491 markings/sec, 5 secs
lola: sara is running 10 secs || 7345 markings, 25840 edges, 490 markings/sec, 10 secs
lola: sara is running 15 secs || 9798 markings, 34263 edges, 491 markings/sec, 15 secs
lola: sara is running 20 secs || 12252 markings, 42569 edges, 491 markings/sec, 20 secs
lola: sara is running 25 secs || 14731 markings, 51050 edges, 496 markings/sec, 25 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 265 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F ((((cAMP__5_22_ + 1 <= cAMP__44_31_) OR (cAMP__44_32_ + 1 <= cAMP__36_25_)) AND (cAMP__50_2_ <= cAMP__42_20_))))
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 9996 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 287 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((1 <= cAMP__23_12_) AND (2 <= cAMP__29_36_) AND ((2 <= cAMP__30_24_) OR (cAMP__22_31_ <= cAMP__40_36_))) OR (3 <= cAMP__39_20_))))
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 9996 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-D50N150-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 312 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= cAMP__15_33_) OR ((cAMP__5_10_ + 1 <= cAMP__19_31_) AND (cAMP__1_42_ + 1 <= cAMP__44_33_)))))
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 9996 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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 6 will run for 344 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__45_31_ <= cAMP__21_8_)))
lola: ========================================
lola: SUBTASK
lola: 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 9996 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-D50N150-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 382 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__31_32_ + 1 <= cAMP__38_41_) OR (cAMP__46_8_ + 1 <= cAMP__36_44_) OR (2 <= cAMP__1_42_) OR ((cAMP__16_39_ <= cAMP__22_25_) AND (1 <= cAMP__49_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 9996 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 5 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 429 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__29_41_ <= cAMP__5_31_)))
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 9996 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-D50N150-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 9 will run for 491 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__24_28_ <= 0) AND (cAMP__43_18_ <= 1) AND (1 <= cAMP__50_11_))))
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 9996 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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 573 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__21_19_) AND ((cAMP__17_3_ <= cAMP__14_23_) OR (cAMP__3_12_ <= cAMP__22_10_) OR ((1 <= cAMP__42_44_) AND (2 <= cAMP__29_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 9996 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-D50N150-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 2510 markings, 8590 edges, 502 markings/sec, 0 secs
lola: sara is running 5 secs || 5012 markings, 17751 edges, 500 markings/sec, 5 secs
lola: sara is running 10 secs || 7496 markings, 26117 edges, 497 markings/sec, 10 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 684 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= cAMP__20_48_) AND (1 <= cAMP__37_24_) AND ((cAMP__5_19_ <= cAMP__29_34_) OR (cAMP__11_25_ <= cAMP__30_15_)) AND (cAMP__6_7_ <= cAMP__6_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 9996 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 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 2427 markings, 8617 edges, 485 markings/sec, 0 secs
lola: sara is running 5 secs || 4834 markings, 16893 edges, 481 markings/sec, 5 secs
lola: sara is running 10 secs || 7273 markings, 25366 edges, 488 markings/sec, 10 secs
lola: sara is running 15 secs || 9692 markings, 33764 edges, 484 markings/sec, 15 secs
lola: sara is running 20 secs || 12132 markings, 42413 edges, 488 markings/sec, 20 secs
lola: sara is running 25 secs || 14503 markings, 50424 edges, 474 markings/sec, 25 secs
lola: sara is running 30 secs || 16935 markings, 58869 edges, 486 markings/sec, 30 secs
lola: sara is running 35 secs || 19349 markings, 67233 edges, 483 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 21755 markings, 75347 edges, 481 markings/sec, 40 secs

lola: sara is running 45 secs || 24209 markings, 83563 edges, 491 markings/sec, 45 secs
lola: sara is running 50 secs || 26673 markings, 91512 edges, 493 markings/sec, 50 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 842 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__30_16_ <= 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 9996 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-D50N150-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-12.sara.
lola: sara is running 0 secs || 2468 markings, 8714 edges, 494 markings/sec, 0 secs
lola: sara is running 5 secs || 4936 markings, 17474 edges, 494 markings/sec, 5 secs
lola: sara is running 10 secs || 7399 markings, 26640 edges, 493 markings/sec, 10 secs
lola: sara is running 15 secs || 9869 markings, 35247 edges, 494 markings/sec, 15 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1115 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cAMP__1_32_ <= cAMP__36_25_)))
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 9996 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-D50N150-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-13.sara.
lola: sara is running 0 secs || 2453 markings, 8542 edges, 491 markings/sec, 0 secs
lola: sara is running 5 secs || 4903 markings, 17596 edges, 490 markings/sec, 5 secs
lola: sara is running 10 secs || 7372 markings, 26274 edges, 494 markings/sec, 10 secs
lola: sara is running 15 secs || 9823 markings, 34970 edges, 490 markings/sec, 15 secs
lola: sara is running 20 secs || 12267 markings, 44262 edges, 489 markings/sec, 20 secs
lola: sara is running 25 secs || 14730 markings, 52919 edges, 493 markings/sec, 25 secs
lola: sara is running 30 secs || 17199 markings, 60733 edges, 494 markings/sec, 30 secs
lola: sara is running 35 secs || 19653 markings, 69874 edges, 491 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 22093 markings, 78914 edges, 488 markings/sec, 40 secs

lola: sara is running 45 secs || 24543 markings, 87847 edges, 490 markings/sec, 45 secs
lola: sara is running 50 secs || 26994 markings, 96454 edges, 490 markings/sec, 50 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 1645 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((((3 <= cAMP__14_26_) AND (2 <= cAMP__46_47_)) OR (cAMP__9_8_ <= 2)) AND ((2 <= cAMP__44_35_) OR (cAMP__34_41_ <= cAMP__35_37_)))))
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 9996 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 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-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 3291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cAMP__11_42_ <= 1) AND (cAMP__37_2_ <= 2) AND ((cAMP__47_50_ + 1 <= cAMP__20_1_) OR (cAMP__15_31_ + 1 <= cAMP__13_22_)))))
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 9996 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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D50N150-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D50N150-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: yes yes yes yes yes yes no yes no yes yes yes no no no yes
lola: ========================================
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D50N150-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1494641417076

--------------------
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-D50N150"
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-D50N150.tgz
mv Diffusion2D-PT-D50N150 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-D50N150, 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-149436309300439"
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 ;