About the Execution of LoLA for S_PhaseVariation-PT-D20CS010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 317.120 | 310187.00 | 619161.00 | 935.40 | TFFTFFFTTTTFTFFF | 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-3254
Executing tool lola
Input is S_PhaseVariation-PT-D20CS010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r128-smll-149441681200124
=====================================================================
--------------------
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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-0
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-1
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-10
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-11
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-12
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-13
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-14
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-15
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-2
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-3
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-4
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-5
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-6
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-7
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-8
FORMULA_NAME PhaseVariation-PT-D20CS010-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496294892871
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_PhaseVariation-PT-D20CS010: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
S_PhaseVariation-PT-D20CS010: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ S_PhaseVariation-PT-D20CS010 @ 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: 14659/65536 symbol table entries, 2626 collisions
lola: preprocessing...
lola: finding significant places
lola: 1202 places, 13457 transitions, 801 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2 transition conflict sets
lola: TASK
lola: reading formula from PhaseVariation-PT-D20CS010-ReachabilityCardinality.task
lola: A (G (((cell___13_20__B_ <= 1) OR (cell___16_14__A_ + 1 <= pool__19_6_) OR (cell___14_20__B_ + 1 <= pool__6_8_) OR ((2 <= pool__10_16_) AND (cell___18_2__B_ <= pool__18_4_))))) : A (G (((cell___6_9__B_ <= cell___14_17__A_) OR ((3 <= cell___6_11__A_) AND (2 <= cell___10_15__B_) AND (cell___19_18__B_ <= cell___16_20__A_) AND (cell___15_20__A_ <= pool__2_17_))))) : E (F ((cell___9_2__A_ + 1 <= cell___7_3__A_))) : A (G ((cell___7_16__A_ <= 1))) : E (F (((cell___14_11__A_ <= 1) AND (cell___14_9__B_ + 1 <= cell___19_17__B_) AND (1 <= cell___1_3__A_)))) : A (G (((2 <= pool__1_9_) OR (cell___12_10__B_ <= pool__12_7_) OR (pool__3_2_ <= cell___16_17__B_) OR (pool__6_18_ <= 0)))) : E (F ((1 <= cell___5_19__B_))) : E (F (((cell___10_20__B_ <= cell___2_6__A_) AND (cell___14_10__A_ <= pool__15_11_) AND (pool__11_17_ + 1 <= pool__2_16_) AND (3 <= cell___17_13__B_) AND ((3 <= pool__2_7_) OR (2 <= cell___2_8__B_))))) : A (G (((pool__19_4_ <= pool__15_2_) AND ((pool__2_9_ + 1 <= pool__12_10_) OR (pool__10_10_ + 1 <= pool__4_12_))))) : A (G (((cell___10_8__B_ <= cell___3_9__B_) OR (cell___7_4__B_ <= cell___10_17__A_) OR (cell___1_6__A_ + 1 <= cell___6_8__B_) OR (3 <= cell___15_7__B_) OR (1 <= cell___7_20__A_) OR (cell___7_6__B_ + 1 <= cell___2_14__B_)))) : E (F (((cell___14_18__A_ <= pool__18_14_) AND (3 <= cell___15_13__B_)))) : A (G (((cell___17_15__B_ <= 1) OR (1 <= cell___1_7__B_) OR (2 <= cell___6_7__B_)))) : A (G (((3 <= cell___1_1__B_) OR (cell___8_2__A_ <= cell___19_5__B_)))) : A (G (((cell___1_15__B_ <= pool__16_4_) AND (pool__19_4_ <= 2)))) : E (F ((((cell___14_17__B_ <= pool__7_17_) AND (2 <= cell___18_1__B_)) OR (2 <= cell___6_10__B_)))) : E (F (((pool__13_18_ + 1 <= cell___6_3__B_) AND (pool__17_18_ + 1 <= cell___13_15__B_) AND (pool__17_14_ <= pool__2_20_))))
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 (((cell___13_20__B_ <= 1) OR (cell___16_14__A_ + 1 <= pool__19_6_) OR (cell___14_20__B_ + 1 <= pool__6_8_) OR ((2 <= pool__10_16_) AND (cell___18_2__B_ <= pool__18_4_)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality.sara.
lola: sara is running 0 secs || 1955 markings, 7111 edges, 391 markings/sec, 0 secs
lola: sara is running 5 secs || 8342 markings, 66194 edges, 1277 markings/sec, 5 secs
lola: sara is running 10 secs || 14682 markings, 127302 edges, 1268 markings/sec, 10 secs
lola: sara is running 15 secs || 20660 markings, 194194 edges, 1196 markings/sec, 15 secs
lola: sara is running 20 secs || 26232 markings, 270006 edges, 1114 markings/sec, 20 secs
lola: sara is running 25 secs || 32207 markings, 331815 edges, 1195 markings/sec, 25 secs
lola: sara is running 30 secs || 38053 markings, 397583 edges, 1169 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 43965 markings, 460574 edges, 1182 markings/sec, 35 secs
lola: sara is running 40 secs || 49855 markings, 524342 edges, 1178 markings/sec, 40 secs
lola: sara is running 45 secs || 55505 markings, 597904 edges, 1130 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 1 will run for 232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___6_9__B_ <= cell___14_17__A_) OR ((3 <= cell___6_11__A_) AND (2 <= cell___10_15__B_) AND (cell___19_18__B_ <= cell___16_20__A_) AND (cell___15_20__A_ <= pool__2_17_)))))
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 3204 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 4 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 249 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((cell___9_2__A_ + 1 <= cell___7_3__A_)))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 3 will run for 268 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((cell___7_16__A_ <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-3.sara.
lola: sara is running 0 secs || 2838 markings, 20343 edges, 568 markings/sec, 0 secs
lola: sara is running 5 secs || 9002 markings, 89852 edges, 1233 markings/sec, 5 secs
lola: sara is running 10 secs || 15245 markings, 156810 edges, 1249 markings/sec, 10 secs
lola: sara is running 15 secs || 21169 markings, 235660 edges, 1185 markings/sec, 15 secs
lola: sara is running 20 secs || 26825 markings, 323678 edges, 1131 markings/sec, 20 secs
lola: sara is running 25 secs || 33083 markings, 391279 edges, 1252 markings/sec, 25 secs
lola: sara is running 30 secs || 39012 markings, 470177 edges, 1186 markings/sec, 30 secs
lola: sara is running 35 secs || 44629 markings, 559764 edges, 1123 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 50914 markings, 625316 edges, 1257 markings/sec, 40 secs
lola: sara is running 45 secs || 56813 markings, 704666 edges, 1180 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 4 will run for 286 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cell___14_11__A_ <= 1) AND (cell___14_9__B_ + 1 <= cell___19_17__B_) AND (1 <= cell___1_3__A_))))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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: A (G (((2 <= pool__1_9_) OR (cell___12_10__B_ <= pool__12_7_) OR (pool__3_2_ <= cell___16_17__B_) OR (pool__6_18_ <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 3204 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-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 343 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= cell___5_19__B_)))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 7 will run for 381 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cell___10_20__B_ <= cell___2_6__A_) AND (cell___14_10__A_ <= pool__15_11_) AND (pool__11_17_ + 1 <= pool__2_16_) AND (3 <= cell___17_13__B_) AND ((3 <= pool__2_7_) OR (2 <= cell___2_8__B_)))))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-7.sara.
lola: sara is running 0 secs || 2396 markings, 10706 edges, 479 markings/sec, 0 secs
lola: sara is running 5 secs || 8883 markings, 71799 edges, 1297 markings/sec, 5 secs
lola: sara is running 10 secs || 15232 markings, 138052 edges, 1270 markings/sec, 10 secs
lola: sara is running 15 secs || 21732 markings, 198566 edges, 1300 markings/sec, 15 secs
lola: sara is running 20 secs || 28040 markings, 265719 edges, 1262 markings/sec, 20 secs
lola: sara is running 25 secs || 34195 markings, 338581 edges, 1231 markings/sec, 25 secs
lola: sara is running 30 secs || 40171 markings, 416295 edges, 1195 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 46609 markings, 479319 edges, 1288 markings/sec, 35 secs
lola: sara is running 40 secs || 52993 markings, 544179 edges, 1277 markings/sec, 40 secs
lola: sara is running 45 secs || 59137 markings, 617433 edges, 1229 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 8 will run for 423 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((pool__19_4_ <= pool__15_2_) AND ((pool__2_9_ + 1 <= pool__12_10_) OR (pool__10_10_ + 1 <= pool__4_12_)))))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-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 483 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___10_8__B_ <= cell___3_9__B_) OR (cell___7_4__B_ <= cell___10_17__A_) OR (cell___1_6__A_ + 1 <= cell___6_8__B_) OR (3 <= cell___15_7__B_) OR (1 <= cell___7_20__A_) OR (cell___7_6__B_ + 1 <= cell___2_14__B_))))
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 3204 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 1 conjunctive subformulas
lola: state equation: write sara problem file to PhaseVariation-PT-D20CS010-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-9.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 564 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((cell___14_18__A_ <= pool__18_14_) AND (3 <= cell___15_13__B_))))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-10.sara.
lola: sara is running 0 secs || 2086 markings, 12963 edges, 417 markings/sec, 0 secs
lola: sara is running 5 secs || 7947 markings, 75581 edges, 1172 markings/sec, 5 secs
lola: sara is running 10 secs || 13707 markings, 143372 edges, 1152 markings/sec, 10 secs
lola: sara is running 15 secs || 19474 markings, 211467 edges, 1153 markings/sec, 15 secs
lola: sara is running 20 secs || 24941 markings, 290519 edges, 1093 markings/sec, 20 secs
lola: sara is running 25 secs || 30555 markings, 365604 edges, 1123 markings/sec, 25 secs
lola: sara is running 30 secs || 36362 markings, 433275 edges, 1161 markings/sec, 30 secs
lola: sara is running 35 secs || 41972 markings, 506869 edges, 1122 markings/sec, 35 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 40 secs || 47578 markings, 583338 edges, 1121 markings/sec, 40 secs
lola: sara is running 45 secs || 53249 markings, 655623 edges, 1134 markings/sec, 45 secs
lola: sara is running 50 secs || 58844 markings, 730461 edges, 1119 markings/sec, 50 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 11 will run for 665 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___17_15__B_ <= 1) OR (1 <= cell___1_7__B_) OR (2 <= cell___6_7__B_))))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-11.sara.
lola: sara is running 0 secs || 1983 markings, 10982 edges, 397 markings/sec, 0 secs
lola: sara is running 5 secs || 8202 markings, 77221 edges, 1244 markings/sec, 5 secs
lola: sara is running 10 secs || 14289 markings, 149639 edges, 1217 markings/sec, 10 secs
lola: sara is running 15 secs || 20370 markings, 222179 edges, 1216 markings/sec, 15 secs
lola: sara is running 20 secs || 26075 markings, 308051 edges, 1141 markings/sec, 20 secs
lola: sara is running 25 secs || 32170 markings, 380649 edges, 1219 markings/sec, 25 secs
lola: sara is running 30 secs || 38223 markings, 454747 edges, 1211 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 44000 markings, 537824 edges, 1155 markings/sec, 35 secs
lola: sara is running 40 secs || 49964 markings, 615026 edges, 1193 markings/sec, 40 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 12 will run for 820 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((3 <= cell___1_1__B_) OR (cell___8_2__A_ <= cell___19_5__B_))))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 13 will run for 1093 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((cell___1_15__B_ <= pool__16_4_) AND (pool__19_4_ <= 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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 14 will run for 1640 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((cell___14_17__B_ <= pool__7_17_) AND (2 <= cell___18_1__B_)) OR (2 <= cell___6_10__B_))))
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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-14.sara.
lola: sara is running 0 secs || 2693 markings, 14499 edges, 539 markings/sec, 0 secs
lola: sara is running 5 secs || 9072 markings, 75644 edges, 1276 markings/sec, 5 secs
lola: sara is running 10 secs || 15493 markings, 135395 edges, 1284 markings/sec, 10 secs
lola: sara is running 15 secs || 21589 markings, 207652 edges, 1219 markings/sec, 15 secs
lola: sara is running 20 secs || 27391 markings, 290543 edges, 1160 markings/sec, 20 secs
lola: sara is running 25 secs || 33890 markings, 348766 edges, 1300 markings/sec, 25 secs
lola: sara is running 30 secs || 39972 markings, 421846 edges, 1216 markings/sec, 30 secs
sara: place or transition ordering is non-deterministic
lola: sara is running 35 secs || 45866 markings, 500981 edges, 1179 markings/sec, 35 secs
lola: sara is running 40 secs || 52290 markings, 561262 edges, 1285 markings/sec, 40 secs
lola: sara is running 45 secs || 58286 markings, 636835 edges, 1199 markings/sec, 45 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 15 will run for 3230 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((pool__13_18_ + 1 <= cell___6_3__B_) AND (pool__17_18_ + 1 <= cell___13_15__B_) AND (pool__17_14_ <= pool__2_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 3204 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 PhaseVariation-PT-D20CS010-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file PhaseVariation-PT-D20CS010-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: RESULT
lola:
SUMMARY: yes no yes yes yes no yes no no no no yes no no no yes
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA PhaseVariation-PT-D20CS010-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496295203058
--------------------
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_PhaseVariation-PT-D20CS010"
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/S_PhaseVariation-PT-D20CS010.tgz
mv S_PhaseVariation-PT-D20CS010 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool lola"
echo " Input is S_PhaseVariation-PT-D20CS010, 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 r128-smll-149441681200124"
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 '
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 ;