About the Execution of LoLA for CloudReconfiguration-PT-401
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
6936.340 | 656012.00 | 1313661.00 | 65.10 | FF?TTFFFFFFTFFFF | 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-401, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-csrt-149580961500187
=====================================================================
--------------------
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-401-ReachabilityCardinality-0
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-1
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-10
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-11
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-12
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-13
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-14
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-15
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-2
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-3
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-4
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-5
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-6
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-7
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-8
FORMULA_NAME CloudReconfiguration-PT-401-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1496535297650
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
CloudReconfiguration-PT-401: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-401: translating PT formula ReachabilityCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
ReachabilityCardinality @ CloudReconfiguration-PT-401 @ 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: 7817/65536 symbol table entries, 1515 collisions
lola: preprocessing...
lola: finding significant places
lola: 3554 places, 4263 transitions, 3549 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 3718 transition conflict sets
lola: TASK
lola: reading formula from CloudReconfiguration-PT-401-ReachabilityCardinality.task
lola: E (F (((3 <= p2809) AND (1 <= p3542) AND (p3483 + 1 <= p2557) AND ((1 <= p2376) OR (p2135 + 1 <= p2648))))) : A (G (((1 <= p1309) OR (1 <= p254) OR ((p1098 <= p1212) AND (p102 <= p274)) OR (p2187 + 1 <= p3232) OR ((p2891 <= p2251) AND (p3098 <= p3255))))) : E (F (((2 <= p1371) AND ((p1097 + 1 <= p3492) OR ((2 <= p1822) AND (1 <= p1504)))))) : E (F (((3 <= p1818) AND ((p2927 + 1 <= p3454) OR ((1 <= p1407) AND (3 <= p2590)))))) : E (F (((p3443 <= p1182) AND (p1410 <= p1723) AND (2 <= p2951) AND (p348 <= p905) AND (p661 <= p778) AND (p954 + 1 <= p1358)))) : A (G ((p2068 <= 2))) : A (G ((p1927 <= p2387))) : A (G ((p1753 <= p1317))) : E (F (((1 <= p1911) AND (p173 <= p299) AND (p247 + 1 <= p3553) AND (p3103 <= p1544)))) : E (F (((p1490 + 1 <= p3122) AND (p935 <= 0) AND ((3 <= p1823) OR (1 <= p3162))))) : A (G ((((p273 <= p3319) AND (p1534 <= p1199)) OR ((p2072 <= p618) AND (3 <= p1516)) OR (p1068 <= p3)))) : A (G ((p1734 <= 1))) : E (F (((p3208 + 1 <= p3167) OR (p404 + 1 <= p2139) OR (p3357 + 1 <= p3404)))) : A (G ((p3292 <= p822))) : A (G ((p2911 <= 0))) : A (G ((p2116 <= p1283)))
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 (((3 <= p2809) AND (1 <= p3542) AND (p3483 + 1 <= p2557) AND ((1 <= p2376) OR (p2135 + 1 <= p2648)))))
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 444 bytes per marking, with 3 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 CloudReconfiguration-PT-401-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 85377 markings, 122416 edges, 17075 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 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p1309) OR (1 <= p254) OR ((p1098 <= p1212) AND (p102 <= p274)) OR (p2187 + 1 <= p3232) OR ((p2891 <= p2251) AND (p3098 <= p3255)))))
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 444 bytes per marking, with 3 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 20 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-401-ReachabilityCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 79307 markings, 122776 edges, 15861 markings/sec, 0 secs
lola: sara is running 5 secs || 161563 markings, 240429 edges, 16451 markings/sec, 5 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 251 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((2 <= p1371) AND ((p1097 + 1 <= p3492) OR ((2 <= p1822) AND (1 <= p1504))))))
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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-2.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 84402 markings, 105146 edges, 16880 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 3 will run for 269 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= p1818) AND ((p2927 + 1 <= p3454) OR ((1 <= p1407) AND (3 <= p2590))))))
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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-3.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-3.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 90261 markings, 135831 edges, 18052 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 4 will run for 291 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3443 <= p1182) AND (p1410 <= p1723) AND (2 <= p2951) AND (p348 <= p905) AND (p661 <= p778) AND (p954 + 1 <= p1358))))
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 444 bytes per marking, with 3 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 CloudReconfiguration-PT-401-ReachabilityCardinality-4.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-4.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 117620 markings, 143460 edges, 23524 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 5 will run for 317 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2068 <= 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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-5.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-5.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 94177 markings, 112354 edges, 18835 markings/sec, 0 secs
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 6 will run for 348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1927 <= p2387)))
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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-6.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-6.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 7 will run for 387 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1753 <= p1317)))
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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-7.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 8 will run for 435 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1911) AND (p173 <= p299) AND (p247 + 1 <= p3553) AND (p3103 <= p1544))))
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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-8.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 95531 markings, 137874 edges, 19106 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 9 will run for 496 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1490 + 1 <= p3122) AND (p935 <= 0) AND ((3 <= p1823) OR (1 <= p3162)))))
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 444 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-401-ReachabilityCardinality-9.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-9.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 65289 markings, 111256 edges, 13058 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 10 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((((p273 <= p3319) AND (p1534 <= p1199)) OR ((p2072 <= p618) AND (3 <= p1516)) OR (p1068 <= p3))))
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 444 bytes per marking, with 3 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 12 literals and 4 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-401-ReachabilityCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 54194 markings, 112051 edges, 10839 markings/sec, 0 secs
lola: sara is running 5 secs || 142996 markings, 231673 edges, 17760 markings/sec, 5 secs
lola: sara is running 10 secs || 242492 markings, 360117 edges, 19899 markings/sec, 10 secs
lola: sara is running 15 secs || 333740 markings, 480475 edges, 18250 markings/sec, 15 secs
lola: sara is running 20 secs || 421866 markings, 592311 edges, 17625 markings/sec, 20 secs
lola: sara is running 25 secs || 506504 markings, 696763 edges, 16928 markings/sec, 25 secs
lola: sara is running 30 secs || 602530 markings, 817560 edges, 19205 markings/sec, 30 secs
lola: sara is running 35 secs || 689087 markings, 927045 edges, 17311 markings/sec, 35 secs
lola: sara is running 40 secs || 777603 markings, 1040896 edges, 17703 markings/sec, 40 secs
lola: sara is running 45 secs || 864256 markings, 1150508 edges, 17331 markings/sec, 45 secs
lola: sara is running 50 secs || 953598 markings, 1264018 edges, 17868 markings/sec, 50 secs
lola: sara is running 55 secs || 1041344 markings, 1375552 edges, 17549 markings/sec, 55 secs
lola: sara is running 60 secs || 1134613 markings, 1491739 edges, 18654 markings/sec, 60 secs
lola: sara is running 65 secs || 1226358 markings, 1609277 edges, 18349 markings/sec, 65 secs
lola: sara is running 70 secs || 1315437 markings, 1723762 edges, 17816 markings/sec, 70 secs
lola: sara is running 75 secs || 1404194 markings, 1843299 edges, 17751 markings/sec, 75 secs
lola: sara is running 80 secs || 1494032 markings, 1956555 edges, 17968 markings/sec, 80 secs
lola: sara is running 85 secs || 1586785 markings, 2076200 edges, 18551 markings/sec, 85 secs
lola: sara is running 90 secs || 1679179 markings, 2193924 edges, 18479 markings/sec, 90 secs
lola: sara is running 95 secs || 1770878 markings, 2310045 edges, 18340 markings/sec, 95 secs
lola: sara is running 100 secs || 1873557 markings, 2436126 edges, 20536 markings/sec, 100 secs
lola: sara is running 105 secs || 1971935 markings, 2557635 edges, 19676 markings/sec, 105 secs
lola: sara is running 110 secs || 2067301 markings, 2675571 edges, 19073 markings/sec, 110 secs
lola: sara is running 115 secs || 2162573 markings, 2792069 edges, 19054 markings/sec, 115 secs
lola: sara is running 120 secs || 2255439 markings, 2910947 edges, 18573 markings/sec, 120 secs
lola: sara is running 125 secs || 2354446 markings, 3032878 edges, 19801 markings/sec, 125 secs
lola: sara is running 130 secs || 2451502 markings, 3152955 edges, 19411 markings/sec, 130 secs
lola: sara is running 135 secs || 2547843 markings, 3271256 edges, 19268 markings/sec, 135 secs
lola: sara is running 140 secs || 2642374 markings, 3387443 edges, 18906 markings/sec, 140 secs
lola: sara is running 145 secs || 2737704 markings, 3506515 edges, 19066 markings/sec, 145 secs
lola: sara is running 150 secs || 2830794 markings, 3622261 edges, 18618 markings/sec, 150 secs
lola: sara is running 155 secs || 2923519 markings, 3736885 edges, 18545 markings/sec, 155 secs
lola: sara is running 160 secs || 3028540 markings, 3866562 edges, 21004 markings/sec, 160 secs
lola: sara is running 165 secs || 3133546 markings, 3995510 edges, 21001 markings/sec, 165 secs
lola: sara is running 170 secs || 3219145 markings, 4105952 edges, 17120 markings/sec, 170 secs
lola: sara is running 175 secs || 3298230 markings, 4205817 edges, 15817 markings/sec, 175 secs
lola: sara is running 180 secs || 3371691 markings, 4295596 edges, 14692 markings/sec, 180 secs
lola: sara is running 185 secs || 3448030 markings, 4393630 edges, 15268 markings/sec, 185 secs
lola: sara is running 190 secs || 3528964 markings, 4493529 edges, 16187 markings/sec, 190 secs
lola: sara is running 195 secs || 3613045 markings, 4598435 edges, 16816 markings/sec, 195 secs
lola: sara is running 200 secs || 3709783 markings, 4718096 edges, 19348 markings/sec, 200 secs
lola: sara is running 205 secs || 3804006 markings, 4836097 edges, 18845 markings/sec, 205 secs
lola: sara is running 210 secs || 3880797 markings, 4932445 edges, 15358 markings/sec, 210 secs
lola: sara is running 215 secs || 3958302 markings, 5027486 edges, 15501 markings/sec, 215 secs
lola: sara is running 220 secs || 4038436 markings, 5130213 edges, 16027 markings/sec, 220 secs
lola: sara is running 225 secs || 4115800 markings, 5227084 edges, 15473 markings/sec, 225 secs
lola: sara is running 230 secs || 4192730 markings, 5324634 edges, 15386 markings/sec, 230 secs
lola: sara is running 235 secs || 4283011 markings, 5436399 edges, 18056 markings/sec, 235 secs
lola: sara is running 240 secs || 4369717 markings, 5548626 edges, 17341 markings/sec, 240 secs
lola: sara is running 245 secs || 4455712 markings, 5653639 edges, 17199 markings/sec, 245 secs
lola: sara is running 250 secs || 4544298 markings, 5766508 edges, 17717 markings/sec, 250 secs
lola: sara is running 255 secs || 4632714 markings, 5876992 edges, 17683 markings/sec, 255 secs
lola: sara is running 260 secs || 4721135 markings, 5986256 edges, 17684 markings/sec, 260 secs
lola: sara is running 265 secs || 4821430 markings, 6109611 edges, 20059 markings/sec, 265 secs
lola: sara is running 270 secs || 4918652 markings, 6229714 edges, 19444 markings/sec, 270 secs
lola: sara is running 275 secs || 5014832 markings, 6347957 edges, 19236 markings/sec, 275 secs
lola: sara is running 280 secs || 5107061 markings, 6462246 edges, 18446 markings/sec, 280 secs
lola: sara is running 285 secs || 5192634 markings, 6570785 edges, 17115 markings/sec, 285 secs
lola: sara is running 290 secs || 5276452 markings, 6674724 edges, 16764 markings/sec, 290 secs
lola: sara is running 295 secs || 5367664 markings, 6790724 edges, 18242 markings/sec, 295 secs
lola: sara is running 300 secs || 5461362 markings, 6908045 edges, 18740 markings/sec, 300 secs
lola: sara is running 305 secs || 5535320 markings, 7000346 edges, 14792 markings/sec, 305 secs
lola: sara is running 310 secs || 5614184 markings, 7100759 edges, 15773 markings/sec, 310 secs
lola: sara is running 315 secs || 5703290 markings, 7211868 edges, 17821 markings/sec, 315 secs
lola: sara is running 320 secs || 5786887 markings, 7322337 edges, 16719 markings/sec, 320 secs
lola: sara is running 325 secs || 5885178 markings, 7444452 edges, 19658 markings/sec, 325 secs
lola: sara is running 330 secs || 5979057 markings, 7561084 edges, 18776 markings/sec, 330 secs
lola: sara is running 335 secs || 6075919 markings, 7681326 edges, 19372 markings/sec, 335 secs
lola: sara is running 340 secs || 6176937 markings, 7807007 edges, 20204 markings/sec, 340 secs
lola: sara is running 345 secs || 6270646 markings, 7935562 edges, 18742 markings/sec, 345 secs
lola: sara is running 350 secs || 6362408 markings, 8047154 edges, 18352 markings/sec, 350 secs
lola: sara is running 355 secs || 6453384 markings, 8158933 edges, 18195 markings/sec, 355 secs
lola: sara is running 360 secs || 6540883 markings, 8265471 edges, 17500 markings/sec, 360 secs
lola: sara is running 365 secs || 6631587 markings, 8385782 edges, 18141 markings/sec, 365 secs
lola: sara is running 370 secs || 6724233 markings, 8505719 edges, 18529 markings/sec, 370 secs
lola: sara is running 375 secs || 6820642 markings, 8623372 edges, 19282 markings/sec, 375 secs
lola: sara is running 380 secs || 6912979 markings, 8736146 edges, 18467 markings/sec, 380 secs
lola: sara is running 385 secs || 7005454 markings, 8849072 edges, 18495 markings/sec, 385 secs
lola: sara is running 390 secs || 7099185 markings, 8963569 edges, 18746 markings/sec, 390 secs
lola: sara is running 395 secs || 7189535 markings, 9075786 edges, 18070 markings/sec, 395 secs
lola: sara is running 400 secs || 7277383 markings, 9181784 edges, 17570 markings/sec, 400 secs
lola: sara is running 405 secs || 7363508 markings, 9286135 edges, 17225 markings/sec, 405 secs
lola: sara is running 410 secs || 7450135 markings, 9390529 edges, 17325 markings/sec, 410 secs
lola: sara is running 415 secs || 7537821 markings, 9496688 edges, 17537 markings/sec, 415 secs
lola: sara is running 420 secs || 7625158 markings, 9604622 edges, 17467 markings/sec, 420 secs
lola: sara is running 425 secs || 7710269 markings, 9744117 edges, 17022 markings/sec, 425 secs
lola: sara is running 430 secs || 7774938 markings, 9904971 edges, 12934 markings/sec, 430 secs
lola: sara is running 435 secs || 7857529 markings, 10007381 edges, 16518 markings/sec, 435 secs
lola: sara is running 440 secs || 7937265 markings, 10123437 edges, 15947 markings/sec, 440 secs
lola: sara is running 445 secs || 8010564 markings, 10223325 edges, 14660 markings/sec, 445 secs
lola: sara is running 450 secs || 8086669 markings, 10322889 edges, 15221 markings/sec, 450 secs
lola: sara is running 455 secs || 8163283 markings, 10419117 edges, 15323 markings/sec, 455 secs
lola: sara is running 460 secs || 8239876 markings, 10512681 edges, 15319 markings/sec, 460 secs
lola: sara is running 465 secs || 8317801 markings, 10613088 edges, 15585 markings/sec, 465 secs
lola: sara is running 470 secs || 8401266 markings, 10716912 edges, 16693 markings/sec, 470 secs
lola: sara is running 475 secs || 8480357 markings, 10827571 edges, 15818 markings/sec, 475 secs
lola: sara is running 480 secs || 8548378 markings, 10914237 edges, 13604 markings/sec, 480 secs
lola: sara is running 485 secs || 8615959 markings, 11003222 edges, 13516 markings/sec, 485 secs
lola: sara is running 490 secs || 8682287 markings, 11089230 edges, 13266 markings/sec, 490 secs
lola: sara is running 495 secs || 8754860 markings, 11181798 edges, 14515 markings/sec, 495 secs
lola: sara is running 500 secs || 8828836 markings, 11278990 edges, 14795 markings/sec, 500 secs
lola: sara is running 505 secs || 8894603 markings, 11363936 edges, 13153 markings/sec, 505 secs
lola: sara is running 510 secs || 8967212 markings, 11459490 edges, 14522 markings/sec, 510 secs
lola: sara is running 515 secs || 9041615 markings, 11553229 edges, 14881 markings/sec, 515 secs
lola: sara is running 520 secs || 9113923 markings, 11641677 edges, 14462 markings/sec, 520 secs
lola: sara is running 525 secs || 9185782 markings, 11734185 edges, 14372 markings/sec, 525 secs
lola: sara is running 530 secs || 9260101 markings, 11827143 edges, 14864 markings/sec, 530 secs
lola: sara is running 535 secs || 9343215 markings, 11930636 edges, 16623 markings/sec, 535 secs
lola: sara is running 540 secs || 9407346 markings, 12018325 edges, 12826 markings/sec, 540 secs
lola: sara is running 545 secs || 9484033 markings, 12117753 edges, 15337 markings/sec, 545 secs
lola: sara is running 550 secs || 9561713 markings, 12216567 edges, 15536 markings/sec, 550 secs
lola: sara is running 555 secs || 9641442 markings, 12317335 edges, 15946 markings/sec, 555 secs
lola: sara is running 560 secs || 9713171 markings, 12409940 edges, 14346 markings/sec, 560 secs
lola: sara is running 565 secs || 9786553 markings, 12502938 edges, 14676 markings/sec, 565 secs
lola: sara is running 570 secs || 9853852 markings, 12590551 edges, 13460 markings/sec, 570 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 11 will run for 578 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p1734 <= 1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 444 bytes per marking, with 3 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-401-ReachabilityCardinality-11.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-11.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 92861 markings, 112558 edges, 18572 markings/sec, 0 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 721 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p3208 + 1 <= p3167) OR (p404 + 1 <= p2139) OR (p3357 + 1 <= p3404))))
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 444 bytes per marking, with 3 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 3 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-401-ReachabilityCardinality-12.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-12.sara.
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 13 will run for 961 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p3292 <= p822)))
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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-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 1442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2911 <= 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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-14.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 15 will run for 2884 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p2116 <= p1283)))
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 444 bytes per marking, with 3 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-401-ReachabilityCardinality-15.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-401-ReachabilityCardinality-15.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no no no no yes no no no no unknown yes yes no no no
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-10 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-401-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----
BK_STOP 1496535953662
--------------------
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-401"
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-401.tgz
mv CloudReconfiguration-PT-401 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-401, 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-149580961500187"
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 ;