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 188K
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K 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 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.8K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
Input is TCPcondis-PT-30, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-smll-152708748300213
=====================================================================

--------------------
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 TCPcondis-PT-30-CTLCardinality-00
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-01
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-02
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-03
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-04
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-05
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-06
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-07
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-08
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-09
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-10
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-11
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-12
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-13
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-14
FORMULA_NAME TCPcondis-PT-30-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1527172648111


BK_STOP 1527173538166

--------------------
content from stderr:

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using TCPcondis-PT-30 as instance name.
Using TCPcondis 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': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 515801, 'Memory': 5088.37, 'Tool': 'lola'}, {'Time': 515937, 'Memory': 5079.53, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TCPcondis-PT-30...

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


checking for too many tokens
===========================================================================================
TCPcondis-PT-30: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stderr -----
----- Start make result stdout -----
CTLCardinality @ TCPcondis-PT-30 @ 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: 62/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 30 places, 32 transitions, 21 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 48 transition conflict sets
lola: TASK
lola: reading formula from TCPcondis-PT-30-CTLCardinality.task
lola: A (G (A ((TRUE U (2 <= xLISTEN))))) : E ((A (F (TRUE)) U (3 <= xLASTACK))) : (NOT(E (G (((FINWAIT2 <= FINWAIT1) OR (2 <= xFINWAIT1))))) OR A (G ((xFINWAIT1 <= 1)))) : E (F (((SYNSENT <= 0) AND (TIMEWAIT + 1 <= FINACK) AND ((xLISTEN + 1 <= xSYNRCVD) OR (xSYNSENT + 1 <= FINWAIT1))))) : A (F ((1 <= xSYNACK))) : A (G (())) : E (G (A (F (((2 <= xSYNACK) OR (2 <= SYNSENT)))))) : E (((SYNSENT <= xSYN) U A (G ((2 <= SYNRCVD))))) : (E (F (((1 <= CLOSEWAIT) OR (LISTEN <= 1)))) AND (E (G ((xTIMEWAIT <= FINACK))) OR ((1 <= xSYNACK) OR A (G ((3 <= xLASTACK)))))) : E (G ((FIN <= xFINACK))) : NOT(E (F (((LISTEN + 1 <= SYNACK) AND (FINWAIT1 + 1 <= xCLOSEWAIT))))) : (A (G ((3 <= xCLOSED))) OR E (F (((SYNACK <= CLOSEWAIT) AND (3 <= SYNACK) AND ((xSYNSENT <= SYNACK) OR (xFINWAIT2 <= ESTAB)))))) : (A (((xFINACK <= xSYN) U ((3 <= xFIN) OR (2 <= xCLOSING)))) OR E (G ((xTIMEWAIT <= FINACK)))) : E (G ((SYNSENT <= xLASTACK))) : ((A (((1 <= LASTACK) U (xESTAB <= ESTAB))) AND E (G (()))) AND ((xSYNSENT + 1 <= ESTAB) OR (E (G ((xFINACK <= SYN))) AND ((ESTAB <= 2) OR (SYNSENT <= SYN))))) : (E (G (((2 <= FINACK) AND (2 <= xSYN) AND ((xCLOSING <= xCLOSEWAIT) OR (xSYNACK <= xFINACK))))) OR E (F ((2 <= xCLOSING))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A ((TRUE U (2 <= xLISTEN)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (2 <= xLISTEN)))))
lola: processed formula length: 44
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 337 markings, 338 edges
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (F (TRUE)) U (3 <= xLASTACK)))
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 84 bytes per marking, with 0 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: 26 markings, 25 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(E (G (((FINWAIT2 <= FINWAIT1) OR (2 <= xFINWAIT1))))) OR A (G ((xFINWAIT1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((FINWAIT1 + 1 <= FINWAIT2) AND (xFINWAIT1 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (((FINWAIT1 + 1 <= FINWAIT2) AND (xFINWAIT1 <= 1))))
lola: processed formula: A (F (((FINWAIT1 + 1 <= FINWAIT2) AND (xFINWAIT1 <= 1))))
lola: processed formula length: 57
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 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: 408 markings, 408 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((xFINWAIT1 <= 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 84 bytes per marking, with 0 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: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-3.sara
lola: 14 markings, 13 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: lola: The Boolean predicate is false.
state equation: calling and running sara
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((SYNSENT <= 0) AND (TIMEWAIT + 1 <= FINACK) AND ((xLISTEN + 1 <= xSYNRCVD) OR (xSYNSENT + 1 <= FINWAIT1)))))
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 84 bytes per marking, with 0 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: SUBRESULT
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 69 markings, 68 edges
lola: state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-3.sara
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= xSYNACK)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= xSYNACK)))
lola: processed formula: A (F ((1 <= xSYNACK)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
sara: try reading problem file TCPcondis-PT-30-CTLCardinality-3.sara.
sara: place or transition ordering is non-deterministic

lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 45106 markings, 98181 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (()))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: processed formula with 0 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 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (F (((2 <= xSYNACK) OR (2 <= SYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A(TRUE U ((2 <= xSYNACK) OR (2 <= SYNSENT))))))
lola: processed formula length: 65
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 393 markings, 423 edges
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((SYNSENT <= xSYN) U A (G ((2 <= SYNRCVD)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((SYNSENT <= xSYN) U NOT(E(TRUE U (SYNRCVD <= 1))))
lola: processed formula length: 52
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 1297685 markings, 4591986 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2417993 markings, 8752333 edges, 224062 markings/sec, 5 secs
lola: 3463583 markings, 12687328 edges, 209118 markings/sec, 10 secs
lola: 4466815 markings, 16492111 edges, 200646 markings/sec, 15 secs
lola: 5426952 markings, 20169411 edges, 192027 markings/sec, 20 secs
lola: 6365693 markings, 23769494 edges, 187748 markings/sec, 25 secs
lola: 7285190 markings, 27329598 edges, 183899 markings/sec, 30 secs
lola: 8187139 markings, 30821946 edges, 180390 markings/sec, 35 secs
lola: 9079698 markings, 34287357 edges, 178512 markings/sec, 40 secs
lola: 9945571 markings, 37678727 edges, 173175 markings/sec, 45 secs
lola: 10806702 markings, 41045602 edges, 172226 markings/sec, 50 secs
lola: 11662370 markings, 44399880 edges, 171134 markings/sec, 55 secs
lola: 12502644 markings, 47708788 edges, 168055 markings/sec, 60 secs
lola: 13343618 markings, 51000244 edges, 168195 markings/sec, 65 secs
lola: 14158512 markings, 54227060 edges, 162979 markings/sec, 70 secs
lola: 14975770 markings, 57453907 edges, 163452 markings/sec, 75 secs
lola: 15786095 markings, 60666720 edges, 162065 markings/sec, 80 secs
lola: 16588659 markings, 63848955 edges, 160513 markings/sec, 85 secs
lola: 17386456 markings, 67006542 edges, 159559 markings/sec, 90 secs
lola: 18174080 markings, 70148204 edges, 157525 markings/sec, 95 secs
lola: 18961053 markings, 73276817 edges, 157395 markings/sec, 100 secs
lola: 19749643 markings, 76394843 edges, 157718 markings/sec, 105 secs
lola: 20527250 markings, 79499971 edges, 155521 markings/sec, 110 secs
lola: 21305707 markings, 82592651 edges, 155691 markings/sec, 115 secs
lola: 21957310 markings, 85192686 edges, 130321 markings/sec, 120 secs
lola: 22733482 markings, 88284470 edges, 155234 markings/sec, 125 secs
lola: 23491369 markings, 91337697 edges, 151577 markings/sec, 130 secs
lola: 24267757 markings, 94414236 edges, 155278 markings/sec, 135 secs
lola: 25028438 markings, 97454828 edges, 152136 markings/sec, 140 secs
lola: 25774721 markings, 100458827 edges, 149257 markings/sec, 145 secs
lola: 26516394 markings, 103447036 edges, 148335 markings/sec, 150 secs
lola: 27262038 markings, 106439103 edges, 149129 markings/sec, 155 secs
lola: 28004717 markings, 109422412 edges, 148536 markings/sec, 160 secs
lola: 28741646 markings, 112385746 edges, 147386 markings/sec, 165 secs
lola: 29480395 markings, 115349560 edges, 147750 markings/sec, 170 secs
lola: 30214939 markings, 118304462 edges, 146909 markings/sec, 175 secs
lola: 30944260 markings, 121239327 edges, 145864 markings/sec, 180 secs
lola: 31668814 markings, 124155287 edges, 144911 markings/sec, 185 secs
lola: 32385510 markings, 127077513 edges, 143339 markings/sec, 190 secs
lola: 33104205 markings, 129975141 edges, 143739 markings/sec, 195 secs
lola: 33829813 markings, 132896573 edges, 145122 markings/sec, 200 secs
lola: 34543802 markings, 135782850 edges, 142798 markings/sec, 205 secs
lola: 35262286 markings, 138693196 edges, 143697 markings/sec, 210 secs
lola: 35966956 markings, 141570324 edges, 140934 markings/sec, 215 secs
lola: 36679035 markings, 144451665 edges, 142416 markings/sec, 220 secs
lola: 37390098 markings, 147318289 edges, 142213 markings/sec, 225 secs
lola: 38107716 markings, 150207734 edges, 143524 markings/sec, 230 secs
lola: 38809243 markings, 153048614 edges, 140305 markings/sec, 235 secs
lola: 39506147 markings, 155873304 edges, 139381 markings/sec, 240 secs
lola: 40205835 markings, 158713904 edges, 139938 markings/sec, 245 secs
lola: 40900647 markings, 161539263 edges, 138962 markings/sec, 250 secs
lola: 41596326 markings, 164355635 edges, 139136 markings/sec, 255 secs
lola: 42287907 markings, 167194277 edges, 138316 markings/sec, 260 secs
lola: 42995460 markings, 170057511 edges, 141511 markings/sec, 265 secs
lola: 43682025 markings, 172857509 edges, 137313 markings/sec, 270 secs
lola: 44368782 markings, 175649192 edges, 137351 markings/sec, 275 secs
lola: 45050401 markings, 178429125 edges, 136324 markings/sec, 280 secs
lola: 45734993 markings, 181225288 edges, 136918 markings/sec, 285 secs
lola: 46418568 markings, 184015808 edges, 136715 markings/sec, 290 secs
lola: 47096590 markings, 186769387 edges, 135604 markings/sec, 295 secs
lola: 47784133 markings, 189543838 edges, 137509 markings/sec, 300 secs
lola: 48460889 markings, 192313291 edges, 135351 markings/sec, 305 secs
lola: 49143332 markings, 195093027 edges, 136489 markings/sec, 310 secs
lola: 49815995 markings, 197832928 edges, 134533 markings/sec, 315 secs
lola: 50478919 markings, 200557300 edges, 132585 markings/sec, 320 secs
lola: 51162017 markings, 203327118 edges, 136620 markings/sec, 325 secs
lola: 51827840 markings, 206056199 edges, 133165 markings/sec, 330 secs
lola: 52495990 markings, 208790885 edges, 133630 markings/sec, 335 secs
lola: 53163517 markings, 211522086 edges, 133505 markings/sec, 340 secs
lola: 53832380 markings, 214268939 edges, 133773 markings/sec, 345 secs
lola: 54497124 markings, 216982572 edges, 132949 markings/sec, 350 secs
lola: 55159833 markings, 219683936 edges, 132542 markings/sec, 355 secs
lola: 55827045 markings, 222411261 edges, 133442 markings/sec, 360 secs
lola: 56485026 markings, 225099811 edges, 131596 markings/sec, 365 secs
lola: 57145876 markings, 227804612 edges, 132170 markings/sec, 370 secs
lola: 57805299 markings, 230509151 edges, 131885 markings/sec, 375 secs
lola: 58453672 markings, 233161885 edges, 129675 markings/sec, 380 secs
lola: 59115458 markings, 235859333 edges, 132357 markings/sec, 385 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (((1 <= CLOSEWAIT) OR (LISTEN <= 1)))) AND (E (G ((xTIMEWAIT <= FINACK))) OR ((1 <= xSYNACK) OR A (G ((3 <= xLASTACK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((1 <= CLOSEWAIT) OR (LISTEN <= 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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-8.sara
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((xTIMEWAIT <= FINACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FINACK + 1 <= xTIMEWAIT)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 326 markings, 326 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((FIN <= xFINACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (xFINACK + 1 <= FIN)))
lola: processed formula length: 35
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 2292406 markings, 5983057 edges, 3096159597753270272 markings/sec, 0 secs
lola: 4414738 markings, 11718673 edges, 424466 markings/sec, 5 secs
lola: 6437885 markings, 17211876 edges, 404629 markings/sec, 10 secs
lola: 8357474 markings, 22467331 edges, 383918 markings/sec, 15 secs
lola: 10170133 markings, 27446589 edges, 362532 markings/sec, 20 secs
lola: 11949441 markings, 32317168 edges, 355862 markings/sec, 25 secs
lola: 13719257 markings, 37145307 edges, 353963 markings/sec, 30 secs
lola: 15433869 markings, 42197705 edges, 342922 markings/sec, 35 secs
lola: 17038589 markings, 47478982 edges, 320944 markings/sec, 40 secs
lola: 18543017 markings, 52493697 edges, 300886 markings/sec, 45 secs
lola: 20005232 markings, 57408866 edges, 292443 markings/sec, 50 secs
lola: 21438084 markings, 62262482 edges, 286570 markings/sec, 55 secs
lola: 22881470 markings, 67144689 edges, 288677 markings/sec, 60 secs
lola: 24315831 markings, 71991401 edges, 286872 markings/sec, 65 secs
lola: 25749957 markings, 76835674 edges, 286825 markings/sec, 70 secs
lola: 27145671 markings, 81666295 edges, 279143 markings/sec, 75 secs
lola: 28604428 markings, 86578231 edges, 291751 markings/sec, 80 secs
lola: 29919703 markings, 91335018 edges, 263055 markings/sec, 85 secs
lola: 31297868 markings, 95852940 edges, 275633 markings/sec, 90 secs
lola: 32544122 markings, 100047867 edges, 249251 markings/sec, 95 secs
lola: 33770977 markings, 104164405 edges, 245371 markings/sec, 100 secs
lola: 34962631 markings, 108212318 edges, 238331 markings/sec, 105 secs
lola: 36152935 markings, 112253700 edges, 238061 markings/sec, 110 secs
lola: 37346295 markings, 116301318 edges, 238672 markings/sec, 115 secs
lola: 38527467 markings, 120319678 edges, 236234 markings/sec, 120 secs
lola: 39668098 markings, 124268053 edges, 228126 markings/sec, 125 secs
lola: 40886915 markings, 128390599 edges, 243763 markings/sec, 130 secs
lola: 42013621 markings, 132318648 edges, 225341 markings/sec, 135 secs
lola: 43268319 markings, 136671047 edges, 250940 markings/sec, 140 secs
lola: 44483966 markings, 140732534 edges, 243129 markings/sec, 145 secs
lola: 45657487 markings, 144673101 edges, 234704 markings/sec, 150 secs
lola: 46796148 markings, 148539931 edges, 227732 markings/sec, 155 secs
lola: 47931611 markings, 152384173 edges, 227093 markings/sec, 160 secs
lola: 49054056 markings, 156212427 edges, 224489 markings/sec, 165 secs
lola: 50185252 markings, 160042234 edges, 226239 markings/sec, 170 secs
lola: 51322532 markings, 163895025 edges, 227456 markings/sec, 175 secs
lola: 52398824 markings, 167636538 edges, 215258 markings/sec, 180 secs
lola: 53552271 markings, 171528301 edges, 230689 markings/sec, 185 secs
lola: 54621972 markings, 175262332 edges, 213940 markings/sec, 190 secs
lola: 56065676 markings, 180225073 edges, 288741 markings/sec, 195 secs
lola: 57584544 markings, 185279119 edges, 303774 markings/sec, 200 secs
lola: 59008046 markings, 190076350 edges, 284700 markings/sec, 205 secs
lola: 60458390 markings, 194967473 edges, 290069 markings/sec, 210 secs
lola: 61863668 markings, 199733098 edges, 281056 markings/sec, 215 secs
lola: 63287937 markings, 204562385 edges, 284854 markings/sec, 220 secs
lola: 64654663 markings, 209209164 edges, 273345 markings/sec, 225 secs
lola: 66032987 markings, 213965273 edges, 275665 markings/sec, 230 secs
lola: 67471793 markings, 218827238 edges, 287761 markings/sec, 235 secs
lola: 68797751 markings, 223444605 edges, 265192 markings/sec, 240 secs
lola: 69964474 markings, 228086506 edges, 233345 markings/sec, 245 secs
lola: 71020457 markings, 232311224 edges, 211197 markings/sec, 250 secs
lola: 72045295 markings, 236415174 edges, 204968 markings/sec, 255 secs
lola: 73041319 markings, 240445376 edges, 199205 markings/sec, 260 secs
lola: 74040080 markings, 244485798 edges, 199752 markings/sec, 265 secs
lola: 75038445 markings, 248519162 edges, 199673 markings/sec, 270 secs
lola: 76049121 markings, 252604630 edges, 202135 markings/sec, 275 secs
lola: 76975694 markings, 256425808 edges, 185315 markings/sec, 280 secs
lola: 77985133 markings, 260490684 edges, 201888 markings/sec, 285 secs
lola: 78958412 markings, 264512207 edges, 194656 markings/sec, 290 secs
lola: 79960795 markings, 268545310 edges, 200477 markings/sec, 295 secs
lola: 80893483 markings, 272410088 edges, 186538 markings/sec, 300 secs
lola: 81901164 markings, 276685526 edges, 201536 markings/sec, 305 secs
lola: 82914045 markings, 280702653 edges, 202576 markings/sec, 310 secs
lola: 83861954 markings, 284528910 edges, 189582 markings/sec, 315 secs
lola: 84812495 markings, 288326721 edges, 190108 markings/sec, 320 secs
lola: 85764649 markings, 292171153 edges, 190431 markings/sec, 325 secs
lola: 86669257 markings, 295848276 edges, 180922 markings/sec, 330 secs
lola: 87588954 markings, 299601572 edges, 183939 markings/sec, 335 secs
lola: 88529663 markings, 303390192 edges, 188142 markings/sec, 340 secs
lola: 89412020 markings, 307013177 edges, 176471 markings/sec, 345 secs
lola: 90349475 markings, 310802798 edges, 187491 markings/sec, 350 secs
lola: 91275618 markings, 314597967 edges, 185229 markings/sec, 355 secs
lola: 92201974 markings, 318347849 edges, 185271 markings/sec, 360 secs
lola: 93078500 markings, 321981686 edges, 175305 markings/sec, 365 secs
lola: 94121229 markings, 325981701 edges, 208546 markings/sec, 370 secs
lola: 95261575 markings, 329759841 edges, 228069 markings/sec, 375 secs
lola: 96347105 markings, 333401057 edges, 217106 markings/sec, 380 secs
lola: 97412529 markings, 337002141 edges, 213085 markings/sec, 385 secs
lola: 98463430 markings, 340564107 edges, 210180 markings/sec, 390 secs
lola: 99520037 markings, 344143156 edges, 211321 markings/sec, 395 secs
lola: 100568556 markings, 347701448 edges, 209704 markings/sec, 400 secs
lola: 101576035 markings, 351187360 edges, 201496 markings/sec, 405 secs
lola: 102643939 markings, 354791230 edges, 213581 markings/sec, 410 secs
lola: 103647892 markings, 358294127 edges, 200791 markings/sec, 415 secs
lola: 104671352 markings, 362383872 edges, 204692 markings/sec, 420 secs
lola: 105650094 markings, 366303921 edges, 195748 markings/sec, 425 secs
lola: 106583519 markings, 370091441 edges, 186685 markings/sec, 430 secs
lola: 107533755 markings, 373920361 edges, 190047 markings/sec, 435 secs
lola: 108451957 markings, 377650514 edges, 183640 markings/sec, 440 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 449 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((LISTEN + 1 <= SYNACK) AND (FINWAIT1 + 1 <= xCLOSEWAIT)))))
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 84 bytes per marking, with 0 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 TCPcondis-PT-30-CTLCardinality-10.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: 17 markings, 16 edges
lola: ========================================
lola: subprocess 11 will run for 539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (G ((3 <= xCLOSED))) OR E (F (((SYNACK <= CLOSEWAIT) AND (3 <= SYNACK) AND ((xSYNSENT <= SYNACK) OR (xFINWAIT2 <= ESTAB))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 539 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((3 <= xCLOSED)))
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 84 bytes per marking, with 0 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 TCPcondis-PT-30-CTLCardinality-11.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 28 edges
lola: ========================================
lola: subprocess 12 will run for 674 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((SYNACK <= CLOSEWAIT) AND (3 <= SYNACK) AND ((xSYNSENT <= SYNACK) OR (xFINWAIT2 <= ESTAB)))))
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 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-12.sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 616 markings, 759 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 674 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (((xFINACK <= xSYN) U ((3 <= xFIN) OR (2 <= xCLOSING)))) OR E (G ((xTIMEWAIT <= FINACK))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 674 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((xFINACK <= xSYN) U ((3 <= xFIN) OR (2 <= xCLOSING))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((xFINACK <= xSYN) U ((3 <= xFIN) OR (2 <= xCLOSING))))
lola: processed formula: A (((xFINACK <= xSYN) U ((3 <= xFIN) OR (2 <= xCLOSING))))
lola: processed formula length: 59
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 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: 889 markings, 889 edges
lola: ========================================
lola: subprocess 13 will run for 899 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((xTIMEWAIT <= FINACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (FINACK + 1 <= xTIMEWAIT)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 326 markings, 326 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 13 will run for 899 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((SYNSENT <= xLASTACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (xLASTACK + 1 <= SYNSENT)))
lola: processed formula length: 40
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: 394 markings, 424 edges
lola: ========================================
lola: subprocess 14 will run for 1348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((A (((1 <= LASTACK) U (xESTAB <= ESTAB))) AND E (G (()))) AND ((xSYNSENT + 1 <= ESTAB) OR (E (G ((xFINACK <= SYN))) AND ((ESTAB <= 2) OR (SYNSENT <= SYN)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1348 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((1 <= LASTACK) U (xESTAB <= ESTAB)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((1 <= LASTACK) U (xESTAB <= ESTAB)))
lola: processed formula: A (((1 <= LASTACK) U (xESTAB <= ESTAB)))
lola: processed formula length: 40
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 15 will run for 2697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (xSYNSENT + 1 <= ESTAB)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (xSYNSENT + 1 <= ESTAB)
lola: processed formula length: 23
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 17 will run for 1 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((ESTAB <= 2) OR (SYNSENT <= SYN))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((ESTAB <= 2) OR (SYNSENT <= SYN))
lola: processed formula length: 35
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 15 will run for 2697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((2 <= FINACK) AND (2 <= xSYN) AND ((xCLOSING <= xCLOSEWAIT) OR (xSYNACK <= xFINACK))))) OR E (F ((2 <= xCLOSING))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2697 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((2 <= FINACK) AND (2 <= xSYN) AND ((xCLOSING <= xCLOSEWAIT) OR (xSYNACK <= xFINACK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((FINACK <= 1) OR (xSYN <= 1) OR ((xCLOSEWAIT + 1 <= xCLOSING) AND (xFINACK + 1 <= xSYNACK)))))
lola: processed formula length: 110
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-30-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 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: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no yes yes yes no unknown yes unknown no yes yes yes unknown unknown
FORMULA TCPcondis-PT-30-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-1 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-7 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-30-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stderr -----
----- Finished stdout -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-30"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-30.tgz
mv TCPcondis-PT-30 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
echo " Input is TCPcondis-PT-30, 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 r178-smll-152708748300213"
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 ;