About the Execution of M4M.struct for CloudReconfiguration-PT-312
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 3661.000 | 798968.00 | 785014.00 | 2601.70 | 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-structural
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 r059-smll-152646386100080
=====================================================================
--------------------
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 1526541445844
BK_STOP 1526542244812
--------------------
content from stderr:
Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-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...
----- Start make prepare stderr -----
Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
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 stdout -----
----- Start make result stderr -----
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 || 70529 markings, 124949 edges, 14106 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: 357111 markings, 445657 edges, 71422 markings/sec, 0 secs
lola: 716534 markings, 893679 edges, 71885 markings/sec, 5 secs
lola: 1046863 markings, 1306189 edges, 66066 markings/sec, 10 secs
lola: 1359901 markings, 1696507 edges, 62608 markings/sec, 15 secs
lola: 1671201 markings, 2085268 edges, 62260 markings/sec, 20 secs
lola: 1993954 markings, 2487799 edges, 64551 markings/sec, 25 secs
lola: 2311678 markings, 2883452 edges, 63545 markings/sec, 30 secs
lola: 2623680 markings, 3270918 edges, 62400 markings/sec, 35 secs
lola: 2906396 markings, 3621659 edges, 56543 markings/sec, 40 secs
lola: 3177846 markings, 3959513 edges, 54290 markings/sec, 45 secs
lola: 3445385 markings, 4293252 edges, 53508 markings/sec, 50 secs
lola: 3736641 markings, 4655524 edges, 58251 markings/sec, 55 secs
lola: 4019146 markings, 5007038 edges, 56501 markings/sec, 60 secs
lola: 4312570 markings, 5370880 edges, 58685 markings/sec, 65 secs
lola: 4596421 markings, 5724237 edges, 56770 markings/sec, 70 secs
lola: 4882219 markings, 6079928 edges, 57160 markings/sec, 75 secs
lola: 5168201 markings, 6436168 edges, 57196 markings/sec, 80 secs
lola: 5453551 markings, 6791684 edges, 57070 markings/sec, 85 secs
lola: 5725213 markings, 7130691 edges, 54332 markings/sec, 90 secs
lola: 6013987 markings, 7489808 edges, 57755 markings/sec, 95 secs
lola: 6298529 markings, 7844595 edges, 56908 markings/sec, 100 secs
lola: 6582343 markings, 8198077 edges, 56763 markings/sec, 105 secs
lola: 6849137 markings, 8530451 edges, 53359 markings/sec, 110 secs
lola: 7147280 markings, 8900706 edges, 59629 markings/sec, 115 secs
lola: 7447810 markings, 9274033 edges, 60106 markings/sec, 120 secs
lola: 7729539 markings, 9625011 edges, 56346 markings/sec, 125 secs
lola: 8009204 markings, 9974323 edges, 55933 markings/sec, 130 secs
lola: 8281095 markings, 10314260 edges, 54378 markings/sec, 135 secs
lola: 8540946 markings, 10639398 edges, 51970 markings/sec, 140 secs
lola: 8800546 markings, 10964223 edges, 51920 markings/sec, 145 secs
lola: 9054669 markings, 11282286 edges, 50825 markings/sec, 150 secs
lola: 9308959 markings, 11601020 edges, 50858 markings/sec, 155 secs
lola: 9574899 markings, 11933832 edges, 53188 markings/sec, 160 secs
lola: 9880348 markings, 12314073 edges, 61090 markings/sec, 165 secs
lola: 10207932 markings, 12721501 edges, 65517 markings/sec, 170 secs
lola: 10532586 markings, 13125553 edges, 64931 markings/sec, 175 secs
lola: 10864936 markings, 13539103 edges, 66470 markings/sec, 180 secs
lola: 11183099 markings, 13935081 edges, 63633 markings/sec, 185 secs
lola: 11506781 markings, 14337983 edges, 64736 markings/sec, 190 secs
lola: 11815699 markings, 14723752 edges, 61784 markings/sec, 195 secs
lola: 12140289 markings, 15127382 edges, 64918 markings/sec, 200 secs
lola: 12453248 markings, 15517080 edges, 62592 markings/sec, 205 secs
lola: 12764680 markings, 15904025 edges, 62286 markings/sec, 210 secs
lola: 13072968 markings, 16287815 edges, 61658 markings/sec, 215 secs
lola: 13385805 markings, 16677226 edges, 62567 markings/sec, 220 secs
lola: 13689664 markings, 17056085 edges, 60772 markings/sec, 225 secs
lola: 13988709 markings, 17429453 edges, 59809 markings/sec, 230 secs
lola: 14348878 markings, 17878293 edges, 72034 markings/sec, 235 secs
lola: 14645708 markings, 18247296 edges, 59366 markings/sec, 240 secs
lola: 14974152 markings, 18653993 edges, 65689 markings/sec, 245 secs
lola: 15255803 markings, 19002786 edges, 56330 markings/sec, 250 secs
lola: 15531992 markings, 19344642 edges, 55238 markings/sec, 255 secs
lola: 15793813 markings, 19669971 edges, 52364 markings/sec, 260 secs
lola: 16063258 markings, 20004892 edges, 53889 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 325 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 325 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 406 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: 180765 markings, 489584 edges, 3689348869717491712 markings/sec, 0 secs
lola: 347805 markings, 946056 edges, 33408 markings/sec, 5 secs
lola: 514989 markings, 1392934 edges, 33437 markings/sec, 10 secs
lola: 697367 markings, 1853867 edges, 36476 markings/sec, 15 secs
lola: 882526 markings, 2329749 edges, 37032 markings/sec, 20 secs
lola: 1040162 markings, 2761306 edges, 31527 markings/sec, 25 secs
lola: 1218327 markings, 3219093 edges, 35633 markings/sec, 30 secs
lola: 1362841 markings, 3609260 edges, 28903 markings/sec, 35 secs
lola: 1538995 markings, 4055428 edges, 35231 markings/sec, 40 secs
lola: 1694665 markings, 4462404 edges, 31134 markings/sec, 45 secs
lola: 1838570 markings, 4859719 edges, 28781 markings/sec, 50 secs
lola: 1992394 markings, 5254761 edges, 30765 markings/sec, 55 secs
lola: 2128673 markings, 5628346 edges, 27256 markings/sec, 60 secs
lola: 2273776 markings, 6026708 edges, 29021 markings/sec, 65 secs
lola: 2441368 markings, 6446531 edges, 33518 markings/sec, 70 secs
lola: 2582361 markings, 6864266 edges, 28199 markings/sec, 75 secs
lola: 2759762 markings, 7307006 edges, 35480 markings/sec, 80 secs
lola: 2907640 markings, 7697419 edges, 29576 markings/sec, 85 secs
lola: 3089899 markings, 8178359 edges, 36452 markings/sec, 90 secs
lola: 3290669 markings, 8693364 edges, 40154 markings/sec, 95 secs
lola: 3489960 markings, 9200791 edges, 39858 markings/sec, 100 secs
lola: 3676899 markings, 9697041 edges, 37388 markings/sec, 105 secs
lola: 3863632 markings, 10181778 edges, 37347 markings/sec, 110 secs
lola: 4046975 markings, 10652206 edges, 36669 markings/sec, 115 secs
lola: 4221945 markings, 11111317 edges, 34994 markings/sec, 120 secs
lola: 4404917 markings, 11577358 edges, 36594 markings/sec, 125 secs
lola: 4575511 markings, 12018101 edges, 34119 markings/sec, 130 secs
lola: 4722980 markings, 12425668 edges, 29494 markings/sec, 135 secs
lola: 4840725 markings, 12782492 edges, 23549 markings/sec, 140 secs
lola: 4996525 markings, 13182273 edges, 31160 markings/sec, 145 secs
lola: 5119483 markings, 13549715 edges, 24592 markings/sec, 150 secs
lola: 5257593 markings, 13905350 edges, 27622 markings/sec, 155 secs
lola: 5386035 markings, 14257781 edges, 25688 markings/sec, 160 secs
lola: 5498149 markings, 14567725 edges, 22423 markings/sec, 165 secs
lola: 5614389 markings, 14880181 edges, 23248 markings/sec, 170 secs
lola: 5728433 markings, 15217012 edges, 22809 markings/sec, 175 secs
lola: 5815669 markings, 15528078 edges, 17447 markings/sec, 180 secs
lola: 5912771 markings, 15868955 edges, 19420 markings/sec, 185 secs
lola: 6013152 markings, 16206792 edges, 20076 markings/sec, 190 secs
lola: 6122691 markings, 16580440 edges, 21908 markings/sec, 195 secs
lola: 6219752 markings, 16933554 edges, 19412 markings/sec, 200 secs
lola: 6335144 markings, 17321237 edges, 23078 markings/sec, 205 secs
lola: 6429347 markings, 17678464 edges, 18841 markings/sec, 210 secs
lola: 6505888 markings, 17966654 edges, 15308 markings/sec, 215 secs
lola: 6595703 markings, 18290788 edges, 17963 markings/sec, 220 secs
lola: 6688994 markings, 18620532 edges, 18658 markings/sec, 225 secs
lola: 6781377 markings, 18962620 edges, 18477 markings/sec, 230 secs
lola: 6906729 markings, 19390847 edges, 25070 markings/sec, 235 secs
lola: 7021309 markings, 19779974 edges, 22916 markings/sec, 240 secs
lola: 7147042 markings, 20172695 edges, 25147 markings/sec, 245 secs
lola: 7258943 markings, 20557209 edges, 22380 markings/sec, 250 secs
lola: 7361959 markings, 20897848 edges, 20603 markings/sec, 255 secs
lola: 7465416 markings, 21225653 edges, 20691 markings/sec, 260 secs
lola: 7556672 markings, 21542210 edges, 18251 markings/sec, 265 secs
lola: 7708988 markings, 21958909 edges, 30463 markings/sec, 270 secs
lola: 7877974 markings, 22441656 edges, 33797 markings/sec, 275 secs
lola: 7999259 markings, 22831354 edges, 24257 markings/sec, 280 secs
lola: 8155113 markings, 23256574 edges, 31171 markings/sec, 285 secs
lola: 8295984 markings, 23654665 edges, 28174 markings/sec, 290 secs
lola: 8401747 markings, 23993017 edges, 21153 markings/sec, 295 secs
lola: 8508713 markings, 24321438 edges, 21393 markings/sec, 300 secs
lola: 8610961 markings, 24674023 edges, 20450 markings/sec, 305 secs
lola: 8720582 markings, 25038659 edges, 21924 markings/sec, 310 secs
lola: 8834854 markings, 25416425 edges, 22854 markings/sec, 315 secs
lola: 8945175 markings, 25796694 edges, 22064 markings/sec, 320 secs
lola: 9060376 markings, 26177732 edges, 23040 markings/sec, 325 secs
lola: 9135114 markings, 26444170 edges, 14948 markings/sec, 330 secs
lola: 9209449 markings, 26713538 edges, 14867 markings/sec, 335 secs
lola: 9303487 markings, 27036403 edges, 18808 markings/sec, 340 secs
lola: 9404414 markings, 27356561 edges, 20185 markings/sec, 345 secs
lola: 9521101 markings, 27700657 edges, 23337 markings/sec, 350 secs
lola: 9646237 markings, 28094150 edges, 25027 markings/sec, 355 secs
lola: 9762188 markings, 28460026 edges, 23190 markings/sec, 360 secs
lola: 9866534 markings, 28810318 edges, 20869 markings/sec, 365 secs
lola: 9975942 markings, 29183661 edges, 21882 markings/sec, 370 secs
lola: 10102225 markings, 29556459 edges, 25257 markings/sec, 375 secs
lola: 10196434 markings, 29887855 edges, 18842 markings/sec, 380 secs
lola: 10327074 markings, 30289242 edges, 26128 markings/sec, 385 secs
lola: 10475679 markings, 30723766 edges, 29721 markings/sec, 390 secs
lola: 10602797 markings, 31124431 edges, 25424 markings/sec, 395 secs
lola: 10727535 markings, 31519724 edges, 24948 markings/sec, 400 secs
lola: 10880716 markings, 31963422 edges, 30636 markings/sec, 405 secs
lola: 11021899 markings, 32396404 edges, 28237 markings/sec, 410 secs
lola: 11129039 markings, 32775622 edges, 21428 markings/sec, 415 secs
lola: 11235624 markings, 33130178 edges, 21317 markings/sec, 420 secs
lola: 11353924 markings, 33505350 edges, 23660 markings/sec, 425 secs
lola: 11450026 markings, 33939846 edges, 19220 markings/sec, 430 secs
lola: 11559018 markings, 34325287 edges, 21798 markings/sec, 435 secs
lola: 11647030 markings, 34644324 edges, 17602 markings/sec, 440 secs
lola: 11721122 markings, 34921846 edges, 14818 markings/sec, 445 secs
lola: 11794801 markings, 35189016 edges, 14736 markings/sec, 450 secs
lola: 11861136 markings, 35449995 edges, 13267 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: state equation: write sara problem file to CloudReconfiguration-PT-312-CTLCardinality-12.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 13 will run for 928 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 928 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 928 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 2786 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
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 -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- 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-312"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-structural"
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-structural"
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 r059-smll-152646386100080"
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 ;