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-307, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961300061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496530467255


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


checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-307: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ CloudReconfiguration-PT-307 @ 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: 5678/65536 symbol table entries, 638 collisions
lola: preprocessing...
lola: finding significant places
lola: 2584 places, 3094 transitions, 2580 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 2707 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-307-ReachabilityCardinality.task
lola: E (F (((p273 <= p2512) AND (1 <= p1218) AND (p1918 <= 2) AND (3 <= p1510)))) : E (F ((p2571 + 1 <= p2305))) : A (G ((((p774 <= 0) AND (p119 <= p1498)) OR (((p34 <= p2016) OR (2 <= p1793)) AND (p2017 + 1 <= p1797))))) : E (F ((((p1511 <= p1284) AND (3 <= p1032) AND ((p1639 <= p1222) OR (p1803 <= p988))) OR ((1 <= p1308) AND ((p499 <= p105) OR (3 <= p931)))))) : A (G ((p2419 <= p796))) : E (F ((((p2447 <= p911) AND (2 <= p2537)) OR (3 <= p1032) OR (2 <= p759)))) : E (F (((p2268 <= p154) AND ((2 <= p2130) OR (2 <= p380)) AND ((3 <= p2089) OR (3 <= p1358) OR (p2347 <= p1839))))) : E (F (((((2 <= p1082) OR (2 <= p2066)) AND ((1 <= p2177) OR (2 <= p187))) OR ((p752 + 1 <= p609) AND ((2 <= p1390) OR (3 <= p1895)))))) : A (G (((p151 <= p322) AND (p969 <= p1454)))) : E (F ((3 <= p1063))) : E (F ((p431 + 1 <= p1197))) : E (F ((2 <= p875))) : A (G ((p1588 <= p1358))) : E (F ((((p1713 <= 0) OR (p1004 + 1 <= p1504)) AND (2 <= p2307)))) : E (F ((p1520 + 1 <= p1904))) : E (F ((((3 <= p1753) OR (3 <= p214) OR (p449 <= 1)) AND (1 <= p2023))))
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 (((p273 <= p2512) AND (1 <= p1218) AND (p1918 <= 2) AND (3 <= p1510))))
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 12 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 CloudReconfiguration-PT-307-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p2571 + 1 <= p2305)))
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 12 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-307-ReachabilityCardinality.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p774 <= 0) AND (p119 <= p1498)) OR (((p34 <= p2016) OR (2 <= p1793)) AND (p2017 + 1 <= p1797)))))
lola: ========================================
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 12 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 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-307-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-2.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1511 <= p1284) AND (3 <= p1032) AND ((p1639 <= p1222) OR (p1803 <= p988))) OR ((1 <= p1308) AND ((p499 <= p105) OR (3 <= p931))))))
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 12 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 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-307-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 99686 markings, 119855 edges, 19937 markings/sec, 0 secs
lola: sara is running 5 secs || 197708 markings, 238020 edges, 19604 markings/sec, 5 secs
lola: sara is running 10 secs || 307502 markings, 371100 edges, 21959 markings/sec, 10 secs
lola: sara is running 15 secs || 412076 markings, 496550 edges, 20915 markings/sec, 15 secs
lola: sara is running 20 secs || 519164 markings, 625597 edges, 21418 markings/sec, 20 secs
lola: sara is running 25 secs || 635070 markings, 766849 edges, 23181 markings/sec, 25 secs
lola: sara is running 30 secs || 749921 markings, 906021 edges, 22970 markings/sec, 30 secs
lola: sara is running 35 secs || 869314 markings, 1049935 edges, 23879 markings/sec, 35 secs
lola: sara is running 40 secs || 984591 markings, 1189943 edges, 23055 markings/sec, 40 secs
lola: sara is running 45 secs || 1097902 markings, 1328240 edges, 22662 markings/sec, 45 secs
lola: sara is running 50 secs || 1211182 markings, 1466226 edges, 22656 markings/sec, 50 secs
lola: sara is running 55 secs || 1320937 markings, 1599730 edges, 21951 markings/sec, 55 secs
lola: sara is running 60 secs || 1426980 markings, 1728548 edges, 21209 markings/sec, 60 secs
lola: sara is running 65 secs || 1536706 markings, 1862342 edges, 21945 markings/sec, 65 secs
lola: sara is running 70 secs || 1648681 markings, 2001420 edges, 22395 markings/sec, 70 secs
lola: sara is running 75 secs || 1748003 markings, 2126343 edges, 19864 markings/sec, 75 secs
lola: sara is running 80 secs || 1857963 markings, 2261573 edges, 21992 markings/sec, 80 secs
lola: sara is running 85 secs || 1959009 markings, 2384684 edges, 20209 markings/sec, 85 secs
lola: sara is running 90 secs || 2062143 markings, 2511251 edges, 20627 markings/sec, 90 secs
lola: sara is running 95 secs || 2165589 markings, 2641678 edges, 20689 markings/sec, 95 secs
lola: sara is running 100 secs || 2258889 markings, 2757958 edges, 18660 markings/sec, 100 secs
lola: sara is running 105 secs || 2358564 markings, 2883382 edges, 19935 markings/sec, 105 secs
lola: sara is running 110 secs || 2457457 markings, 3005480 edges, 19779 markings/sec, 110 secs
lola: sara is running 115 secs || 2561433 markings, 3130566 edges, 20795 markings/sec, 115 secs
lola: sara is running 120 secs || 2671473 markings, 3268513 edges, 22008 markings/sec, 120 secs
lola: sara is running 125 secs || 2765980 markings, 3386395 edges, 18901 markings/sec, 125 secs
lola: sara is running 130 secs || 2867643 markings, 3513461 edges, 20333 markings/sec, 130 secs
lola: sara is running 135 secs || 2996187 markings, 3674445 edges, 25709 markings/sec, 135 secs
lola: sara is running 140 secs || 3133057 markings, 3844382 edges, 27374 markings/sec, 140 secs
lola: sara is running 145 secs || 3261093 markings, 4004253 edges, 25607 markings/sec, 145 secs
lola: sara is running 150 secs || 3368128 markings, 4141251 edges, 21407 markings/sec, 150 secs
lola: sara is running 155 secs || 3490491 markings, 4295246 edges, 24473 markings/sec, 155 secs
lola: sara is running 160 secs || 3594015 markings, 4423802 edges, 20705 markings/sec, 160 secs
lola: sara is running 165 secs || 3714184 markings, 4573236 edges, 24034 markings/sec, 165 secs
lola: sara is running 170 secs || 3839647 markings, 4729436 edges, 25093 markings/sec, 170 secs
lola: sara is running 175 secs || 3955484 markings, 4876415 edges, 23167 markings/sec, 175 secs
lola: sara is running 180 secs || 4062182 markings, 5014948 edges, 21340 markings/sec, 180 secs
lola: sara is running 185 secs || 4167781 markings, 5147413 edges, 21120 markings/sec, 185 secs
lola: sara is running 190 secs || 4264918 markings, 5269002 edges, 19427 markings/sec, 190 secs
lola: sara is running 195 secs || 4359523 markings, 5387793 edges, 18921 markings/sec, 195 secs
lola: sara is running 200 secs || 4472102 markings, 5531578 edges, 22516 markings/sec, 200 secs
lola: sara is running 205 secs || 4581051 markings, 5672007 edges, 21790 markings/sec, 205 secs
lola: sara is running 210 secs || 4682643 markings, 5799715 edges, 20318 markings/sec, 210 secs
lola: sara is running 215 secs || 4829518 markings, 5980021 edges, 29375 markings/sec, 215 secs
lola: sara is running 220 secs || 4968261 markings, 6154024 edges, 27749 markings/sec, 220 secs
lola: sara is running 225 secs || 5096841 markings, 6317723 edges, 25716 markings/sec, 225 secs
lola: sara is running 230 secs || 5236503 markings, 6494353 edges, 27932 markings/sec, 230 secs
lola: sara is running 235 secs || 5372186 markings, 6663962 edges, 27137 markings/sec, 235 secs
lola: sara is running 240 secs || 5505467 markings, 6833434 edges, 26656 markings/sec, 240 secs
lola: sara is running 245 secs || 5645783 markings, 7007788 edges, 28063 markings/sec, 245 secs
lola: sara is running 250 secs || 5763959 markings, 7157742 edges, 23635 markings/sec, 250 secs
lola: sara is running 255 secs || 5891410 markings, 7318863 edges, 25490 markings/sec, 255 secs
lola: sara is running 260 secs || 6019866 markings, 7483052 edges, 25691 markings/sec, 260 secs
lola: sara is running 265 secs || 6149892 markings, 7649910 edges, 26005 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2419 <= p796)))
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 12 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-307-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-4.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p2447 <= p911) AND (2 <= p2537)) OR (3 <= p1032) OR (2 <= p759))))
lola: 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 12 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-307-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic

lola: sara is running 0 secs || 104511 markings, 211551 edges, 20902 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 6 will run for 325 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p2268 <= p154) AND ((2 <= p2130) OR (2 <= p380)) AND ((3 <= p2089) OR (3 <= p1358) OR (p2347 <= p1839)))))
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 12 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 18 literals and 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-307-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-6.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 90299 markings, 178249 edges, 18060 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 7 will run for 361 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((((2 <= p1082) OR (2 <= p2066)) AND ((1 <= p2177) OR (2 <= p187))) OR ((p752 + 1 <= p609) AND ((2 <= p1390) OR (3 <= p1895))))))
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 12 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 6 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-307-ReachabilityCardinality-7.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-7.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 103559 markings, 147101 edges, 20712 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 8 will run for 405 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p151 <= p322) AND (p969 <= p1454))))
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 12 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 CloudReconfiguration-PT-307-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-8.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: subprocess 9 will run for 463 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((3 <= p1063)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: ========================================
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 12 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-307-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 10 will run for 540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p431 + 1 <= p1197)))
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 12 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-307-ReachabilityCardinality-10.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 11 will run for 648 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= p875)))
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 12 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-307-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 12 will run for 809 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1588 <= p1358)))
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 12 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-307-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 1079 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((p1713 <= 0) OR (p1004 + 1 <= p1504)) AND (2 <= p2307))))
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 12 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-307-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-13.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is unreachable.
lola: ========================================
lola: subprocess 14 will run for 1616 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((p1520 + 1 <= p1904)))
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 12 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-307-ReachabilityCardinality-14.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-307-ReachabilityCardinality-14.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: subprocess 15 will run for 3232 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ========================================lola:
...considering subproblem: E (F ((((3 <= p1753) OR (3 <= p214) OR (p449 <= 1)) AND (1 <= p2023))))
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 12 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-307-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: RESULT
lola:
SUMMARY: no yes no unknown no no no no no no yes no no no yes yes
lola: ========================================
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-307-ReachabilityCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496530775177

--------------------
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-307"
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/CloudReconfiguration-PT-307.tgz
mv CloudReconfiguration-PT-307 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-307, 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 r178-csrt-149580961300061"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;