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 irma4mcc-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 r055-smll-152646382700080
=====================================================================

--------------------
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 1526477437306


BK_STOP 1526478236451

--------------------
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...

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 stdout -----
----- Start make result stderr -----
CTLCardinality @ CloudReconfiguration-PT-312 @ 3540 seconds
----- Start make result stdout -----
----- Start make result stderr -----
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 || 72123 markings, 126873 edges, 14425 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: 358079 markings, 446863 edges, 71616 markings/sec, 0 secs
lola: 698583 markings, 871089 edges, 68101 markings/sec, 5 secs
lola: 1028816 markings, 1283599 edges, 66047 markings/sec, 10 secs
lola: 1325143 markings, 1653306 edges, 59265 markings/sec, 15 secs
lola: 1636659 markings, 2041922 edges, 62303 markings/sec, 20 secs
lola: 1925392 markings, 2402489 edges, 57747 markings/sec, 25 secs
lola: 2244741 markings, 2799716 edges, 63870 markings/sec, 30 secs
lola: 2559591 markings, 3191420 edges, 62970 markings/sec, 35 secs
lola: 2833538 markings, 3531037 edges, 54789 markings/sec, 40 secs
lola: 3096597 markings, 3858295 edges, 52612 markings/sec, 45 secs
lola: 3342245 markings, 4164529 edges, 49130 markings/sec, 50 secs
lola: 3612744 markings, 4501248 edges, 54100 markings/sec, 55 secs
lola: 3895486 markings, 4853239 edges, 56548 markings/sec, 60 secs
lola: 4175593 markings, 5201577 edges, 56021 markings/sec, 65 secs
lola: 4451422 markings, 5544043 edges, 55166 markings/sec, 70 secs
lola: 4730519 markings, 5891318 edges, 55819 markings/sec, 75 secs
lola: 4996169 markings, 6221579 edges, 53130 markings/sec, 80 secs
lola: 5274911 markings, 6568741 edges, 55748 markings/sec, 85 secs
lola: 5547132 markings, 6908168 edges, 54444 markings/sec, 90 secs
lola: 5822750 markings, 7251680 edges, 55124 markings/sec, 95 secs
lola: 6111368 markings, 7611450 edges, 57724 markings/sec, 100 secs
lola: 6387895 markings, 7955651 edges, 55305 markings/sec, 105 secs
lola: 6669270 markings, 8306418 edges, 56275 markings/sec, 110 secs
lola: 6934234 markings, 8636176 edges, 52993 markings/sec, 115 secs
lola: 7226876 markings, 8999576 edges, 58528 markings/sec, 120 secs
lola: 7520783 markings, 9364782 edges, 58781 markings/sec, 125 secs
lola: 7794127 markings, 9705579 edges, 54669 markings/sec, 130 secs
lola: 8068823 markings, 10049136 edges, 54939 markings/sec, 135 secs
lola: 8337790 markings, 10385201 edges, 53793 markings/sec, 140 secs
lola: 8594699 markings, 10706723 edges, 51382 markings/sec, 145 secs
lola: 8853889 markings, 11030657 edges, 51838 markings/sec, 150 secs
lola: 9097482 markings, 11335916 edges, 48719 markings/sec, 155 secs
lola: 9344252 markings, 11645208 edges, 49354 markings/sec, 160 secs
lola: 9610997 markings, 11978928 edges, 53349 markings/sec, 165 secs
lola: 9919257 markings, 12362495 edges, 61652 markings/sec, 170 secs
lola: 10238052 markings, 12759028 edges, 63759 markings/sec, 175 secs
lola: 10557373 markings, 13156367 edges, 63864 markings/sec, 180 secs
lola: 10874383 markings, 13550889 edges, 63402 markings/sec, 185 secs
lola: 11187031 markings, 13939987 edges, 62530 markings/sec, 190 secs
lola: 11513759 markings, 14346716 edges, 65346 markings/sec, 195 secs
lola: 11803393 markings, 14708363 edges, 57927 markings/sec, 200 secs
lola: 12127846 markings, 15111901 edges, 64891 markings/sec, 205 secs
lola: 12439621 markings, 15500107 edges, 62355 markings/sec, 210 secs
lola: 12746000 markings, 15880707 edges, 61276 markings/sec, 215 secs
lola: 13048755 markings, 16257656 edges, 60551 markings/sec, 220 secs
lola: 13357957 markings, 16642560 edges, 61840 markings/sec, 225 secs
lola: 13654792 markings, 17012480 edges, 59367 markings/sec, 230 secs
lola: 13943774 markings, 17373495 edges, 57796 markings/sec, 235 secs
lola: 14305133 markings, 17823783 edges, 72272 markings/sec, 240 secs
lola: 14586035 markings, 18172908 edges, 56180 markings/sec, 245 secs
lola: 14909160 markings, 18573807 edges, 64625 markings/sec, 250 secs
lola: 15191970 markings, 18923671 edges, 56562 markings/sec, 255 secs
lola: 15466250 markings, 19262856 edges, 54856 markings/sec, 260 secs
lola: 15727245 markings, 19587345 edges, 52199 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 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: 169773 markings, 460158 edges, 3689348869717491712 markings/sec, 0 secs
lola: 339272 markings, 922675 edges, 33900 markings/sec, 5 secs
lola: 507235 markings, 1373772 edges, 33593 markings/sec, 10 secs
lola: 690796 markings, 1838031 edges, 36712 markings/sec, 15 secs
lola: 876092 markings, 2313453 edges, 37059 markings/sec, 20 secs
lola: 1036668 markings, 2747960 edges, 32115 markings/sec, 25 secs
lola: 1210037 markings, 3199461 edges, 34674 markings/sec, 30 secs
lola: 1356237 markings, 3592563 edges, 29240 markings/sec, 35 secs
lola: 1531899 markings, 4037963 edges, 35132 markings/sec, 40 secs
lola: 1689718 markings, 4447830 edges, 31564 markings/sec, 45 secs
lola: 1832791 markings, 4845269 edges, 28615 markings/sec, 50 secs
lola: 1987398 markings, 5242359 edges, 30921 markings/sec, 55 secs
lola: 2122674 markings, 5612365 edges, 27055 markings/sec, 60 secs
lola: 2268416 markings, 6011474 edges, 29148 markings/sec, 65 secs
lola: 2438681 markings, 6439279 edges, 34053 markings/sec, 70 secs
lola: 2580444 markings, 6859515 edges, 28353 markings/sec, 75 secs
lola: 2760255 markings, 7308156 edges, 35962 markings/sec, 80 secs
lola: 2908511 markings, 7700036 edges, 29651 markings/sec, 85 secs
lola: 3091982 markings, 8184213 edges, 36694 markings/sec, 90 secs
lola: 3291785 markings, 8696145 edges, 39961 markings/sec, 95 secs
lola: 3491772 markings, 9206247 edges, 39997 markings/sec, 100 secs
lola: 3677999 markings, 9699896 edges, 37245 markings/sec, 105 secs
lola: 3863609 markings, 10181722 edges, 37122 markings/sec, 110 secs
lola: 4042945 markings, 10641510 edges, 35867 markings/sec, 115 secs
lola: 4217743 markings, 11101511 edges, 34960 markings/sec, 120 secs
lola: 4398874 markings, 11560691 edges, 36226 markings/sec, 125 secs
lola: 4567492 markings, 11994219 edges, 33724 markings/sec, 130 secs
lola: 4710391 markings, 12393093 edges, 28580 markings/sec, 135 secs
lola: 4824957 markings, 12740430 edges, 22913 markings/sec, 140 secs
lola: 4978979 markings, 13134776 edges, 30804 markings/sec, 145 secs
lola: 5093203 markings, 13470935 edges, 22845 markings/sec, 150 secs
lola: 5222685 markings, 13814015 edges, 25896 markings/sec, 155 secs
lola: 5350080 markings, 14162452 edges, 25479 markings/sec, 160 secs
lola: 5472845 markings, 14485311 edges, 24553 markings/sec, 165 secs
lola: 5580159 markings, 14781422 edges, 21463 markings/sec, 170 secs
lola: 5684663 markings, 15071235 edges, 20901 markings/sec, 175 secs
lola: 5786473 markings, 15412092 edges, 20362 markings/sec, 180 secs
lola: 5862784 markings, 15699461 edges, 15262 markings/sec, 185 secs
lola: 5977560 markings, 16071016 edges, 22955 markings/sec, 190 secs
lola: 6063429 markings, 16389370 edges, 17174 markings/sec, 195 secs
lola: 6168676 markings, 16746702 edges, 21049 markings/sec, 200 secs
lola: 6275448 markings, 17119354 edges, 21354 markings/sec, 205 secs
lola: 6385042 markings, 17499363 edges, 21919 markings/sec, 210 secs
lola: 6467013 markings, 17817076 edges, 16394 markings/sec, 215 secs
lola: 6550601 markings, 18125391 edges, 16718 markings/sec, 220 secs
lola: 6636613 markings, 18434194 edges, 17202 markings/sec, 225 secs
lola: 6727630 markings, 18771211 edges, 18203 markings/sec, 230 secs
lola: 6839093 markings, 19148935 edges, 22293 markings/sec, 235 secs
lola: 6956159 markings, 19561744 edges, 23413 markings/sec, 240 secs
lola: 7075708 markings, 19945028 edges, 23910 markings/sec, 245 secs
lola: 7194397 markings, 20338124 edges, 23738 markings/sec, 250 secs
lola: 7303601 markings, 20706791 edges, 21841 markings/sec, 255 secs
lola: 7400618 markings, 21012734 edges, 19403 markings/sec, 260 secs
lola: 7501135 markings, 21348230 edges, 20103 markings/sec, 265 secs
lola: 7592445 markings, 21646371 edges, 18262 markings/sec, 270 secs
lola: 7774337 markings, 22146973 edges, 36378 markings/sec, 275 secs
lola: 7925557 markings, 22602074 edges, 30244 markings/sec, 280 secs
lola: 8075832 markings, 23042671 edges, 30055 markings/sec, 285 secs
lola: 8222964 markings, 23456592 edges, 29426 markings/sec, 290 secs
lola: 8345982 markings, 23818428 edges, 24604 markings/sec, 295 secs
lola: 8464086 markings, 24171561 edges, 23621 markings/sec, 300 secs
lola: 8566179 markings, 24519338 edges, 20419 markings/sec, 305 secs
lola: 8672256 markings, 24875525 edges, 21215 markings/sec, 310 secs
lola: 8787967 markings, 25250065 edges, 23142 markings/sec, 315 secs
lola: 8898975 markings, 25633503 edges, 22202 markings/sec, 320 secs
lola: 9008192 markings, 26011075 edges, 21843 markings/sec, 325 secs
lola: 9109706 markings, 26347677 edges, 20303 markings/sec, 330 secs
lola: 9178176 markings, 26600561 edges, 13694 markings/sec, 335 secs
lola: 9273822 markings, 26944289 edges, 19129 markings/sec, 340 secs
lola: 9376709 markings, 27267775 edges, 20577 markings/sec, 345 secs
lola: 9487756 markings, 27601558 edges, 22209 markings/sec, 350 secs
lola: 9620476 markings, 28010762 edges, 26544 markings/sec, 355 secs
lola: 9741962 markings, 28406251 edges, 24297 markings/sec, 360 secs
lola: 9861222 markings, 28788669 edges, 23852 markings/sec, 365 secs
lola: 9977025 markings, 29188107 edges, 23161 markings/sec, 370 secs
lola: 10110955 markings, 29586396 edges, 26786 markings/sec, 375 secs
lola: 10215200 markings, 29960404 edges, 20849 markings/sec, 380 secs
lola: 10364329 markings, 30393674 edges, 29826 markings/sec, 385 secs
lola: 10510794 markings, 30827330 edges, 29293 markings/sec, 390 secs
lola: 10637344 markings, 31246691 edges, 25310 markings/sec, 395 secs
lola: 10779843 markings, 31670740 edges, 28500 markings/sec, 400 secs
lola: 10935477 markings, 32123132 edges, 31127 markings/sec, 405 secs
lola: 11071618 markings, 32565849 edges, 27228 markings/sec, 410 secs
lola: 11164415 markings, 32918221 edges, 18559 markings/sec, 415 secs
lola: 11290561 markings, 33317358 edges, 25229 markings/sec, 420 secs
lola: 11403459 markings, 33701398 edges, 22580 markings/sec, 425 secs
lola: 11506135 markings, 34130873 edges, 20535 markings/sec, 430 secs
lola: 11603679 markings, 34495247 edges, 19509 markings/sec, 435 secs
lola: 11680041 markings, 34772444 edges, 15272 markings/sec, 440 secs
lola: 11763750 markings, 35072309 edges, 16742 markings/sec, 445 secs
lola: 11826508 markings, 35314486 edges, 12552 markings/sec, 450 secs
lola: 11914163 markings, 35631707 edges, 17531 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: 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
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="irma4mcc-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 irma4mcc-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 r055-smll-152646382700080"
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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;