About the Execution of LoLA for S_Diffusion2D-PT-D40N100
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
163.550 | 3434.00 | 5274.00 | 20.20 | FTTFFTFTTTTFFTTT | normal |
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 S_Diffusion2D-PT-D40N100, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r098-ebro-149488455800396
=====================================================================
--------------------
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-ReachabilityFireability-0
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-1
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-10
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-11
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-12
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-13
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-14
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-15
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-2
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-3
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-4
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-5
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-6
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-7
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-8
FORMULA_NAME Diffusion2D-PT-D40N100-ReachabilityFireability-9
=== Now, execution of the tool begins
BK_START 1496462061171
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_Diffusion2D-PT-D40N100: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_Diffusion2D-PT-D40N100: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ S_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-ReachabilityFireability.task
lola: A (G ((FIREABLE(t1_28_39_27_38) OR FIREABLE(t1_22_10_22_11) OR (FIREABLE(t1_10_29_11_30) AND FIREABLE(t1_18_32_18_31)) OR FIREABLE(t1_4_30_3_30) OR NOT FIREABLE(t1_34_8_35_9)))) : E (F (FIREABLE(t1_20_38_20_39))) : E (F (FIREABLE(t1_16_28_15_28))) : E (F ((FIREABLE(t1_40_17_40_18) OR (FIREABLE(t1_15_19_14_19) AND NOT FIREABLE(t1_25_13_25_14))))) : E (F (FIREABLE(t1_29_32_30_32))) : A (G (NOT FIREABLE(t1_20_11_20_10))) : A (G ((FIREABLE(t1_11_34_10_34) OR (NOT FIREABLE(t1_37_40_38_39) AND NOT FIREABLE(t1_23_29_23_28))))) : E (F (((FIREABLE(t1_28_13_28_14) AND FIREABLE(t1_38_34_38_35) AND (FIREABLE(t1_20_23_19_23) OR FIREABLE(t1_35_1_34_1)) AND NOT FIREABLE(t1_27_3_26_2)) OR ((NOT FIREABLE(t1_32_40_32_39) OR NOT FIREABLE(t1_34_20_33_20)) AND FIREABLE(t1_12_16_13_16))))) : E (F ((FIREABLE(t1_38_6_37_5) AND FIREABLE(t1_28_28_28_29) AND FIREABLE(t1_2_25_2_24)))) : E (F ((FIREABLE(t1_34_14_33_14) OR FIREABLE(t1_6_8_6_7)))) : E (F (((FIREABLE(t1_36_10_37_11) OR FIREABLE(t1_20_39_20_40)) AND FIREABLE(t1_34_1_33_2)))) : A (G ((((NOT FIREABLE(t1_36_33_35_33) OR NOT FIREABLE(t1_2_36_1_37)) AND (NOT FIREABLE(t1_5_22_4_23) OR NOT FIREABLE(t1_29_40_30_39))) OR FIREABLE(t1_10_2_9_1)))) : A (G (NOT FIREABLE(t1_18_11_17_10))) : E (F (FIREABLE(t1_24_15_23_14))) : A (G (((FIREABLE(t1_16_5_17_5) OR FIREABLE(t1_6_35_5_35) OR NOT FIREABLE(t1_28_38_29_37)) AND (FIREABLE(t1_36_4_37_4) OR FIREABLE(t1_5_20_4_21) OR NOT FIREABLE(t1_38_2_37_1)) AND (NOT FIREABLE(t1_25_20_26_20) OR NOT FIREABLE(t1_30_8_29_9)) AND NOT FIREABLE(t1_17_13_17_14)))) : E (F ((FIREABLE(t1_33_33_34_34) AND (NOT FIREABLE(t1_18_14_19_14) OR NOT FIREABLE(t1_8_19_9_18)) AND FIREABLE(t1_9_40_10_39))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_28_39_27_38) OR FIREABLE(t1_22_10_22_11) OR (FIREABLE(t1_10_29_11_30) AND FIREABLE(t1_18_32_18_31)) OR FIREABLE(t1_4_30_3_30) OR NOT FIREABLE(t1_34_8_35_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 10 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_20_38_20_39)))
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-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_16_28_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 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_40_17_40_18) OR (FIREABLE(t1_15_19_14_19) AND NOT FIREABLE(t1_25_13_25_14)))))
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 3 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-3.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_29_32_30_32)))
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-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1_20_11_20_10)))
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-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1_11_34_10_34) OR (NOT FIREABLE(t1_37_40_38_39) AND NOT FIREABLE(t1_23_29_23_28)))))
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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-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 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_28_13_28_14) AND FIREABLE(t1_38_34_38_35) AND (FIREABLE(t1_20_23_19_23) OR FIREABLE(t1_35_1_34_1)) AND NOT FIREABLE(t1_27_3_26_2)) OR ((NOT FIREABLE(t1_32_40_32_39) OR NOT FIREABLE(t1_34_20_33_20)) AND FIREABLE(t1_12_16_13_16)))))
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 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_38_6_37_5) AND FIREABLE(t1_28_28_28_29) AND FIREABLE(t1_2_25_2_24))))
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 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_34_14_33_14) OR FIREABLE(t1_6_8_6_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 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 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-9.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 10 will run for 589 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1_36_10_37_11) OR FIREABLE(t1_20_39_20_40)) AND FIREABLE(t1_34_1_33_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 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-10.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 11 will run for 707 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((NOT FIREABLE(t1_36_33_35_33) OR NOT FIREABLE(t1_2_36_1_37)) AND (NOT FIREABLE(t1_5_22_4_23) OR NOT FIREABLE(t1_29_40_30_39))) OR FIREABLE(t1_10_2_9_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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-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 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (NOT FIREABLE(t1_18_11_17_10)))
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-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-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 1179 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1_24_15_23_14)))
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-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-13.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1768 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((FIREABLE(t1_16_5_17_5) OR FIREABLE(t1_6_35_5_35) OR NOT FIREABLE(t1_28_38_29_37)) AND (FIREABLE(t1_36_4_37_4) OR FIREABLE(t1_5_20_4_21) OR NOT FIREABLE(t1_38_2_37_1)) AND (NOT FIREABLE(t1_25_20_26_20) OR NOT FIREABLE(t1_30_8_29_9)) AND NOT FIREABLE(t1_17_13_17_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 9 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-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 3537 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t1_33_33_34_34) AND (NOT FIREABLE(t1_18_14_19_14) OR NOT FIREABLE(t1_8_19_9_18)) AND FIREABLE(t1_9_40_10_39))))
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 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to Diffusion2D-PT-D40N100-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file Diffusion2D-PT-D40N100-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes yes yes yes no no yes yes yes yes no no yes no yes
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA Diffusion2D-PT-D40N100-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496462064605
--------------------
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="S_Diffusion2D-PT-D40N100"
export BK_EXAMINATION="ReachabilityFireability"
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/S_Diffusion2D-PT-D40N100.tgz
mv S_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 S_Diffusion2D-PT-D40N100, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r098-ebro-149488455800396"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.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 '
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 ;