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 irma4mcc-structural
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 r175-smll-152708746300213
=====================================================================

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


BK_STOP 1527162175295

--------------------
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 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': 'itstools'}].
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 stdout -----
----- Start make result stderr -----
CTLCardinality @ TCPcondis-PT-30 @ 3539 seconds
----- Start make result stdout -----
----- Start make result stderr -----
lola: LoLA will run for 3539 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 235 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: 14 markings, 13 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-3.sara
lola: 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: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: SUBRESULT
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 294 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
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 353 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: 1318522 markings, 4669936 edges, 3689330178019819520 markings/sec, 0 secs
lola: 2433786 markings, 8812750 edges, 223053 markings/sec, 5 secs
lola: 3475298 markings, 12731879 edges, 208302 markings/sec, 10 secs
lola: 4477674 markings, 16535648 edges, 200475 markings/sec, 15 secs
lola: 5437870 markings, 20211206 edges, 192039 markings/sec, 20 secs
lola: 6376321 markings, 23808853 edges, 187690 markings/sec, 25 secs
lola: 7292316 markings, 27357483 edges, 183199 markings/sec, 30 secs
lola: 8192044 markings, 30841186 edges, 179946 markings/sec, 35 secs
lola: 9082025 markings, 34296713 edges, 177996 markings/sec, 40 secs
lola: 9944669 markings, 37675339 edges, 172529 markings/sec, 45 secs
lola: 10805863 markings, 41042242 edges, 172239 markings/sec, 50 secs
lola: 11661013 markings, 44394414 edges, 171030 markings/sec, 55 secs
lola: 12499561 markings, 47697023 edges, 167710 markings/sec, 60 secs
lola: 13339405 markings, 50984008 edges, 167969 markings/sec, 65 secs
lola: 14154396 markings, 54209543 edges, 162998 markings/sec, 70 secs
lola: 14971309 markings, 57436513 edges, 163383 markings/sec, 75 secs
lola: 15782255 markings, 60651887 edges, 162189 markings/sec, 80 secs
lola: 16585948 markings, 63837836 edges, 160739 markings/sec, 85 secs
lola: 17384365 markings, 66998098 edges, 159683 markings/sec, 90 secs
lola: 18171927 markings, 70139574 edges, 157512 markings/sec, 95 secs
lola: 18959354 markings, 73269087 edges, 157485 markings/sec, 100 secs
lola: 19747877 markings, 76387308 edges, 157705 markings/sec, 105 secs
lola: 20524083 markings, 79488166 edges, 155241 markings/sec, 110 secs
lola: 21301856 markings, 82577138 edges, 155555 markings/sec, 115 secs
lola: 22066482 markings, 85628501 edges, 152925 markings/sec, 120 secs
lola: 22833317 markings, 88687341 edges, 153367 markings/sec, 125 secs
lola: 23588792 markings, 91722881 edges, 151095 markings/sec, 130 secs
lola: 24353488 markings, 94755967 edges, 152939 markings/sec, 135 secs
lola: 25105437 markings, 97765333 edges, 150390 markings/sec, 140 secs
lola: 25843902 markings, 100738287 edges, 147693 markings/sec, 145 secs
lola: 26576310 markings, 103685183 edges, 146482 markings/sec, 150 secs
lola: 27311538 markings, 106643571 edges, 147046 markings/sec, 155 secs
lola: 28047734 markings, 109596100 edges, 147239 markings/sec, 160 secs
lola: 28775781 markings, 112521537 edges, 145609 markings/sec, 165 secs
lola: 29506367 markings, 115453264 edges, 146117 markings/sec, 170 secs
lola: 30233703 markings, 118378152 edges, 145467 markings/sec, 175 secs
lola: 30954313 markings, 121279911 edges, 144122 markings/sec, 180 secs
lola: 31672274 markings, 124167447 edges, 143592 markings/sec, 185 secs
lola: 32380613 markings, 127056325 edges, 141668 markings/sec, 190 secs
lola: 33091950 markings, 129922898 edges, 142267 markings/sec, 195 secs
lola: 33806758 markings, 132806650 edges, 142962 markings/sec, 200 secs
lola: 34514194 markings, 135663064 edges, 141487 markings/sec, 205 secs
lola: 35200317 markings, 138443985 edges, 137225 markings/sec, 210 secs
lola: 35901099 markings, 141304072 edges, 140156 markings/sec, 215 secs
lola: 36610202 markings, 144171160 edges, 141821 markings/sec, 220 secs
lola: 37314773 markings, 147011542 edges, 140914 markings/sec, 225 secs
lola: 38020762 markings, 149861169 edges, 141198 markings/sec, 230 secs
lola: 38719824 markings, 152688006 edges, 139812 markings/sec, 235 secs
lola: 39413306 markings, 155498122 edges, 138696 markings/sec, 240 secs
lola: 40110409 markings, 158321321 edges, 139421 markings/sec, 245 secs
lola: 40794205 markings, 161112548 edges, 136759 markings/sec, 250 secs
lola: 41475737 markings, 163877010 edges, 136306 markings/sec, 255 secs
lola: 42159514 markings, 166667710 edges, 136755 markings/sec, 260 secs
lola: 42849914 markings, 169471798 edges, 138080 markings/sec, 265 secs
lola: 43532022 markings, 172243808 edges, 136422 markings/sec, 270 secs
lola: 44203675 markings, 174983128 edges, 134331 markings/sec, 275 secs
lola: 44851248 markings, 177619425 edges, 129515 markings/sec, 280 secs
lola: 45506116 markings, 180286047 edges, 130974 markings/sec, 285 secs
lola: 46159521 markings, 182963743 edges, 130681 markings/sec, 290 secs
lola: 46829130 markings, 185686406 edges, 133922 markings/sec, 295 secs
lola: 47485504 markings, 188326285 edges, 131275 markings/sec, 300 secs
lola: 48137896 markings, 190982060 edges, 130478 markings/sec, 305 secs
lola: 48780975 markings, 193609994 edges, 128616 markings/sec, 310 secs
lola: 49420477 markings, 196227827 edges, 127900 markings/sec, 315 secs
lola: 50070887 markings, 198883339 edges, 130082 markings/sec, 320 secs
lola: 50724558 markings, 201554084 edges, 130734 markings/sec, 325 secs
lola: 51398087 markings, 204291913 edges, 134706 markings/sec, 330 secs
lola: 52056131 markings, 206981893 edges, 131609 markings/sec, 335 secs
lola: 52703972 markings, 209646740 edges, 129568 markings/sec, 340 secs
lola: 53365307 markings, 212351736 edges, 132267 markings/sec, 345 secs
lola: 54024245 markings, 215053094 edges, 131788 markings/sec, 350 secs
lola: 54678473 markings, 217727278 edges, 130846 markings/sec, 355 secs
lola: 55296916 markings, 220240689 edges, 123689 markings/sec, 360 secs
lola: 55955579 markings, 222938376 edges, 131733 markings/sec, 365 secs
lola: 56600473 markings, 225564688 edges, 128979 markings/sec, 370 secs
lola: 57252659 markings, 228241037 edges, 130437 markings/sec, 375 secs
lola: 57897364 markings, 230890165 edges, 128941 markings/sec, 380 secs
lola: 58540501 markings, 233514931 edges, 128627 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: state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-8.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 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: 2192702 markings, 5724192 edges, 3096159597753270272 markings/sec, 0 secs
lola: 4299596 markings, 11419732 edges, 421379 markings/sec, 5 secs
lola: 6314538 markings, 16867736 edges, 402988 markings/sec, 10 secs
lola: 8229045 markings, 22125834 edges, 382901 markings/sec, 15 secs
lola: 10112917 markings, 27295740 edges, 376774 markings/sec, 20 secs
lola: 11975906 markings, 32393001 edges, 372598 markings/sec, 25 secs
lola: 13817322 markings, 37417887 edges, 368283 markings/sec, 30 secs
lola: 15505309 markings, 42424144 edges, 337597 markings/sec, 35 secs
lola: 17080321 markings, 47620416 edges, 315002 markings/sec, 40 secs
lola: 18566472 markings, 52565337 edges, 297230 markings/sec, 45 secs
lola: 20009169 markings, 57422402 edges, 288539 markings/sec, 50 secs
lola: 21427727 markings, 62225832 edges, 283712 markings/sec, 55 secs
lola: 22852248 markings, 67043031 edges, 284904 markings/sec, 60 secs
lola: 24271846 markings, 71838485 edges, 283920 markings/sec, 65 secs
lola: 25687907 markings, 76621326 edges, 283212 markings/sec, 70 secs
lola: 27052674 markings, 81349470 edges, 272953 markings/sec, 75 secs
lola: 28503730 markings, 86231594 edges, 290211 markings/sec, 80 secs
lola: 29805267 markings, 90890356 edges, 260307 markings/sec, 85 secs
lola: 31171542 markings, 95432547 edges, 273255 markings/sec, 90 secs
lola: 32420370 markings, 99620631 edges, 249766 markings/sec, 95 secs
lola: 33634121 markings, 103694815 edges, 242750 markings/sec, 100 secs
lola: 34816750 markings, 107707087 edges, 236526 markings/sec, 105 secs
lola: 35989764 markings, 111689746 edges, 234603 markings/sec, 110 secs
lola: 37171366 markings, 115699311 edges, 236320 markings/sec, 115 secs
lola: 38298002 markings, 119578668 edges, 225327 markings/sec, 120 secs
lola: 39462015 markings, 123548803 edges, 232803 markings/sec, 125 secs
lola: 40668036 markings, 127634284 edges, 241204 markings/sec, 130 secs
lola: 41775451 markings, 131485691 edges, 221483 markings/sec, 135 secs
lola: 42989264 markings, 135747597 edges, 242763 markings/sec, 140 secs
lola: 44213281 markings, 139807207 edges, 244803 markings/sec, 145 secs
lola: 45376207 markings, 143707990 edges, 232585 markings/sec, 150 secs
lola: 46488601 markings, 147480245 edges, 222479 markings/sec, 155 secs
lola: 47603340 markings, 151263872 edges, 222948 markings/sec, 160 secs
lola: 48718605 markings, 155045683 edges, 223053 markings/sec, 165 secs
lola: 49840358 markings, 158846890 edges, 224351 markings/sec, 170 secs
lola: 50919144 markings, 162542709 edges, 215757 markings/sec, 175 secs
lola: 52014891 markings, 166297041 edges, 219149 markings/sec, 180 secs
lola: 53160220 markings, 170173663 edges, 229066 markings/sec, 185 secs
lola: 54212628 markings, 173831435 edges, 210482 markings/sec, 190 secs
lola: 55441387 markings, 178165641 edges, 245752 markings/sec, 195 secs
lola: 56982242 markings, 183264356 edges, 308171 markings/sec, 200 secs
lola: 58433317 markings, 188133293 edges, 290215 markings/sec, 205 secs
lola: 59819017 markings, 192838991 edges, 277140 markings/sec, 210 secs
lola: 61209458 markings, 197538254 edges, 278088 markings/sec, 215 secs
lola: 62611903 markings, 202321300 edges, 280489 markings/sec, 220 secs
lola: 63993977 markings, 207007624 edges, 276415 markings/sec, 225 secs
lola: 65395602 markings, 211749762 edges, 280325 markings/sec, 230 secs
lola: 66786620 markings, 216476182 edges, 278204 markings/sec, 235 secs
lola: 68131197 markings, 221119242 edges, 268915 markings/sec, 240 secs
lola: 69388761 markings, 225818361 edges, 251513 markings/sec, 245 secs
lola: 70467567 markings, 230090121 edges, 215761 markings/sec, 250 secs
lola: 71485346 markings, 234170493 edges, 203556 markings/sec, 255 secs
lola: 72475762 markings, 238151980 edges, 198083 markings/sec, 260 secs
lola: 73499508 markings, 242272143 edges, 204749 markings/sec, 265 secs
lola: 74458485 markings, 246168137 edges, 191795 markings/sec, 270 secs
lola: 75433670 markings, 250151272 edges, 195037 markings/sec, 275 secs
lola: 76422062 markings, 254137274 edges, 197678 markings/sec, 280 secs
lola: 77394640 markings, 258077432 edges, 194516 markings/sec, 285 secs
lola: 78353639 markings, 262012460 edges, 191800 markings/sec, 290 secs
lola: 79379261 markings, 266155159 edges, 205124 markings/sec, 295 secs
lola: 80298940 markings, 269940402 edges, 183936 markings/sec, 300 secs
lola: 81206218 markings, 273868778 edges, 181456 markings/sec, 305 secs
lola: 82262544 markings, 278107908 edges, 211265 markings/sec, 310 secs
lola: 83231654 markings, 281991696 edges, 193822 markings/sec, 315 secs
lola: 84185160 markings, 285804324 edges, 190701 markings/sec, 320 secs
lola: 85095971 markings, 289483096 edges, 182162 markings/sec, 325 secs
lola: 86007943 markings, 293164951 edges, 182394 markings/sec, 330 secs
lola: 86921424 markings, 296853770 edges, 182696 markings/sec, 335 secs
lola: 87812953 markings, 300527923 edges, 178306 markings/sec, 340 secs
lola: 88708681 markings, 304127860 edges, 179146 markings/sec, 345 secs
lola: 89601923 markings, 307743304 edges, 178648 markings/sec, 350 secs
lola: 90481020 markings, 311345095 edges, 175819 markings/sec, 355 secs
lola: 91406681 markings, 315099232 edges, 185132 markings/sec, 360 secs
lola: 92273315 markings, 318642868 edges, 173327 markings/sec, 365 secs
lola: 93123007 markings, 322166723 edges, 169938 markings/sec, 370 secs
lola: 94126286 markings, 325998967 edges, 200656 markings/sec, 375 secs
lola: 95212962 markings, 329598163 edges, 217335 markings/sec, 380 secs
lola: 96243469 markings, 333072656 edges, 206101 markings/sec, 385 secs
lola: 97285792 markings, 336567128 edges, 208465 markings/sec, 390 secs
lola: 98300256 markings, 340001778 edges, 202893 markings/sec, 395 secs
lola: 99324545 markings, 343471584 edges, 204858 markings/sec, 400 secs
lola: 100302861 markings, 346841649 edges, 195663 markings/sec, 405 secs
lola: 101310876 markings, 350262672 edges, 201603 markings/sec, 410 secs
lola: 102349060 markings, 353772595 edges, 207637 markings/sec, 415 secs
lola: 103310664 markings, 357112040 edges, 192321 markings/sec, 420 secs
lola: 104294724 markings, 360887614 edges, 196812 markings/sec, 425 secs
lola: 105245035 markings, 364676809 edges, 190062 markings/sec, 430 secs
lola: 106165058 markings, 368380528 edges, 184005 markings/sec, 435 secs
lola: 107050579 markings, 371978097 edges, 177104 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: 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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 29 markings, 28 edges
lola: state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-11.sara
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 898 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 898 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 2696 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 2696 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 2696 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 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="TCPcondis-PT-30"
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/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 irma4mcc-structural"
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 r175-smll-152708746300213"
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 ;