About the Execution of M4M.full for CloudReconfiguration-PT-312
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3674.750 | 798543.00 | 777334.00 | 2891.40 | FTF?TFTFF?TFFFTF | 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)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 4.0K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 23K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:49 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:49 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 10K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 118 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 356 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 14K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:49 equiv_col
-rw-r--r-- 1 mcc users 4 May 15 18:49 instance
-rw-r--r-- 1 mcc users 6 May 15 18:49 iscolored
-rw-r--r-- 1 mcc users 660K May 15 18:49 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is CloudReconfiguration-PT-312, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r058-smll-152646385500080
=====================================================================
--------------------
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-312-CTLCardinality-00
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-01
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-02
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-03
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-04
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-05
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-06
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-07
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-08
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-09
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-10
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-11
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-12
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-13
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-14
FORMULA_NAME CloudReconfiguration-PT-312-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1526513300367
BK_STOP 1526514098910
--------------------
content from stderr:
Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using CloudReconfiguration-PT-312 as instance name.
Using CloudReconfiguration as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'CTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': False, 'Source Place': True, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': True, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': True, 'Safe': True, 'Deadlock': None, 'Reversible': None, 'Quasi Live': None, 'Live': None}.
Known tools are: [{'Time': 615003, 'Memory': 1827.45, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola CloudReconfiguration-PT-312...
Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
CloudReconfiguration-PT-312: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete
checking for too many tokens
===========================================================================================
CloudReconfiguration-PT-312: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ CloudReconfiguration-PT-312 @ 3540 seconds
----- Start make result stderr -----
----- 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-312-CTLCardinality.task
lola: (E (F (E (F ((1 <= p175))))) AND (A (G (((p1531 <= p1857) OR (p60 <= p2385)))) AND A (X (((1 <= p2193) OR (p864 <= p79)))))) : E (G ((((p81 <= p393) OR (p2432 <= p1945) OR (2 <= p2267)) OR E (G ((1 <= p1315)))))) : E (F (E (F (((1 <= p709) AND (2 <= p2187)))))) : NOT((E (((p1193 <= p1825) U (3 <= p343))) OR (E (F ((p1289 <= p554))) AND (3 <= p956)))) : ((E (G ((p1774 <= p936))) OR ((3 <= p1174) OR ((p172 <= p768) AND (2 <= p704)) OR ((p1036 + 1 <= p2382) AND (p498 <= 0)))) AND E (((p327 <= p123) U ((p360 <= p862) OR (2 <= p2094))))) : ((p776 <= p2287) AND E (G (A (F ((2 <= p1796)))))) : NOT(NOT(E (G (((3 <= p2193) OR (p397 <= p1357)))))) : (E (X (((p933 <= p2503) AND (p2067 <= p2098) AND (1 <= p2461)))) OR (E (F (((1 <= p1910) AND (2 <= p499)))) OR E (G ((2 <= p215))))) : A ((A (F ((p1932 <= p1554))) U A (F ((3 <= p1593))))) : A (G (A (((3 <= p563) U (p2254 <= p267))))) : A (G ((p374 <= 1))) : A ((((p1820 <= 2) OR (p406 + 1 <= p1689)) U ((1 <= p2567) AND (3 <= p302) AND ((3 <= p654) OR (p2110 <= p2244))))) : (E (F (((p1894 + 1 <= p1627) OR (p1265 <= 1)))) AND A (G (((1 <= p483) OR (p2450 <= 0))))) : (E (G (A (F ((p1118 <= p1098))))) AND A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381))))) : E (G (((p2188 <= p2439) OR (2 <= p2580) OR (1 <= p2510)))) : E (G (A (G (((p539 <= p1661) OR (3 <= p2462))))))
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 (E (F ((1 <= p175))))) AND (A (G (((p1531 <= p1857) OR (p60 <= p2385)))) AND A (X (((1 <= p2193) OR (p864 <= p79))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p175)))
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: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 79 markings, 78 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((p1531 <= p1857) OR (p60 <= p2385))))
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-312-CTLCardinality.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 70475 markings, 124883 edges, 14095 markings/sec, 0 secs
lola: state equation: solution produced
lola: SUBRESULT
lola: result: no
lola: produced by: state equation
lola: The predicate is not invariant.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p81 <= p393) OR (p2432 <= p1945) OR (2 <= p2267)) OR E (G ((1 <= p1315))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p393 + 1 <= p81) AND (p1945 + 1 <= p2432) AND (p2267 <= 1)) AND A(TRUE U (p1315 <= 0)))))
lola: processed formula length: 105
lola: 6 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (E (F (((1 <= p709) AND (2 <= p2187))))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-312-CTLCardinality-2.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality-2.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 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (((p1193 <= p1825) U (3 <= p343))) OR (E (F ((p1289 <= p554))) AND (3 <= p956))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p1825 + 1 <= p1193) R (p343 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p1825 + 1 <= p1193) R (p343 <= 2)))
lola: processed formula: A (((p1825 + 1 <= p1193) R (p343 <= 2)))
lola: processed formula length: 40
lola: 10 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: 359551 markings, 448687 edges, 71910 markings/sec, 0 secs
lola: 720161 markings, 898202 edges, 72122 markings/sec, 5 secs
lola: 1052769 markings, 1313628 edges, 66522 markings/sec, 10 secs
lola: 1372199 markings, 1711796 edges, 63886 markings/sec, 15 secs
lola: 1684918 markings, 2102466 edges, 62544 markings/sec, 20 secs
lola: 2011259 markings, 2509120 edges, 65268 markings/sec, 25 secs
lola: 2332343 markings, 2909271 edges, 64217 markings/sec, 30 secs
lola: 2641186 markings, 3292669 edges, 61769 markings/sec, 35 secs
lola: 2927179 markings, 3647371 edges, 57199 markings/sec, 40 secs
lola: 3199329 markings, 3986416 edges, 54430 markings/sec, 45 secs
lola: 3468965 markings, 4322679 edges, 53927 markings/sec, 50 secs
lola: 3754604 markings, 4677909 edges, 57128 markings/sec, 55 secs
lola: 4033927 markings, 5025419 edges, 55865 markings/sec, 60 secs
lola: 4320964 markings, 5381335 edges, 57407 markings/sec, 65 secs
lola: 4601929 markings, 5731111 edges, 56193 markings/sec, 70 secs
lola: 4882235 markings, 6079947 edges, 56061 markings/sec, 75 secs
lola: 5164413 markings, 6431450 edges, 56436 markings/sec, 80 secs
lola: 5446361 markings, 6782652 edges, 56390 markings/sec, 85 secs
lola: 5715588 markings, 7118595 edges, 53845 markings/sec, 90 secs
lola: 6001342 markings, 7473977 edges, 57151 markings/sec, 95 secs
lola: 6286896 markings, 7830135 edges, 57111 markings/sec, 100 secs
lola: 6568348 markings, 8180643 edges, 56290 markings/sec, 105 secs
lola: 6834572 markings, 8512356 edges, 53245 markings/sec, 110 secs
lola: 7127469 markings, 8876094 edges, 58579 markings/sec, 115 secs
lola: 7423276 markings, 9243534 edges, 59161 markings/sec, 120 secs
lola: 7703677 markings, 9592739 edges, 56080 markings/sec, 125 secs
lola: 7981192 markings, 9939426 edges, 55503 markings/sec, 130 secs
lola: 8257623 markings, 10284985 edges, 55286 markings/sec, 135 secs
lola: 8521934 markings, 10615534 edges, 52862 markings/sec, 140 secs
lola: 8786417 markings, 10946511 edges, 52897 markings/sec, 145 secs
lola: 9046407 markings, 11271919 edges, 51998 markings/sec, 150 secs
lola: 9303658 markings, 11594364 edges, 51450 markings/sec, 155 secs
lola: 9573578 markings, 11932177 edges, 53984 markings/sec, 160 secs
lola: 9892844 markings, 12329652 edges, 63853 markings/sec, 165 secs
lola: 10222918 markings, 12740169 edges, 66015 markings/sec, 170 secs
lola: 10552159 markings, 13149876 edges, 65848 markings/sec, 175 secs
lola: 10886884 markings, 13566488 edges, 66945 markings/sec, 180 secs
lola: 11214103 markings, 13973703 edges, 65444 markings/sec, 185 secs
lola: 11548237 markings, 14389776 edges, 66827 markings/sec, 190 secs
lola: 11870464 markings, 14792204 edges, 64445 markings/sec, 195 secs
lola: 12198834 markings, 15200243 edges, 65674 markings/sec, 200 secs
lola: 12512475 markings, 15590819 edges, 62728 markings/sec, 205 secs
lola: 12823166 markings, 15976887 edges, 62138 markings/sec, 210 secs
lola: 13134805 markings, 16364768 edges, 62328 markings/sec, 215 secs
lola: 13448548 markings, 16755367 edges, 62749 markings/sec, 220 secs
lola: 13748306 markings, 17129426 edges, 59952 markings/sec, 225 secs
lola: 14075830 markings, 17538145 edges, 65505 markings/sec, 230 secs
lola: 14426062 markings, 17974559 edges, 70046 markings/sec, 235 secs
lola: 14729297 markings, 18350849 edges, 60647 markings/sec, 240 secs
lola: 15047084 markings, 18744472 edges, 63557 markings/sec, 245 secs
lola: 15328182 markings, 19091825 edges, 56220 markings/sec, 250 secs
lola: 15602917 markings, 19432798 edges, 54947 markings/sec, 255 secs
lola: 15869881 markings, 19764674 edges, 53393 markings/sec, 260 secs
lola: 16154885 markings, 20118906 edges, 57001 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: caught signal User defined signal 1 - aborting LoLA
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G ((p1774 <= p936))) OR ((3 <= p1174) OR ((p172 <= p768) AND (2 <= p704)) OR ((p1036 + 1 <= p2382) AND (p498 <= 0)))) AND E (((p327 <= p123) U ((p360 <= p862) OR (2 <= p2094)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((p1774 <= p936)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p936 + 1 <= p1774)))
lola: processed formula length: 34
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((p327 <= p123) U ((p360 <= p862) OR (2 <= p2094))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((p327 <= p123) U ((p360 <= p862) OR (2 <= p2094)))
lola: processed formula length: 53
lola: 1 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p776 <= p2287) AND E (G (A (F ((2 <= p1796))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p776 <= p2287)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p776 <= p2287)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((2 <= p1796)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (2 <= p1796)))))
lola: processed formula length: 42
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 63 markings, 64 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(NOT(E (G (((3 <= p2193) OR (p397 <= p1357))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p2193 <= 2) AND (p1357 + 1 <= p397))))
lola: processed formula length: 53
lola: 8 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 63 markings, 63 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (X (((p933 <= p2503) AND (p2067 <= p2098) AND (1 <= p2461)))) OR (E (F (((1 <= p1910) AND (2 <= p499)))) OR E (G ((2 <= p215)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (((p933 <= p2503) AND (p2067 <= p2098) AND (1 <= p2461))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(((p933 <= p2503) AND (p2067 <= p2098) AND (1 <= p2461)))
lola: processed formula length: 59
lola: 1 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 0 significant temporal operators and needs 0 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= p1910) AND (2 <= p499))))
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 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to CloudReconfiguration-PT-312-CTLCardinality-8.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality-8.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 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((2 <= p215)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (p215 <= 1)))
lola: processed formula length: 26
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((A (F ((p1932 <= p1554))) U A (F ((3 <= p1593)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(A(TRUE U (p1932 <= p1554)) U A(TRUE U (3 <= p1593)))
lola: processed formula length: 54
lola: 3 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 63 markings, 252 edges
lola: ========================================
lola: subprocess 9 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (((3 <= p563) U (p2254 <= p267)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A((3 <= p563) U (p2254 <= p267)))))
lola: processed formula length: 52
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 183489 markings, 496681 edges, 3689348869717491712 markings/sec, 0 secs
lola: 354033 markings, 962112 edges, 34109 markings/sec, 5 secs
lola: 524644 markings, 1416621 edges, 34122 markings/sec, 10 secs
lola: 712842 markings, 1892360 edges, 37640 markings/sec, 15 secs
lola: 898490 markings, 2370961 edges, 37130 markings/sec, 20 secs
lola: 1055853 markings, 2806175 edges, 31473 markings/sec, 25 secs
lola: 1236177 markings, 3267238 edges, 36065 markings/sec, 30 secs
lola: 1385096 markings, 3668111 edges, 29784 markings/sec, 35 secs
lola: 1561262 markings, 4112339 edges, 35233 markings/sec, 40 secs
lola: 1717421 markings, 4529742 edges, 31232 markings/sec, 45 secs
lola: 1867384 markings, 4933299 edges, 29993 markings/sec, 50 secs
lola: 2019938 markings, 5327645 edges, 30511 markings/sec, 55 secs
lola: 2157649 markings, 5714602 edges, 27542 markings/sec, 60 secs
lola: 2323646 markings, 6149748 edges, 33199 markings/sec, 65 secs
lola: 2480211 markings, 6570538 edges, 31313 markings/sec, 70 secs
lola: 2637154 markings, 7002108 edges, 31389 markings/sec, 75 secs
lola: 2811419 markings, 7434619 edges, 34853 markings/sec, 80 secs
lola: 2966013 markings, 7853628 edges, 30919 markings/sec, 85 secs
lola: 3163242 markings, 8367785 edges, 39446 markings/sec, 90 secs
lola: 3365615 markings, 8887385 edges, 40475 markings/sec, 95 secs
lola: 3567422 markings, 9401166 edges, 40361 markings/sec, 100 secs
lola: 3750751 markings, 9892851 edges, 36666 markings/sec, 105 secs
lola: 3942045 markings, 10380705 edges, 38259 markings/sec, 110 secs
lola: 4123710 markings, 10852208 edges, 36333 markings/sec, 115 secs
lola: 4301879 markings, 11318183 edges, 35634 markings/sec, 120 secs
lola: 4484645 markings, 11779756 edges, 36553 markings/sec, 125 secs
lola: 4649265 markings, 12219753 edges, 32924 markings/sec, 130 secs
lola: 4770569 markings, 12590900 edges, 24261 markings/sec, 135 secs
lola: 4915242 markings, 12978787 edges, 28935 markings/sec, 140 secs
lola: 5060539 markings, 13370629 edges, 29059 markings/sec, 145 secs
lola: 5190121 markings, 13726905 edges, 25916 markings/sec, 150 secs
lola: 5323416 markings, 14085753 edges, 26659 markings/sec, 155 secs
lola: 5452192 markings, 14432820 edges, 25755 markings/sec, 160 secs
lola: 5570054 markings, 14754825 edges, 23572 markings/sec, 165 secs
lola: 5682407 markings, 15063875 edges, 22471 markings/sec, 170 secs
lola: 5787925 markings, 15418255 edges, 21104 markings/sec, 175 secs
lola: 5871633 markings, 15731157 edges, 16742 markings/sec, 180 secs
lola: 5985456 markings, 16102454 edges, 22765 markings/sec, 185 secs
lola: 6083080 markings, 16453253 edges, 19525 markings/sec, 190 secs
lola: 6189451 markings, 16822712 edges, 21274 markings/sec, 195 secs
lola: 6300170 markings, 17200083 edges, 22144 markings/sec, 200 secs
lola: 6404447 markings, 17572871 edges, 20855 markings/sec, 205 secs
lola: 6484783 markings, 17886737 edges, 16067 markings/sec, 210 secs
lola: 6574293 markings, 18213733 edges, 17902 markings/sec, 215 secs
lola: 6668805 markings, 18540154 edges, 18902 markings/sec, 220 secs
lola: 6760216 markings, 18894096 edges, 18282 markings/sec, 225 secs
lola: 6876241 markings, 19286535 edges, 23205 markings/sec, 230 secs
lola: 6994646 markings, 19701841 edges, 23681 markings/sec, 235 secs
lola: 7118375 markings, 20086557 edges, 24746 markings/sec, 240 secs
lola: 7232844 markings, 20478430 edges, 22894 markings/sec, 245 secs
lola: 7341557 markings, 20839118 edges, 21743 markings/sec, 250 secs
lola: 7451137 markings, 21181887 edges, 21916 markings/sec, 255 secs
lola: 7549025 markings, 21522255 edges, 19578 markings/sec, 260 secs
lola: 7704387 markings, 21946071 edges, 31072 markings/sec, 265 secs
lola: 7878515 markings, 22443580 edges, 34826 markings/sec, 270 secs
lola: 8012275 markings, 22865355 edges, 26752 markings/sec, 275 secs
lola: 8174520 markings, 23309262 edges, 32449 markings/sec, 280 secs
lola: 8314426 markings, 23710924 edges, 27981 markings/sec, 285 secs
lola: 8419339 markings, 24042499 edges, 20983 markings/sec, 290 secs
lola: 8537821 markings, 24422115 edges, 23696 markings/sec, 295 secs
lola: 8643946 markings, 24784441 edges, 21225 markings/sec, 300 secs
lola: 8758137 markings, 25159726 edges, 22838 markings/sec, 305 secs
lola: 8872470 markings, 25546465 edges, 22867 markings/sec, 310 secs
lola: 8982326 markings, 25925652 edges, 21971 markings/sec, 315 secs
lola: 9095778 markings, 26295551 edges, 22690 markings/sec, 320 secs
lola: 9164999 markings, 26553078 edges, 13844 markings/sec, 325 secs
lola: 9252784 markings, 26885627 edges, 17557 markings/sec, 330 secs
lola: 9365750 markings, 27227546 edges, 22593 markings/sec, 335 secs
lola: 9472048 markings, 27559332 edges, 21260 markings/sec, 340 secs
lola: 9607848 markings, 27972107 edges, 27160 markings/sec, 345 secs
lola: 9729144 markings, 28368475 edges, 24259 markings/sec, 350 secs
lola: 9852061 markings, 28752243 edges, 24583 markings/sec, 355 secs
lola: 9966188 markings, 29153078 edges, 22825 markings/sec, 360 secs
lola: 10103951 markings, 29561738 edges, 27553 markings/sec, 365 secs
lola: 10210144 markings, 29942731 edges, 21239 markings/sec, 370 secs
lola: 10358660 markings, 30379338 edges, 29703 markings/sec, 375 secs
lola: 10508203 markings, 30819489 edges, 29909 markings/sec, 380 secs
lola: 10636806 markings, 31244419 edges, 25721 markings/sec, 385 secs
lola: 10780769 markings, 31674204 edges, 28793 markings/sec, 390 secs
lola: 10938623 markings, 32132423 edges, 31571 markings/sec, 395 secs
lola: 11076179 markings, 32580560 edges, 27511 markings/sec, 400 secs
lola: 11169481 markings, 32935904 edges, 18660 markings/sec, 405 secs
lola: 11297881 markings, 33340737 edges, 25680 markings/sec, 410 secs
lola: 11411339 markings, 33744214 edges, 22692 markings/sec, 415 secs
lola: 11521352 markings, 34175399 edges, 22003 markings/sec, 420 secs
lola: 11614653 markings, 34531691 edges, 18660 markings/sec, 425 secs
lola: 11690714 markings, 34814109 edges, 15212 markings/sec, 430 secs
lola: 11775124 markings, 35114955 edges, 16882 markings/sec, 435 secs
lola: 11843002 markings, 35373749 edges, 13576 markings/sec, 440 secs
lola: 11934187 markings, 35706678 edges, 18237 markings/sec, 445 secs
lola: 12019618 markings, 36041909 edges, 17086 markings/sec, 450 secs
lola: 12098672 markings, 36362599 edges, 15811 markings/sec, 455 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 465 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((p374 <= 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 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-312-CTLCardinality-10.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================
lola: subprocess 11 will run for 557 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((p1820 <= 2) OR (p406 + 1 <= p1689)) U ((1 <= p2567) AND (3 <= p302) AND ((3 <= p654) OR (p2110 <= p2244)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((((p1820 <= 2) OR (p406 + 1 <= p1689)) U ((1 <= p2567) AND (3 <= p302) AND ((3 <= p654) OR (p2110 <= p2244)))))
lola: processed formula: A ((((p1820 <= 2) OR (p406 + 1 <= p1689)) U ((1 <= p2567) AND (3 <= p302) AND ((3 <= p654) OR (p2110 <= p2244)))))
lola: processed formula length: 116
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 70 markings, 70 edges
lola: ========================================
lola: subprocess 12 will run for 696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((p1894 + 1 <= p1627) OR (p1265 <= 1)))) AND A (G (((1 <= p483) OR (p2450 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 696 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((p1894 + 1 <= p1627) OR (p1265 <= 1))))
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 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to CloudReconfiguration-PT-312-CTLCardinality-12.sara
lola: ========================================
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= p483) OR (p2450 <= 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 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-312-CTLCardinality-13.sara
lola: state equation: calling and running sara
sara: try reading problem file CloudReconfiguration-PT-312-CTLCardinality-13.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 60 markings, 59 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (A (F ((p1118 <= p1098))))) AND A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 929 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F ((p1118 <= p1098)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U (p1118 <= p1098)))))
lola: processed formula length: 46
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 63 markings, 126 edges
lola: ========================================
lola: subprocess 14 will run for 1393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381))))
lola: processed formula: A (((p1997 <= p371) U ((2 <= p2035) AND (p660 <= p1381))))
lola: processed formula length: 58
lola: 0 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 324 bytes per marking, with 9 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 77 markings, 77 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p2188 <= p2439) OR (2 <= p2580) OR (1 <= p2510))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p2439 + 1 <= p2188) AND (p2580 <= 1) AND (p2510 <= 0))))
lola: processed formula length: 71
lola: 2 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 64 markings, 64 edges
lola: ========================================
lola: subprocess 15 will run for 2787 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (G (((p539 <= p1661) OR (3 <= p2462))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U E(TRUE U ((p1661 + 1 <= p539) AND (p2462 <= 2)))))
lola: processed formula length: 63
lola: 4 rewrites
lola: formula mentions 0 of 2585 places; total mentions: 0
lola: closed formula file CloudReconfiguration-PT-312-CTLCardinality.task
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: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 4749 markings, 6125 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no unknown yes no yes no no unknown yes no no no yes no
FORMULA CloudReconfiguration-PT-312-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
FORMULA CloudReconfiguration-PT-312-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA CloudReconfiguration-PT-312-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----
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-312"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
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-312.tgz
mv CloudReconfiguration-PT-312 execution
cd execution
pwd
ls -lh
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is CloudReconfiguration-PT-312, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r058-smll-152646385500080"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;