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-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 r174-smll-152708744900213
=====================================================================

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


BK_STOP 1527161234058

--------------------
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 stdout -----
----- Start make result stderr -----
CTLCardinality @ TCPcondis-PT-30 @ 3540 seconds
----- Start make result stderr -----
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 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: 14 markings, 13 edges
lola: state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-3.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
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: state equation: write sara problem file to TCPcondis-PT-30-CTLCardinality-3.sara
lola: The predicate is reachable.
lola: 69 markings, 68 edges
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:
state equation: calling and running sara
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: 1286043 markings, 4549386 edges, 3689329903141912576 markings/sec, 0 secs
lola: 2405118 markings, 8702944 edges, 223815 markings/sec, 5 secs
lola: 3445803 markings, 12620225 edges, 208137 markings/sec, 10 secs
lola: 4444611 markings, 16408913 edges, 199762 markings/sec, 15 secs
lola: 5396243 markings, 20051095 edges, 190326 markings/sec, 20 secs
lola: 6320501 markings, 23601550 edges, 184852 markings/sec, 25 secs
lola: 7230679 markings, 27114084 edges, 182036 markings/sec, 30 secs
lola: 8116231 markings, 30545467 edges, 177110 markings/sec, 35 secs
lola: 8991549 markings, 33940568 edges, 175064 markings/sec, 40 secs
lola: 9838550 markings, 37262646 edges, 169400 markings/sec, 45 secs
lola: 10685682 markings, 40566821 edges, 169426 markings/sec, 50 secs
lola: 11523173 markings, 43853146 edges, 167498 markings/sec, 55 secs
lola: 12345120 markings, 47086183 edges, 164389 markings/sec, 60 secs
lola: 13159190 markings, 50284668 edges, 162814 markings/sec, 65 secs
lola: 13959448 markings, 53432094 edges, 160052 markings/sec, 70 secs
lola: 14752880 markings, 56574997 edges, 158686 markings/sec, 75 secs
lola: 15543139 markings, 59698358 edges, 158052 markings/sec, 80 secs
lola: 16322705 markings, 62791137 edges, 155913 markings/sec, 85 secs
lola: 17096755 markings, 65862324 edges, 154810 markings/sec, 90 secs
lola: 17861911 markings, 68900822 edges, 153031 markings/sec, 95 secs
lola: 18624500 markings, 71939382 edges, 152518 markings/sec, 100 secs
lola: 19388492 markings, 74961402 edges, 152798 markings/sec, 105 secs
lola: 20140138 markings, 77956988 edges, 150329 markings/sec, 110 secs
lola: 20897064 markings, 80964780 edges, 151385 markings/sec, 115 secs
lola: 21642740 markings, 83932106 edges, 149135 markings/sec, 120 secs
lola: 22379054 markings, 86867443 edges, 147263 markings/sec, 125 secs
lola: 23110670 markings, 89806543 edges, 146323 markings/sec, 130 secs
lola: 23842477 markings, 92730931 edges, 146361 markings/sec, 135 secs
lola: 24574799 markings, 95638711 edges, 146464 markings/sec, 140 secs
lola: 25289789 markings, 98505802 edges, 142998 markings/sec, 145 secs
lola: 25994462 markings, 101339173 edges, 140935 markings/sec, 150 secs
lola: 26690901 markings, 104140328 edges, 139288 markings/sec, 155 secs
lola: 27393733 markings, 106972565 edges, 140566 markings/sec, 160 secs
lola: 28095521 markings, 109785699 edges, 140358 markings/sec, 165 secs
lola: 28786215 markings, 112564294 edges, 138139 markings/sec, 170 secs
lola: 29483351 markings, 115360663 edges, 139427 markings/sec, 175 secs
lola: 30175092 markings, 118143365 edges, 138348 markings/sec, 180 secs
lola: 30856552 markings, 120894165 edges, 136292 markings/sec, 185 secs
lola: 31532503 markings, 123613869 edges, 135190 markings/sec, 190 secs
lola: 32198332 markings, 126320056 edges, 133166 markings/sec, 195 secs
lola: 32867502 markings, 129017809 edges, 133834 markings/sec, 200 secs
lola: 33540758 markings, 131736911 edges, 134651 markings/sec, 205 secs
lola: 34209473 markings, 134426557 edges, 133743 markings/sec, 210 secs
lola: 34848860 markings, 137016043 edges, 127877 markings/sec, 215 secs
lola: 35497359 markings, 139651988 edges, 129700 markings/sec, 220 secs
lola: 36144808 markings, 142282873 edges, 129490 markings/sec, 225 secs
lola: 36776036 markings, 144851889 edges, 126246 markings/sec, 230 secs
lola: 37412671 markings, 147409694 edges, 127327 markings/sec, 235 secs
lola: 38055445 markings, 149992692 edges, 128555 markings/sec, 240 secs
lola: 38676942 markings, 152513069 edges, 124299 markings/sec, 245 secs
lola: 39297741 markings, 155030995 edges, 124160 markings/sec, 250 secs
lola: 39932428 markings, 157602857 edges, 126937 markings/sec, 255 secs
lola: 40557985 markings, 160143217 edges, 125111 markings/sec, 260 secs
lola: 41163879 markings, 162615401 edges, 121179 markings/sec, 265 secs
lola: 41785247 markings, 165135721 edges, 124274 markings/sec, 270 secs
lola: 42401016 markings, 167648705 edges, 123154 markings/sec, 275 secs
lola: 43018876 markings, 170153354 edges, 123572 markings/sec, 280 secs
lola: 43622718 markings, 172614640 edges, 120768 markings/sec, 285 secs
lola: 44218515 markings, 175042971 edges, 119159 markings/sec, 290 secs
lola: 44819916 markings, 177490642 edges, 120280 markings/sec, 295 secs
lola: 45428219 markings, 179968954 edges, 121661 markings/sec, 300 secs
lola: 46024849 markings, 182412662 edges, 119326 markings/sec, 305 secs
lola: 46618873 markings, 184833532 edges, 118805 markings/sec, 310 secs
lola: 47214238 markings, 187243860 edges, 119073 markings/sec, 315 secs
lola: 47811336 markings, 189656296 edges, 119420 markings/sec, 320 secs
lola: 48397785 markings, 192054180 edges, 117290 markings/sec, 325 secs
lola: 48984921 markings, 194456075 edges, 117427 markings/sec, 330 secs
lola: 49562024 markings, 196804704 edges, 115421 markings/sec, 335 secs
lola: 50141296 markings, 199171066 edges, 115854 markings/sec, 340 secs
lola: 50722096 markings, 201544322 edges, 116160 markings/sec, 345 secs
lola: 51319954 markings, 203972937 edges, 119572 markings/sec, 350 secs
lola: 51887670 markings, 206300733 edges, 113543 markings/sec, 355 secs
lola: 52460896 markings, 208650158 edges, 114645 markings/sec, 360 secs
lola: 53030694 markings, 210981328 edges, 113960 markings/sec, 365 secs
lola: 53597557 markings, 213314917 edges, 113373 markings/sec, 370 secs
lola: 54169860 markings, 215653485 edges, 114461 markings/sec, 375 secs
lola: 54731027 markings, 217948739 edges, 112233 markings/sec, 380 secs
lola: 55302892 markings, 220265869 edges, 114373 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: 2186899 markings, 5710865 edges, 3096159597753270272 markings/sec, 0 secs
lola: 4244505 markings, 11264145 edges, 411521 markings/sec, 5 secs
lola: 6211081 markings, 16580346 edges, 393315 markings/sec, 10 secs
lola: 8079682 markings, 21704238 edges, 373720 markings/sec, 15 secs
lola: 9933066 markings, 26783574 edges, 370677 markings/sec, 20 secs
lola: 11752192 markings, 31763231 edges, 363825 markings/sec, 25 secs
lola: 13287530 markings, 35934525 edges, 307068 markings/sec, 30 secs
lola: 14667271 markings, 39817266 edges, 275948 markings/sec, 35 secs
lola: 16049997 markings, 44199636 edges, 276545 markings/sec, 40 secs
lola: 17345345 markings, 48483076 edges, 259070 markings/sec, 45 secs
lola: 18551232 markings, 52519977 edges, 241177 markings/sec, 50 secs
lola: 19732667 markings, 56475780 edges, 236287 markings/sec, 55 secs
lola: 20915315 markings, 60461095 edges, 236530 markings/sec, 60 secs
lola: 22098158 markings, 64450035 edges, 236569 markings/sec, 65 secs
lola: 23291860 markings, 68531663 edges, 238740 markings/sec, 70 secs
lola: 24502172 markings, 72636461 edges, 242062 markings/sec, 75 secs
lola: 25740807 markings, 76803802 edges, 247727 markings/sec, 80 secs
lola: 26931519 markings, 80925141 edges, 238142 markings/sec, 85 secs
lola: 28207735 markings, 85206615 edges, 255243 markings/sec, 90 secs
lola: 29378632 markings, 89270767 edges, 234179 markings/sec, 95 secs
lola: 30542176 markings, 93356563 edges, 232709 markings/sec, 100 secs
lola: 31633707 markings, 96969754 edges, 218306 markings/sec, 105 secs
lola: 32614847 markings, 100283243 edges, 196228 markings/sec, 110 secs
lola: 33591156 markings, 103548545 edges, 195262 markings/sec, 115 secs
lola: 34551397 markings, 106795992 edges, 192048 markings/sec, 120 secs
lola: 35503012 markings, 110027885 edges, 190323 markings/sec, 125 secs
lola: 36446538 markings, 113274965 edges, 188705 markings/sec, 130 secs
lola: 37429968 markings, 116592997 edges, 196686 markings/sec, 135 secs
lola: 38393559 markings, 119883762 edges, 192718 markings/sec, 140 secs
lola: 39357721 markings, 123183926 edges, 192832 markings/sec, 145 secs
lola: 40364515 markings, 126599692 edges, 201359 markings/sec, 150 secs
lola: 41299691 markings, 129824391 edges, 187035 markings/sec, 155 secs
lola: 42234895 markings, 133114510 edges, 187041 markings/sec, 160 secs
lola: 43304941 markings, 136795675 edges, 214009 markings/sec, 165 secs
lola: 44330834 markings, 140206780 edges, 205179 markings/sec, 170 secs
lola: 45291860 markings, 143424005 edges, 192205 markings/sec, 175 secs
lola: 46210346 markings, 146522166 edges, 183697 markings/sec, 180 secs
lola: 47150377 markings, 149701041 edges, 188006 markings/sec, 185 secs
lola: 48115017 markings, 152971867 edges, 192928 markings/sec, 190 secs
lola: 49050013 markings, 156198194 edges, 186999 markings/sec, 195 secs
lola: 50035231 markings, 159521551 edges, 197044 markings/sec, 200 secs
lola: 50988439 markings, 162762067 edges, 190642 markings/sec, 205 secs
lola: 51931825 markings, 166007446 edges, 188677 markings/sec, 210 secs
lola: 52938229 markings, 169416650 edges, 201281 markings/sec, 215 secs
lola: 53877722 markings, 172660317 edges, 187899 markings/sec, 220 secs
lola: 54810449 markings, 175962372 edges, 186545 markings/sec, 225 secs
lola: 56236544 markings, 180789320 edges, 285219 markings/sec, 230 secs
lola: 57626395 markings, 185420730 edges, 277970 markings/sec, 235 secs
lola: 58900358 markings, 189738660 edges, 254793 markings/sec, 240 secs
lola: 60208603 markings, 194114494 edges, 261649 markings/sec, 245 secs
lola: 61481299 markings, 198422077 edges, 254539 markings/sec, 250 secs
lola: 62745837 markings, 202743211 edges, 252908 markings/sec, 255 secs
lola: 64008981 markings, 207060196 edges, 252629 markings/sec, 260 secs
lola: 65302923 markings, 211430544 edges, 258788 markings/sec, 265 secs
lola: 66534858 markings, 215668881 edges, 246387 markings/sec, 270 secs
lola: 67759104 markings, 219824842 edges, 244849 markings/sec, 275 secs
lola: 68881849 markings, 223782910 edges, 224549 markings/sec, 280 secs
lola: 69857035 markings, 227661390 edges, 195037 markings/sec, 285 secs
lola: 70759357 markings, 231248396 edges, 180464 markings/sec, 290 secs
lola: 71628527 markings, 234758186 edges, 173834 markings/sec, 295 secs
lola: 72504718 markings, 238259375 edges, 175238 markings/sec, 300 secs
lola: 73391646 markings, 241846412 edges, 177386 markings/sec, 305 secs
lola: 74214174 markings, 245204161 edges, 164506 markings/sec, 310 secs
lola: 75050699 markings, 248569849 edges, 167305 markings/sec, 315 secs
lola: 75901080 markings, 252003010 edges, 170076 markings/sec, 320 secs
lola: 76664284 markings, 255137047 edges, 152641 markings/sec, 325 secs
lola: 77502949 markings, 258513889 edges, 167733 markings/sec, 330 secs
lola: 78294516 markings, 261768621 edges, 158313 markings/sec, 335 secs
lola: 79137116 markings, 265196004 edges, 168520 markings/sec, 340 secs
lola: 79939322 markings, 268455192 edges, 160441 markings/sec, 345 secs
lola: 80709360 markings, 271646467 edges, 154008 markings/sec, 350 secs
lola: 81525102 markings, 275202407 edges, 163148 markings/sec, 355 secs
lola: 82370542 markings, 278545264 edges, 169088 markings/sec, 360 secs
lola: 83199868 markings, 281860727 edges, 165865 markings/sec, 365 secs
lola: 84035667 markings, 285199141 edges, 167160 markings/sec, 370 secs
lola: 84837953 markings, 288429782 edges, 160457 markings/sec, 375 secs
lola: 85663457 markings, 291763407 edges, 165101 markings/sec, 380 secs
lola: 86419725 markings, 294861267 edges, 151254 markings/sec, 385 secs
lola: 87205582 markings, 298020384 edges, 157171 markings/sec, 390 secs
lola: 87995812 markings, 301224512 edges, 158046 markings/sec, 395 secs
lola: 88736560 markings, 304243910 edges, 148150 markings/sec, 400 secs
lola: 89499263 markings, 307347254 edges, 152541 markings/sec, 405 secs
lola: 90274405 markings, 310492816 edges, 155028 markings/sec, 410 secs
lola: 91029721 markings, 313621021 edges, 151063 markings/sec, 415 secs
lola: 91845162 markings, 316877517 edges, 163088 markings/sec, 420 secs
lola: 92570258 markings, 319871966 edges, 145019 markings/sec, 425 secs
lola: 93308555 markings, 322973152 edges, 147659 markings/sec, 430 secs
lola: 94220469 markings, 326304158 edges, 182383 markings/sec, 435 secs
lola: 95161674 markings, 329436448 edges, 188241 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: 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 stdout -----
----- Kill lola and sara stderr -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-30"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="irma4mcc-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 irma4mcc-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 r174-smll-152708744900213"
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 ;