About the Execution of LoLA for DLCshifumi-PT-3b
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
275.210 | 48961.00 | 97648.00 | 32.80 | TTTTFTTFTFTTTFTT | 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 DLCshifumi-PT-3b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r018-ebro-149436309300477
=====================================================================
--------------------
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 DLCshifumi-PT-3b-ReachabilityFireability-0
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-1
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-10
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-11
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-12
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-13
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-14
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-15
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-2
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-3
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-4
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-5
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-6
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-7
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-8
FORMULA_NAME DLCshifumi-PT-3b-ReachabilityFireability-9
=== Now, execution of the tool begins
BK_START 1494644628925
Time: 3600 - MCC
----- Start make prepare stdout -----
checking for too many tokens
----- Start make result stdout -----
ReachabilityFireability @ DLCshifumi-PT-3b @ 3539 seconds
----- Start make result stdout -----
lola: LoLA will run for 3539 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 16669/65536 symbol table entries, 5526 collisions
lola: preprocessing...
lola: finding significant places
lola: 7058 places, 9611 transitions, 6776 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 12409 transition conflict sets
lola: TASK
lola: reading formula from DLCshifumi-PT-3b-ReachabilityFireability.task
lola: E (F ((FIREABLE(t7651) AND FIREABLE(t2617)))) : E (F (FIREABLE(t2745))) : E (F ((FIREABLE(t1962) AND FIREABLE(t7894) AND FIREABLE(t3596)))) : A (G ((NOT FIREABLE(t3061) OR NOT FIREABLE(t787) OR FIREABLE(t7221) OR (FIREABLE(t8797) AND FIREABLE(t2252) AND (FIREABLE(t5659) OR FIREABLE(t8111)) AND (FIREABLE(t8060) OR FIREABLE(t2214)))))) : E (F (((FIREABLE(t1426) OR NOT FIREABLE(t6719)) AND FIREABLE(t3028) AND FIREABLE(t5506)))) : E (F ((FIREABLE(t3778) OR FIREABLE(t9300) OR FIREABLE(t5443) OR FIREABLE(t3178) OR FIREABLE(t7054)))) : E (F (FIREABLE(t7829))) : A (G (((NOT FIREABLE(t7039) OR NOT FIREABLE(t6726)) AND NOT FIREABLE(t7237) AND (NOT FIREABLE(t5131) OR FIREABLE(t9216) OR FIREABLE(t6088) OR FIREABLE(t1766) OR FIREABLE(t7147))))) : E (F (((NOT FIREABLE(t4283) OR NOT FIREABLE(t353)) AND ((FIREABLE(t102) AND FIREABLE(t6895)) OR (FIREABLE(t3161) AND FIREABLE(t7020))) AND NOT FIREABLE(t8757) AND (FIREABLE(t420) OR FIREABLE(t544)) AND (NOT FIREABLE(t9290) OR FIREABLE(t7885))))) : E (F (((FIREABLE(t5935) OR (FIREABLE(t8068) AND FIREABLE(t5579)) OR (FIREABLE(t8765) AND FIREABLE(t8117))) AND (FIREABLE(t1507) OR (FIREABLE(t6016) AND FIREABLE(t3370) AND FIREABLE(t9298)))))) : E (F ((FIREABLE(t767) AND NOT FIREABLE(t5677)))) : E (F (((NOT FIREABLE(t3062) OR (FIREABLE(t1217) AND FIREABLE(t2771))) AND (NOT FIREABLE(t4745) OR NOT FIREABLE(t1017)) AND (FIREABLE(t1726) OR FIREABLE(t4744))))) : A (G (((NOT FIREABLE(t1802) AND NOT FIREABLE(t9471) AND NOT FIREABLE(t8568) AND NOT FIREABLE(t6572)) OR (FIREABLE(t9213) AND FIREABLE(t6621))))) : E (F (FIREABLE(t8163))) : E (F (FIREABLE(t7809))) : E (F (((FIREABLE(t3906) OR FIREABLE(t3704)) AND NOT FIREABLE(t4931) AND NOT FIREABLE(t1139) AND FIREABLE(t2776) AND FIREABLE(t8161))))
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 ((FIREABLE(t7651) AND FIREABLE(t2617))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityFireability.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 (FIREABLE(t2745)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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(t1962) AND FIREABLE(t7894) AND FIREABLE(t3596))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityFireability-2.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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: A (G ((NOT FIREABLE(t3061) OR NOT FIREABLE(t787) OR FIREABLE(t7221) OR (FIREABLE(t8797) AND FIREABLE(t2252) AND (FIREABLE(t5659) OR FIREABLE(t8111)) AND (FIREABLE(t8060) OR FIREABLE(t2214))))))
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 848 bytes per marking, with 8 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 64 literals and 14 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityFireability-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: E (F (((FIREABLE(t1426) OR NOT FIREABLE(t6719)) AND FIREABLE(t3028) AND FIREABLE(t5506))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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: E (F ((FIREABLE(t3778) OR FIREABLE(t9300) OR FIREABLE(t5443) OR FIREABLE(t3178) OR FIREABLE(t7054))))
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 848 bytes per marking, with 8 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 5 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityFireability-5.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityFireability-5.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7829)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityFireability-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t7039) OR NOT FIREABLE(t6726)) AND NOT FIREABLE(t7237) AND (NOT FIREABLE(t5131) OR FIREABLE(t9216) OR FIREABLE(t6088) OR FIREABLE(t1766) OR FIREABLE(t7147)))))
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 848 bytes per marking, with 8 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 25 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityFireability-7.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((NOT FIREABLE(t4283) OR NOT FIREABLE(t353)) AND ((FIREABLE(t102) AND FIREABLE(t6895)) OR (FIREABLE(t3161) AND FIREABLE(t7020))) AND NOT FIREABLE(t8757) AND (FIREABLE(t420) OR FIREABLE(t544)) AND (NOT FIREABLE(t9290) OR FIREABLE(t7885)))))
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 848 bytes per marking, with 8 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 328 literals and 48 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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(t5935) OR (FIREABLE(t8068) AND FIREABLE(t5579)) OR (FIREABLE(t8765) AND FIREABLE(t8117))) AND (FIREABLE(t1507) OR (FIREABLE(t6016) AND FIREABLE(t3370) AND FIREABLE(t9298))))))
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 848 bytes per marking, with 8 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 31 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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(t767) AND NOT FIREABLE(t5677))))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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: E (F (((NOT FIREABLE(t3062) OR (FIREABLE(t1217) AND FIREABLE(t2771))) AND (NOT FIREABLE(t4745) OR NOT FIREABLE(t1017)) AND (FIREABLE(t1726) OR FIREABLE(t4744)))))
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 848 bytes per marking, with 8 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 28 literals and 8 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityFireability-11.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 12 will run for 884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t1802) AND NOT FIREABLE(t9471) AND NOT FIREABLE(t8568) AND NOT FIREABLE(t6572)) OR (FIREABLE(t9213) AND FIREABLE(t6621)))))
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 848 bytes per marking, with 8 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 27 literals and 12 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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(t8163)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-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 1769 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t7809)))
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 848 bytes per marking, with 8 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 DLCshifumi-PT-3b-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityFireability-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 15 will run for 3539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t3906) OR FIREABLE(t3704)) AND NOT FIREABLE(t4931) AND NOT FIREABLE(t1139) AND FIREABLE(t2776) AND FIREABLE(t8161))))
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 848 bytes per marking, with 8 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 2 conjunctive subformulas
lola: state equation: write sara problem file to DLCshifumi-PT-3b-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file DLCshifumi-PT-3b-ReachabilityFireability-15.sara.
lola: sara is running 0 secs || 39720 markings, 45144 edges, 7944 markings/sec, 0 secs
lola: sara is running 5 secs || 71445 markings, 81326 edges, 6345 markings/sec, 5 secs
lola: sara is running 10 secs || 105060 markings, 119627 edges, 6723 markings/sec, 10 secs
lola: sara is running 15 secs || 154205 markings, 175580 edges, 9829 markings/sec, 15 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 20 secs || 204589 markings, 233097 edges, 10077 markings/sec, 20 secs
lola: sara is running 25 secs || 253278 markings, 288568 edges, 9738 markings/sec, 25 secs
lola: sara is running 30 secs || 300288 markings, 342147 edges, 9402 markings/sec, 30 secs
lola: sara is running 35 secs || 350227 markings, 399105 edges, 9988 markings/sec, 35 secs
lola: sara is running 40 secs || 401120 markings, 457088 edges, 10179 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes yes yes no yes yes yes no yes yes yes yes no yes yes no
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA DLCshifumi-PT-3b-ReachabilityFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1494644677886
--------------------
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="DLCshifumi-PT-3b"
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/DLCshifumi-PT-3b.tgz
mv DLCshifumi-PT-3b 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 DLCshifumi-PT-3b, 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 r018-ebro-149436309300477"
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 ;