fond
Model Checking Contest @ Petri Nets 2017
7th edition, Zaragoza, Spain, June 27, 2017
Execution of r178-csrt-149580961200045
Last Updated
June 27, 2017

About the Execution of LoLA for CloudReconfiguration-PT-305

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
765.140 230976.00 462500.00 35.10 ?TFFFFTTTFFTFTTF 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 CloudReconfiguration-PT-305, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961200045
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1496529661536


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
CloudReconfiguration-PT-305: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-305: translating PT formula ReachabilityFireability into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityFireability @ CloudReconfiguration-PT-305 @ 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: 5680/65536 symbol table entries, 639 collisions
lola: preprocessing...
lola: finding significant places
lola: 2585 places, 3095 transitions, 2581 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2708 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-305-ReachabilityFireability.task
lola: A (G ((NOT FIREABLE(t2097) OR FIREABLE(t1797)))) : E (F (FIREABLE(t1834))) : E (F (FIREABLE(t1021))) : A (G (((NOT FIREABLE(t618) AND NOT FIREABLE(t996)) OR (NOT FIREABLE(t2074) AND NOT FIREABLE(t347)) OR (FIREABLE(t3005) AND FIREABLE(t2298) AND FIREABLE(t1577) AND FIREABLE(t1372))))) : A (G (((NOT FIREABLE(t484) OR NOT FIREABLE(t685) OR (NOT FIREABLE(t1369) AND NOT FIREABLE(t1959))) AND (NOT FIREABLE(t1004) OR NOT FIREABLE(t102))))) : E (F (((FIREABLE(t1446) AND (NOT FIREABLE(t462) OR NOT FIREABLE(t2414))) OR FIREABLE(t2312)))) : A (G ((FIREABLE(t2534) OR FIREABLE(t2503) OR NOT FIREABLE(t113) OR NOT FIREABLE(t2439) OR FIREABLE(t2652)))) : E (F ((FIREABLE(t2042) OR FIREABLE(t2101) OR (FIREABLE(t556) AND FIREABLE(t834) AND FIREABLE(t613) AND NOT FIREABLE(t1132))))) : E (F ((FIREABLE(t2381) AND (NOT FIREABLE(t2516) OR (NOT FIREABLE(t1464) AND NOT FIREABLE(t2822)))))) : A (G ((NOT FIREABLE(t910) AND NOT FIREABLE(t1784) AND (NOT FIREABLE(t1117) OR NOT FIREABLE(t1901)) AND NOT FIREABLE(t3090)))) : E (F ((NOT FIREABLE(t2277) AND FIREABLE(t1015) AND FIREABLE(t1396) AND (NOT FIREABLE(t660) OR FIREABLE(t2660) OR FIREABLE(t263))))) : A (G ((NOT FIREABLE(t2864) OR (FIREABLE(t1753) AND FIREABLE(t1164))))) : A (G ((NOT FIREABLE(t1463) OR (FIREABLE(t952) AND (NOT FIREABLE(t1801) OR NOT FIREABLE(t17)))))) : A (G ((FIREABLE(t1921) OR NOT FIREABLE(t2434) OR FIREABLE(t3045) OR (NOT FIREABLE(t635) AND NOT FIREABLE(t168) AND FIREABLE(t1915) AND FIREABLE(t1902) AND FIREABLE(t2333))))) : E (F (((FIREABLE(t1641) OR FIREABLE(t2614)) AND NOT FIREABLE(t1072)))) : E (F ((NOT FIREABLE(t2860) AND FIREABLE(t2301) AND NOT FIREABLE(t2763) AND NOT FIREABLE(t2556) AND (FIREABLE(t2830) OR FIREABLE(t1418)))))
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 ((NOT FIREABLE(t2097) OR FIREABLE(t1797))))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-305-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-ReachabilityFireability.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 56311 markings, 129169 edges, 11262 markings/sec, 0 secs
lola: sara is running 5 secs || 112005 markings, 285531 edges, 11139 markings/sec, 5 secs
lola: sara is running 10 secs || 166671 markings, 459343 edges, 10933 markings/sec, 10 secs
lola: sara is running 15 secs || 218749 markings, 627195 edges, 10416 markings/sec, 15 secs
lola: sara is running 20 secs || 271590 markings, 809531 edges, 10568 markings/sec, 20 secs
lola: sara is running 25 secs || 320583 markings, 970379 edges, 9799 markings/sec, 25 secs
lola: sara is running 30 secs || 366389 markings, 1129174 edges, 9161 markings/sec, 30 secs
lola: sara is running 35 secs || 414913 markings, 1267544 edges, 9705 markings/sec, 35 secs
lola: sara is running 40 secs || 464376 markings, 1410253 edges, 9893 markings/sec, 40 secs
lola: sara is running 45 secs || 512007 markings, 1550516 edges, 9526 markings/sec, 45 secs
lola: sara is running 50 secs || 557612 markings, 1706134 edges, 9121 markings/sec, 50 secs
lola: sara is running 55 secs || 602572 markings, 1857298 edges, 8992 markings/sec, 55 secs
lola: sara is running 60 secs || 648898 markings, 2008125 edges, 9265 markings/sec, 60 secs
lola: sara is running 65 secs || 696347 markings, 2162598 edges, 9490 markings/sec, 65 secs
lola: sara is running 70 secs || 738925 markings, 2316925 edges, 8516 markings/sec, 70 secs
lola: sara is running 75 secs || 790463 markings, 2486149 edges, 10308 markings/sec, 75 secs
lola: sara is running 80 secs || 838753 markings, 2651431 edges, 9658 markings/sec, 80 secs
lola: sara is running 85 secs || 884927 markings, 2804985 edges, 9235 markings/sec, 85 secs
lola: sara is running 90 secs || 933289 markings, 2971286 edges, 9672 markings/sec, 90 secs
lola: sara is running 95 secs || 981075 markings, 3117680 edges, 9557 markings/sec, 95 secs
lola: sara is running 100 secs || 1033102 markings, 3251578 edges, 10405 markings/sec, 100 secs
lola: sara is running 105 secs || 1086750 markings, 3385928 edges, 10730 markings/sec, 105 secs
lola: sara is running 110 secs || 1140488 markings, 3523050 edges, 10748 markings/sec, 110 secs
lola: sara is running 115 secs || 1193872 markings, 3656952 edges, 10677 markings/sec, 115 secs
lola: sara is running 120 secs || 1243093 markings, 3794269 edges, 9844 markings/sec, 120 secs
lola: sara is running 125 secs || 1291270 markings, 3953180 edges, 9635 markings/sec, 125 secs
lola: sara is running 130 secs || 1339255 markings, 4113085 edges, 9597 markings/sec, 130 secs
lola: sara is running 135 secs || 1385523 markings, 4287812 edges, 9254 markings/sec, 135 secs
lola: sara is running 140 secs || 1429677 markings, 4432194 edges, 8831 markings/sec, 140 secs
lola: sara is running 145 secs || 1472608 markings, 4575947 edges, 8586 markings/sec, 145 secs
lola: sara is running 150 secs || 1517307 markings, 4730011 edges, 8940 markings/sec, 150 secs
lola: sara is running 155 secs || 1570501 markings, 4866295 edges, 10639 markings/sec, 155 secs
lola: sara is running 160 secs || 1624231 markings, 5001733 edges, 10746 markings/sec, 160 secs
lola: sara is running 165 secs || 1679631 markings, 5133418 edges, 11080 markings/sec, 165 secs
lola: sara is running 170 secs || 1725462 markings, 5267283 edges, 9166 markings/sec, 170 secs
lola: sara is running 175 secs || 1770023 markings, 5410752 edges, 8912 markings/sec, 175 secs
lola: sara is running 180 secs || 1815673 markings, 5562358 edges, 9130 markings/sec, 180 secs
lola: sara is running 185 secs || 1864899 markings, 5700131 edges, 9845 markings/sec, 185 secs
lola: sara is running 190 secs || 1914575 markings, 5836133 edges, 9935 markings/sec, 190 secs
lola: sara is running 195 secs || 1962994 markings, 5996488 edges, 9684 markings/sec, 195 secs
lola: sara is running 200 secs || 2010022 markings, 6153230 edges, 9406 markings/sec, 200 secs
lola: sara is running 205 secs || 2056669 markings, 6308995 edges, 9329 markings/sec, 205 secs
lola: sara is running 210 secs || 2099640 markings, 6445889 edges, 8594 markings/sec, 210 secs
lola: sara is running 215 secs || 2144886 markings, 6596468 edges, 9049 markings/sec, 215 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1834)))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-305-ReachabilityFireability.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-ReachabilityFireability.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (FIREABLE(t1021)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: ========================================
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 11 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 CloudReconfiguration-PT-305-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 255 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t618) AND NOT FIREABLE(t996)) OR (NOT FIREABLE(t2074) AND NOT FIREABLE(t347)) OR (FIREABLE(t3005) AND FIREABLE(t2298) AND FIREABLE(t1577) AND FIREABLE(t1372)))))
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 324 bytes per marking, with 11 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 60 literals and 20 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-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 276 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((NOT FIREABLE(t484) OR NOT FIREABLE(t685) OR (NOT FIREABLE(t1369) AND NOT FIREABLE(t1959))) AND (NOT FIREABLE(t1004) OR NOT FIREABLE(t102)))))
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 324 bytes per marking, with 11 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-ReachabilityFireability-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 301 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1446) AND (NOT FIREABLE(t462) OR NOT FIREABLE(t2414))) OR FIREABLE(t2312))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-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 331 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t2534) OR FIREABLE(t2503) OR NOT FIREABLE(t113) OR NOT FIREABLE(t2439) OR FIREABLE(t2652))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-ReachabilityFireability-6.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 368 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2042) OR FIREABLE(t2101) OR (FIREABLE(t556) AND FIREABLE(t834) AND FIREABLE(t613) AND NOT FIREABLE(t1132)))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-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 414 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((FIREABLE(t2381) AND (NOT FIREABLE(t2516) OR (NOT FIREABLE(t1464) AND NOT FIREABLE(t2822))))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-ReachabilityFireability-8.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 9 will run for 473 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ...considering subproblem: A (G ((NOT FIREABLE(t910) AND NOT FIREABLE(t1784) AND (NOT FIREABLE(t1117) OR NOT FIREABLE(t1901)) AND NOT FIREABLE(t3090))))
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 324 bytes per marking, with 11 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 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-9.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 10 will run for 552 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2277) AND FIREABLE(t1015) AND FIREABLE(t1396) AND (NOT FIREABLE(t660) OR FIREABLE(t2660) OR FIREABLE(t263)))))
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 324 bytes per marking, with 11 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-ReachabilityFireability-10.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 143171 markings, 172367 edges, 28634 markings/sec, 0 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 661 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t2864) OR (FIREABLE(t1753) AND FIREABLE(t1164)))))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-305-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 827 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((NOT FIREABLE(t1463) OR (FIREABLE(t952) AND (NOT FIREABLE(t1801) OR NOT FIREABLE(t17))))))
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 324 bytes per marking, with 11 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 5 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 13 will run for 1103 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((FIREABLE(t1921) OR NOT FIREABLE(t2434) OR FIREABLE(t3045) OR (NOT FIREABLE(t635) AND NOT FIREABLE(t168) AND FIREABLE(t1915) AND FIREABLE(t1902) AND FIREABLE(t2333)))))
lola: ========================================
lola: SUBTASK
lola: ========================================
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 11 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 40 literals and 10 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-305-ReachabilityFireability-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-ReachabilityFireability-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 1654 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((FIREABLE(t1641) OR FIREABLE(t2614)) AND NOT FIREABLE(t1072))))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-305-ReachabilityFireability-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-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 3309 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((NOT FIREABLE(t2860) AND FIREABLE(t2301) AND NOT FIREABLE(t2763) AND NOT FIREABLE(t2556) AND (FIREABLE(t2830) OR FIREABLE(t1418)))))
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 324 bytes per marking, with 11 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 CloudReconfiguration-PT-305-ReachabilityFireability-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-305-ReachabilityFireability-15.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: unknown yes yes no no yes no yes yes no no no no no yes yes
lola: ========================================
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-0 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-305-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496529892512

--------------------
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="CloudReconfiguration-PT-305"
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/CloudReconfiguration-PT-305.tgz
mv CloudReconfiguration-PT-305 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 CloudReconfiguration-PT-305, 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 r178-csrt-149580961200045"
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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;