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 184K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K 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.2K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K 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.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K 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-25, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-smll-152708744900206
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527158599111


BK_STOP 1527159156814

--------------------
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-25 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': 383, 'Memory': 106.08, 'Tool': 'lola'}, {'Time': 574, 'Memory': 105.8, 'Tool': 'lola'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
CTLCardinality lola TCPcondis-PT-25...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
TCPcondis-PT-25: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
CTLCardinality @ TCPcondis-PT-25 @ 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-25-CTLCardinality.task
lola: A (X (A (F (((xCLOSED <= ESTAB) AND (ESTAB <= LISTEN)))))) : A ((E (F ((2 <= CLOSED))) U A (G ((xFIN <= xSYNACK))))) : ((xFIN <= 0) AND NOT(E (G ((TIMEWAIT <= ESTAB))))) : NOT(NOT(NOT(E (G ((FINWAIT1 <= xSYNSENT)))))) : A (F ((A (X ((CLOSED <= xCLOSEWAIT))) OR ((xCLOSED <= TIMEWAIT) OR (1 <= xSYNACK) OR (3 <= xFIN))))) : A (F ((A (X ((2 <= ESTAB))) AND A (G ((FINWAIT1 <= xSYNRCVD)))))) : (NOT(A (F ((3 <= LASTACK)))) AND ((A (F ((xCLOSED <= xCLOSEWAIT))) OR (((xESTAB <= SYNACK) AND (LISTEN <= xFINWAIT2)) OR (1 <= CLOSED))) OR ((xFINWAIT2 <= xTIMEWAIT) OR (1 <= CLOSEWAIT)))) : (A (F (A (G ((FINWAIT2 <= FINWAIT1))))) OR A (F (A (G ((2 <= SYNACK)))))) : NOT((E (G ((xCLOSEWAIT <= 1))) OR (ESTAB + 1 <= xCLOSING))) : E (F (A (G (((1 <= xSYNSENT) AND (FINACK <= xTIMEWAIT)))))) : ((((3 <= xSYNSENT) AND (FIN <= 0)) OR ((xFINWAIT1 <= xSYNACK) AND (FINACK <= SYNRCVD))) AND A (F (E (X ((1 <= xSYNACK)))))) : NOT(E (F (((CLOSED <= xFINWAIT2) AND (xSYN <= xLISTEN) AND (1 <= xFINWAIT1))))) : A (F ((((CLOSING <= CLOSED) AND (2 <= xSYNACK) AND ((2 <= LISTEN) OR (2 <= SYN))) AND E (X ((1 <= xSYNSENT)))))) : (A (F (A (F ((3 <= FINWAIT1))))) OR A (G (((1 <= SYNRCVD) OR ((1 <= LISTEN) AND (1 <= SYNACK)))))) : ((1 <= FINACK) OR A (F (E (X ((3 <= xCLOSEWAIT)))))) : (E (F (A (X ((1 <= xCLOSED))))) AND NOT(E (G (((xFIN <= CLOSING) AND (xCLOSEWAIT <= xCLOSED))))))
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 (X (A (F (((xCLOSED <= ESTAB) AND (ESTAB <= LISTEN))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX(A(TRUE U ((xCLOSED <= ESTAB) AND (ESTAB <= LISTEN))))
lola: processed formula length: 56
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: Formula contains EX or AX operators, stubborn sets not applicable
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: 377 markings, 377 edges
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((E (F ((2 <= CLOSED))) U A (G ((xFIN <= xSYNACK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(E(TRUE U (2 <= CLOSED)) U NOT(E(TRUE U (xSYNACK + 1 <= xFIN))))
lola: processed formula length: 65
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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 3 significant temporal operators and needs 13 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: 725 markings, 1943 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((xFIN <= 0) AND NOT(E (G ((TIMEWAIT <= ESTAB)))))
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: (xFIN <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (xFIN <= 0)
lola: processed formula length: 11
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((ESTAB + 1 <= TIMEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((ESTAB + 1 <= TIMEWAIT)))
lola: processed formula: A (F ((ESTAB + 1 <= TIMEWAIT)))
lola: processed formula length: 31
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 255 markings, 261 edges
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: NOT(NOT(NOT(E (G ((FINWAIT1 <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((xSYNSENT + 1 <= FINWAIT1)))
lola: processed formula: A (F ((xSYNSENT + 1 <= FINWAIT1)))
lola: processed formula length: 34
lola: 9 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 235 markings, 235 edges
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((CLOSED <= xCLOSEWAIT))) OR ((xCLOSED <= TIMEWAIT) OR (1 <= xSYNACK) OR (3 <= xFIN)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((CLOSED <= xCLOSEWAIT)) OR ((xCLOSED <= TIMEWAIT) OR (1 <= xSYNACK) OR (3 <= xFIN))))
lola: processed formula length: 100
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: 1321456 markings, 4426693 edges, 3689348869717491712 markings/sec, 0 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1773565 markings, 6011930 edges
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((A (X ((2 <= ESTAB))) AND A (G ((FINWAIT1 <= xSYNRCVD))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (AX((2 <= ESTAB)) AND NOT(E(TRUE U (xSYNRCVD + 1 <= FINWAIT1)))))
lola: processed formula length: 74
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: Formula contains EX or AX operators, stubborn sets not applicable
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: 258 markings, 258 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT(A (F ((3 <= LASTACK)))) AND ((A (F ((xCLOSED <= xCLOSEWAIT))) OR (((xESTAB <= SYNACK) AND (LISTEN <= xFINWAIT2)) OR (1 <= CLOSED))) OR ((xFINWAIT2 <= xTIMEWAIT) OR (1 <= CLOSEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((LASTACK <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (3 <= LASTACK)))
lola: processed formula length: 29
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 258 markings, 258 edges
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((xCLOSED <= xCLOSEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((xCLOSED <= xCLOSEWAIT)))
lola: processed formula: A (F ((xCLOSED <= xCLOSEWAIT)))
lola: processed formula length: 31
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 374 markings, 374 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((xESTAB <= SYNACK) AND (LISTEN <= xFINWAIT2)) OR (1 <= CLOSED)) OR ((xFINWAIT2 <= xTIMEWAIT) OR (1 <= CLOSEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((((xESTAB <= SYNACK) AND (LISTEN <= xFINWAIT2)) OR (1 <= CLOSED)) OR ((xFINWAIT2 <= xTIMEWAIT) OR (1 <= CLOSEWAIT)))
lola: processed formula length: 119
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
lola: processed formula with 5 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: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((FINWAIT2 <= FINWAIT1))))) OR A (F (A (G ((2 <= SYNACK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((FINWAIT2 <= FINWAIT1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((FINWAIT2 <= FINWAIT1)))))
lola: processed formula: A (F (A (G ((FINWAIT2 <= FINWAIT1)))))
lola: processed formula length: 38
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 236 markings, 237 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((2 <= SYNACK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (A (G ((2 <= SYNACK)))))
lola: processed formula: A (F (A (G ((2 <= SYNACK)))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 95 markings, 96 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT((E (G ((xCLOSEWAIT <= 1))) OR (ESTAB + 1 <= xCLOSING)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((2 <= xCLOSEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((2 <= xCLOSEWAIT)))
lola: processed formula: A (F ((2 <= xCLOSEWAIT)))
lola: processed formula length: 25
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 90 markings, 90 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (G (((1 <= xSYNSENT) AND (FINACK <= xTIMEWAIT))))))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U NOT(E(TRUE U ((xSYNSENT <= 0) OR (xTIMEWAIT + 1 <= FINACK)))))
lola: processed formula length: 72
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 945872 markings, 4090191 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1767779 markings, 7840820 edges, 164381 markings/sec, 5 secs
lola: 2546883 markings, 11458167 edges, 155821 markings/sec, 10 secs
lola: 3304828 markings, 15000487 edges, 151589 markings/sec, 15 secs
lola: 4037528 markings, 18470243 edges, 146540 markings/sec, 20 secs
lola: 4753423 markings, 21888828 edges, 143179 markings/sec, 25 secs
lola: 5427443 markings, 25116914 edges, 134804 markings/sec, 30 secs
lola: 6059760 markings, 28151937 edges, 126463 markings/sec, 35 secs
lola: 6711914 markings, 31303340 edges, 130431 markings/sec, 40 secs
lola: 7357760 markings, 34436596 edges, 129169 markings/sec, 45 secs
lola: 7990200 markings, 37503712 edges, 126488 markings/sec, 50 secs
lola: 8616548 markings, 40553462 edges, 125270 markings/sec, 55 secs
lola: 9238853 markings, 43579489 edges, 124461 markings/sec, 60 secs
lola: 9849485 markings, 46581417 edges, 122126 markings/sec, 65 secs
lola: 10460023 markings, 49579207 edges, 122108 markings/sec, 70 secs
lola: 11071560 markings, 52567188 edges, 122307 markings/sec, 75 secs
lola: 11674449 markings, 55533679 edges, 120578 markings/sec, 80 secs
lola: 12266424 markings, 58465713 edges, 118395 markings/sec, 85 secs
lola: 12859377 markings, 61403079 edges, 118591 markings/sec, 90 secs
lola: 13444928 markings, 64308898 edges, 117110 markings/sec, 95 secs
lola: 14034507 markings, 67227075 edges, 117916 markings/sec, 100 secs
lola: 14621430 markings, 70120838 edges, 117385 markings/sec, 105 secs
lola: 15200868 markings, 73009243 edges, 115888 markings/sec, 110 secs
lola: 15782741 markings, 75900793 edges, 116375 markings/sec, 115 secs
lola: 16363095 markings, 78780420 edges, 116071 markings/sec, 120 secs
lola: 16936324 markings, 81624631 edges, 114646 markings/sec, 125 secs
lola: 17499739 markings, 84446807 edges, 112683 markings/sec, 130 secs
lola: 18064473 markings, 87277213 edges, 112947 markings/sec, 135 secs
lola: 18630214 markings, 90100010 edges, 113148 markings/sec, 140 secs
lola: 19188722 markings, 92893164 edges, 111702 markings/sec, 145 secs
lola: 19744108 markings, 95686060 edges, 111077 markings/sec, 150 secs
lola: 20296586 markings, 98460105 edges, 110496 markings/sec, 155 secs
lola: 20850277 markings, 101228658 edges, 110738 markings/sec, 160 secs
lola: 21404478 markings, 104002124 edges, 110840 markings/sec, 165 secs
lola: 21948341 markings, 106763942 edges, 108773 markings/sec, 170 secs
lola: 22494886 markings, 109518489 edges, 109309 markings/sec, 175 secs
lola: 23034456 markings, 112252055 edges, 107914 markings/sec, 180 secs
lola: 23577675 markings, 115004298 edges, 108644 markings/sec, 185 secs
lola: 24116992 markings, 117731028 edges, 107863 markings/sec, 190 secs
lola: 24659217 markings, 120475521 edges, 108445 markings/sec, 195 secs
lola: 25203377 markings, 123209477 edges, 108832 markings/sec, 200 secs
lola: 25737835 markings, 125917598 edges, 106892 markings/sec, 205 secs
lola: 26274343 markings, 128621996 edges, 107302 markings/sec, 210 secs
lola: 26812117 markings, 131331037 edges, 107555 markings/sec, 215 secs
lola: 27340857 markings, 134012045 edges, 105748 markings/sec, 220 secs
lola: 27886205 markings, 136760844 edges, 109070 markings/sec, 225 secs
lola: 28442425 markings, 139570014 edges, 111244 markings/sec, 230 secs
lola: 28983809 markings, 142345924 edges, 108277 markings/sec, 235 secs
lola: 29529208 markings, 145129616 edges, 109080 markings/sec, 240 secs
lola: 30076913 markings, 147899315 edges, 109541 markings/sec, 245 secs
lola: 30620951 markings, 150672372 edges, 108808 markings/sec, 250 secs
lola: 31164916 markings, 153436368 edges, 108793 markings/sec, 255 secs
lola: 31709040 markings, 156197785 edges, 108825 markings/sec, 260 secs
lola: 32251117 markings, 158948301 edges, 108415 markings/sec, 265 secs
lola: 32792270 markings, 161698842 edges, 108231 markings/sec, 270 secs
lola: 33325887 markings, 164427583 edges, 106723 markings/sec, 275 secs
lola: 33859242 markings, 167152231 edges, 106671 markings/sec, 280 secs
lola: 34396989 markings, 169879171 edges, 107549 markings/sec, 285 secs
lola: 34933306 markings, 172609174 edges, 107263 markings/sec, 290 secs
lola: 35463031 markings, 175321399 edges, 105945 markings/sec, 295 secs
lola: 36002122 markings, 178046222 edges, 107818 markings/sec, 300 secs
lola: 36534900 markings, 180751739 edges, 106556 markings/sec, 305 secs
lola: 37067740 markings, 183449222 edges, 106568 markings/sec, 310 secs
lola: 37593833 markings, 186139094 edges, 105219 markings/sec, 315 secs
lola: 38118203 markings, 188830441 edges, 104874 markings/sec, 320 secs
lola: 38645728 markings, 191516951 edges, 105505 markings/sec, 325 secs
lola: 39170951 markings, 194212837 edges, 105045 markings/sec, 330 secs
lola: 39688635 markings, 196878437 edges, 103537 markings/sec, 335 secs
lola: 40204832 markings, 199538614 edges, 103239 markings/sec, 340 secs
lola: 40667403 markings, 201904443 edges, 92514 markings/sec, 345 secs
lola: 41091788 markings, 204079366 edges, 84877 markings/sec, 350 secs
lola: 41533742 markings, 206319113 edges, 88391 markings/sec, 355 secs
lola: 41967850 markings, 208543963 edges, 86822 markings/sec, 360 secs
lola: 42403701 markings, 210774516 edges, 87170 markings/sec, 365 secs
lola: 42832886 markings, 212975654 edges, 85837 markings/sec, 370 secs
lola: 43263579 markings, 215190896 edges, 86139 markings/sec, 375 secs
lola: 43693364 markings, 217410434 edges, 85957 markings/sec, 380 secs
lola: 44130077 markings, 219657255 edges, 87343 markings/sec, 385 secs
lola: 44562319 markings, 221891793 edges, 86448 markings/sec, 390 secs
lola: 44996065 markings, 224117115 edges, 86749 markings/sec, 395 secs
lola: 45424470 markings, 226337428 edges, 85681 markings/sec, 400 secs
lola: 45848274 markings, 228538034 edges, 84761 markings/sec, 405 secs
lola: 46281253 markings, 230759224 edges, 86596 markings/sec, 410 secs
lola: 46708998 markings, 232971363 edges, 85549 markings/sec, 415 secs
lola: 47146338 markings, 235197207 edges, 87468 markings/sec, 420 secs
lola: 47579391 markings, 237419580 edges, 86611 markings/sec, 425 secs
lola: 48036222 markings, 239744801 edges, 91366 markings/sec, 430 secs
lola: 48513600 markings, 242201204 edges, 95476 markings/sec, 435 secs
lola: 48980179 markings, 244633595 edges, 93316 markings/sec, 440 secs
lola: 49448363 markings, 247061562 edges, 93637 markings/sec, 445 secs
lola: 49921246 markings, 249502455 edges, 94577 markings/sec, 450 secs
lola: 50392823 markings, 251941290 edges, 94315 markings/sec, 455 secs
lola: 50869744 markings, 254392444 edges, 95384 markings/sec, 460 secs
lola: 51343327 markings, 256828097 edges, 94717 markings/sec, 465 secs
lola: 51813209 markings, 259256873 edges, 93976 markings/sec, 470 secs
lola: 52236561 markings, 261435956 edges, 84670 markings/sec, 475 secs
lola: 52653294 markings, 263596576 edges, 83347 markings/sec, 480 secs
lola: 53074076 markings, 265770637 edges, 84156 markings/sec, 485 secs
lola: 53490501 markings, 267917203 edges, 83285 markings/sec, 490 secs
lola: 53907606 markings, 270075065 edges, 83421 markings/sec, 495 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 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((((3 <= xSYNSENT) AND (FIN <= 0)) OR ((xFINWAIT1 <= xSYNACK) AND (FINACK <= SYNRCVD))) AND A (F (E (X ((1 <= xSYNACK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 504 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((3 <= xSYNSENT) AND (FIN <= 0)) OR ((xFINWAIT1 <= xSYNACK) AND (FINACK <= SYNRCVD)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((3 <= xSYNSENT) AND (FIN <= 0)) OR ((xFINWAIT1 <= xSYNACK) AND (FINACK <= SYNRCVD)))
lola: processed formula length: 87
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-CTLCardinality.task
lola: processed formula with 4 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 11 will run for 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((1 <= xSYNACK)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((1 <= xSYNACK)))
lola: processed formula length: 28
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: Formula contains EX or AX operators, stubborn sets not applicable
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: 26926 markings, 61350 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 11 will run for 605 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: NOT(E (F (((CLOSED <= xFINWAIT2) AND (xSYN <= xLISTEN) AND (1 <= xFINWAIT1)))))
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 3 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 30 markings, 29 edges
lola: state equation: write sara problem file to TCPcondis-PT-25-CTLCardinality-11.sara
lola: subprocess 12 will run for 757 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((CLOSING <= CLOSED) AND (2 <= xSYNACK) AND ((2 <= LISTEN) OR (2 <= SYN))) AND E (X ((1 <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((CLOSING <= CLOSED) AND (2 <= xSYNACK) AND ((2 <= LISTEN) OR (2 <= SYN))) AND EX((1 <= xSYNSENT))))
lola: processed formula length: 111
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: Formula contains EX or AX operators, stubborn sets not applicable
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: 258 markings, 258 edges
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 13 will run for 1009 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (F (A (F ((3 <= FINWAIT1))))) OR A (G (((1 <= SYNRCVD) OR ((1 <= LISTEN) AND (1 <= SYNACK))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: subprocess 13 will run for 1009 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= FINWAIT1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= FINWAIT1)))
lola: processed formula: A (F ((3 <= FINWAIT1)))
lola: processed formula length: 23
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: 376 markings, 376 edges
lola: ========================================
lola: subprocess 14 will run for 1514 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= SYNRCVD) OR ((1 <= LISTEN) AND (1 <= SYNACK)))))
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 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 0 markings, 0 edges
sara: try reading problem file TCPcondis-PT-25-CTLCardinality-11.sara.
lola: state equation: write sara problem file to TCPcondis-PT-25-CTLCardinality-14.sara
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: sara: place or transition ordering is non-deterministic========================================

lola: subprocess 14 will run for 1514 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((1 <= FINACK) OR A (F (E (X ((3 <= xCLOSEWAIT))))))
lola: ========================================
lola: SUBTASK

lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1514 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (1 <= FINACK)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= FINACK)
lola: processed formula length: 13
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: subprocess 15 will run for 3028 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (X ((3 <= xCLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U EX((3 <= xCLOSEWAIT)))
lola: processed formula length: 31
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: Formula contains EX or AX operators, stubborn sets not applicable
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: 258 markings, 258 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 3028 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (F (A (X ((1 <= xCLOSED))))) AND NOT(E (G (((xFIN <= CLOSING) AND (xCLOSEWAIT <= xCLOSED))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3028 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (A (X ((1 <= xCLOSED)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U AX((1 <= xCLOSED)))
lola: processed formula length: 28
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-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: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: 1 markings, 0 edges
lola: ========================================
lola: 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 no no no yes no yes no no unknown yes no no no no unknown
FORMULA TCPcondis-PT-25-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-9 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-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-25"
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-25.tgz
mv TCPcondis-PT-25 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-25, 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-152708744900206"
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 ;