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

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


BK_STOP 1527159973927

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

Prefix is 75f5f979.
Reading known information in /usr/share/mcc4mcc/75f5f979-known.json.
Reading learned information in /usr/share/mcc4mcc/75f5f979-learned.json.
Reading value translations in /usr/share/mcc4mcc/75f5f979-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using TCPcondis-PT-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': 'itstools'}].
CTLCardinality lola TCPcondis-PT-25...

Time: 3600 - MCC
----- Start make prepare stdout -----
----- Start make prepare stderr -----
===========================================================================================
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 @ 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-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 236 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 295 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: 1487621 markings, 5010679 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: 933308 markings, 4034731 edges, 3096159597753270272 markings/sec, 0 secs
lola: 1676177 markings, 7421691 edges, 148574 markings/sec, 5 secs
lola: 2382467 markings, 10694538 edges, 141258 markings/sec, 10 secs
lola: 3058342 markings, 13839803 edges, 135175 markings/sec, 15 secs
lola: 3774877 markings, 17226119 edges, 143307 markings/sec, 20 secs
lola: 4475330 markings, 20562043 edges, 140091 markings/sec, 25 secs
lola: 5162132 markings, 23847452 edges, 137360 markings/sec, 30 secs
lola: 5838861 markings, 27087755 edges, 135346 markings/sec, 35 secs
lola: 6503423 markings, 30297540 edges, 132912 markings/sec, 40 secs
lola: 7164240 markings, 33494932 edges, 132163 markings/sec, 45 secs
lola: 7811083 markings, 36633686 edges, 129369 markings/sec, 50 secs
lola: 8452659 markings, 39748956 edges, 128315 markings/sec, 55 secs
lola: 9088572 markings, 42848898 edges, 127183 markings/sec, 60 secs
lola: 9712480 markings, 45910364 edges, 124782 markings/sec, 65 secs
lola: 10334880 markings, 48956405 edges, 124480 markings/sec, 70 secs
lola: 10957523 markings, 52008136 edges, 124529 markings/sec, 75 secs
lola: 11525348 markings, 54796294 edges, 113565 markings/sec, 80 secs
lola: 12048999 markings, 57389594 edges, 104730 markings/sec, 85 secs
lola: 12577248 markings, 60002348 edges, 105650 markings/sec, 90 secs
lola: 13102482 markings, 62605018 edges, 105047 markings/sec, 95 secs
lola: 13622446 markings, 65186104 edges, 103993 markings/sec, 100 secs
lola: 14147485 markings, 67785676 edges, 105008 markings/sec, 105 secs
lola: 14669355 markings, 70361608 edges, 104374 markings/sec, 110 secs
lola: 15187255 markings, 72942674 edges, 103580 markings/sec, 115 secs
lola: 15705134 markings, 75520855 edges, 103576 markings/sec, 120 secs
lola: 16225033 markings, 78095187 edges, 103980 markings/sec, 125 secs
lola: 16743628 markings, 80659223 edges, 103719 markings/sec, 130 secs
lola: 17254496 markings, 83210003 edges, 102174 markings/sec, 135 secs
lola: 17761436 markings, 85761394 edges, 101388 markings/sec, 140 secs
lola: 18265486 markings, 88286653 edges, 100810 markings/sec, 145 secs
lola: 18777698 markings, 90833334 edges, 102442 markings/sec, 150 secs
lola: 19283751 markings, 93375082 edges, 101211 markings/sec, 155 secs
lola: 19791723 markings, 95918059 edges, 101594 markings/sec, 160 secs
lola: 20290354 markings, 98426737 edges, 99726 markings/sec, 165 secs
lola: 20795562 markings, 100955929 edges, 101042 markings/sec, 170 secs
lola: 21299270 markings, 103482614 edges, 100742 markings/sec, 175 secs
lola: 21799116 markings, 106004678 edges, 99969 markings/sec, 180 secs
lola: 22300845 markings, 108546223 edges, 100346 markings/sec, 185 secs
lola: 22800274 markings, 111065159 edges, 99886 markings/sec, 190 secs
lola: 23296088 markings, 113582493 edges, 99163 markings/sec, 195 secs
lola: 23819482 markings, 116241532 edges, 104679 markings/sec, 200 secs
lola: 24352313 markings, 118922223 edges, 106566 markings/sec, 205 secs
lola: 24886226 markings, 121613560 edges, 106783 markings/sec, 210 secs
lola: 25416922 markings, 124293065 edges, 106139 markings/sec, 215 secs
lola: 25944064 markings, 126960601 edges, 105428 markings/sec, 220 secs
lola: 26479739 markings, 129651618 edges, 107135 markings/sec, 225 secs
lola: 27010168 markings, 132335837 edges, 106086 markings/sec, 230 secs
lola: 27540616 markings, 135022234 edges, 106090 markings/sec, 235 secs
lola: 28067627 markings, 137688728 edges, 105402 markings/sec, 240 secs
lola: 28599555 markings, 140372331 edges, 106386 markings/sec, 245 secs
lola: 29117345 markings, 143031722 edges, 103558 markings/sec, 250 secs
lola: 29641267 markings, 145697052 edges, 104784 markings/sec, 255 secs
lola: 30168053 markings, 148362946 edges, 105357 markings/sec, 260 secs
lola: 30688948 markings, 151021451 edges, 104179 markings/sec, 265 secs
lola: 31213571 markings, 153680985 edges, 104925 markings/sec, 270 secs
lola: 31737177 markings, 156338635 edges, 104721 markings/sec, 275 secs
lola: 32259638 markings, 158990969 edges, 104492 markings/sec, 280 secs
lola: 32780714 markings, 161639409 edges, 104215 markings/sec, 285 secs
lola: 33296530 markings, 164270789 edges, 103163 markings/sec, 290 secs
lola: 33809102 markings, 166898877 edges, 102514 markings/sec, 295 secs
lola: 34329273 markings, 169532924 edges, 104034 markings/sec, 300 secs
lola: 34849501 markings, 172172075 edges, 104046 markings/sec, 305 secs
lola: 35359938 markings, 174788984 edges, 102087 markings/sec, 310 secs
lola: 35880124 markings, 177423303 edges, 104037 markings/sec, 315 secs
lola: 36394682 markings, 180043954 edges, 102912 markings/sec, 320 secs
lola: 36910399 markings, 182661514 edges, 103143 markings/sec, 325 secs
lola: 37421215 markings, 185255540 edges, 102163 markings/sec, 330 secs
lola: 37932692 markings, 187864388 edges, 102295 markings/sec, 335 secs
lola: 38441012 markings, 190476346 edges, 101664 markings/sec, 340 secs
lola: 38952109 markings, 193097510 edges, 102219 markings/sec, 345 secs
lola: 39456378 markings, 195686722 edges, 100854 markings/sec, 350 secs
lola: 39961599 markings, 198283495 edges, 101044 markings/sec, 355 secs
lola: 40465108 markings, 200870095 edges, 100702 markings/sec, 360 secs
lola: 40974429 markings, 203466384 edges, 101864 markings/sec, 365 secs
lola: 41483300 markings, 206064177 edges, 101774 markings/sec, 370 secs
lola: 41986757 markings, 208644423 edges, 100691 markings/sec, 375 secs
lola: 42490475 markings, 211221242 edges, 100744 markings/sec, 380 secs
lola: 42987368 markings, 213777932 edges, 99379 markings/sec, 385 secs
lola: 43488681 markings, 216350375 edges, 100263 markings/sec, 390 secs
lola: 43989964 markings, 218930918 edges, 100257 markings/sec, 395 secs
lola: 44492079 markings, 221531882 edges, 100423 markings/sec, 400 secs
lola: 44993887 markings, 224105819 edges, 100362 markings/sec, 405 secs
lola: 45488325 markings, 226672181 edges, 98888 markings/sec, 410 secs
lola: 45981921 markings, 229230740 edges, 98719 markings/sec, 415 secs
lola: 46483394 markings, 231799091 edges, 100295 markings/sec, 420 secs
lola: 46980449 markings, 234350220 edges, 99411 markings/sec, 425 secs
lola: 47482241 markings, 236924384 edges, 100358 markings/sec, 430 secs
lola: 47987667 markings, 239492563 edges, 101085 markings/sec, 435 secs
lola: 48482744 markings, 242042779 edges, 99015 markings/sec, 440 secs
lola: 48970515 markings, 244581990 edges, 97554 markings/sec, 445 secs
lola: 49459609 markings, 247116659 edges, 97819 markings/sec, 450 secs
lola: 49953273 markings, 249669969 edges, 98733 markings/sec, 455 secs
lola: 50446473 markings, 252209607 edges, 98640 markings/sec, 460 secs
lola: 50938596 markings, 254756765 edges, 98425 markings/sec, 465 secs
lola: 51436462 markings, 257312950 edges, 99573 markings/sec, 470 secs
lola: 51925659 markings, 259842343 edges, 97839 markings/sec, 475 secs
lola: 52419947 markings, 262375107 edges, 98858 markings/sec, 480 secs
lola: 52908021 markings, 264910288 edges, 97615 markings/sec, 485 secs
lola: 53396999 markings, 267440131 edges, 97796 markings/sec, 490 secs
lola: 53885194 markings, 269957890 edges, 97639 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 505 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 505 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 606 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 606 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: ========================================
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: subprocess 13 will run for 1010 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: subprocess 13 will run for 1010 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 1515 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
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1515 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 1515 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 3030 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 3030 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 3030 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-structural"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-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-structural"
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 r175-smll-152708746300206"
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 ;