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)
.................
=====================================================================
Generated by BenchKit 2-3253
Executing tool lola
Input is S_TCPcondis-PT-35, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-ebro-149443464100228
=====================================================================

--------------------
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-35-CTLCardinality-0
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-1
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-10
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-11
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-12
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-13
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-14
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-15
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-2
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-3
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-4
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-5
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-6
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-7
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-8
FORMULA_NAME TCPcondis-PT-35-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1496565786781


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


checking for too many tokens
===========================================================================================
S_TCPcondis-PT-35: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_TCPcondis-PT-35 @ 3539 seconds
----- Start make result stdout -----
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-35-CTLCardinality.task
lola: A (G (A (F ((CLOSED <= 0))))) : (NOT((E (G ((xTIMEWAIT <= xSYNACK))) AND ((SYNACK <= 0) AND (SYNSENT <= 0)))) AND (LISTEN <= ESTAB)) : E (X (NOT(A (F ((1 <= SYNSENT)))))) : E (G ((ESTAB <= LASTACK))) : A (F (NOT(E (F ((1 <= xESTAB)))))) : A (F ((((SYNACK + 1 <= LISTEN) OR (xFINACK + 1 <= xTIMEWAIT)) AND (SYNACK <= xESTAB)))) : E (G (A (((xFINACK <= xCLOSED) U (1 <= SYNRCVD))))) : (A ((((xFINWAIT1 <= CLOSEWAIT) AND (CLOSED <= LISTEN)) U (2 <= xFIN))) OR A (G (E (G ((xSYNSENT <= xCLOSED)))))) : E (((xCLOSING + 1 <= ESTAB) U E (G ((xFINACK <= xFINWAIT1))))) : E (G ((((xCLOSED <= SYN) AND (3 <= ESTAB)) OR E (F ((3 <= TIMEWAIT)))))) : (A (X ((3 <= FINWAIT2))) OR A (G ((TIMEWAIT <= SYNSENT)))) : E (F ((((xCLOSED <= 2) OR (xCLOSED <= 0)) AND (xCLOSED <= xFINACK)))) : E (G ((A (F ((SYNSENT <= xLASTACK))) OR (3 <= CLOSED)))) : (((LISTEN <= 2) AND (xLASTACK + 1 <= xLISTEN)) OR NOT(E (((ESTAB <= xSYNACK) U (1 <= LASTACK))))) : A (F (((xCLOSED <= xFIN) AND (xFIN <= TIMEWAIT)))) : E ((((SYNRCVD <= xSYNACK) OR (xCLOSEWAIT <= xCLOSED) OR (SYNRCVD <= 2)) U E (G ((xFIN <= xCLOSEWAIT)))))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (A (F ((CLOSED <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U NOT(A(TRUE U (CLOSED <= 0)))))
lola: processed formula length: 43
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (NOT((E (G ((xTIMEWAIT <= xSYNACK))) AND ((SYNACK <= 0) AND (SYNSENT <= 0)))) AND (LISTEN <= ESTAB))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((xSYNACK + 1 <= xTIMEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (xSYNACK + 1 <= xTIMEWAIT))
lola: processed formula length: 36
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: lola: ================================================================================

lola: ...considering subproblem: ((1 <= SYNACK) OR (1 <= SYNSENT))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= SYNACK) OR (1 <= SYNSENT))
lola: processed formula length: 34
lola: 5 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: processed formula with 2 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: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (X (NOT(A (F ((1 <= SYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: EX(NOT(A(TRUE U (1 <= SYNSENT))))
lola: processed formula length: 33
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-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: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((ESTAB <= LASTACK)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (LASTACK + 1 <= ESTAB)))
lola: processed formula length: 37
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-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: 931839 markings, 3944706 edges, 3225857164732006400 markings/sec, 0 secs
lola: 1705973 markings, 7521464 edges, 154827 markings/sec, 5 secs
lola: 2435214 markings, 11004517 edges, 145848 markings/sec, 10 secs
lola: 3170378 markings, 14469272 edges, 147033 markings/sec, 15 secs
lola: 3880266 markings, 17891079 edges, 141978 markings/sec, 20 secs
lola: 4548731 markings, 21144801 edges, 133693 markings/sec, 25 secs
lola: 5218931 markings, 24416809 edges, 134040 markings/sec, 30 secs
lola: 5877396 markings, 27700417 edges, 131693 markings/sec, 35 secs
lola: 6530635 markings, 30919896 edges, 130648 markings/sec, 40 secs
lola: 7188635 markings, 34140859 edges, 131600 markings/sec, 45 secs
lola: 7844304 markings, 37353784 edges, 131134 markings/sec, 50 secs
lola: 8498652 markings, 40577348 edges, 130870 markings/sec, 55 secs
lola: 9123642 markings, 43742210 edges, 124998 markings/sec, 60 secs
lola: 9758332 markings, 46881707 edges, 126938 markings/sec, 65 secs
lola: 10402100 markings, 50063465 edges, 128754 markings/sec, 70 secs
lola: 11049380 markings, 53264363 edges, 129456 markings/sec, 75 secs
lola: 11695365 markings, 56476188 edges, 129197 markings/sec, 80 secs
lola: 12337806 markings, 59676114 edges, 128488 markings/sec, 85 secs
lola: 12973388 markings, 62854064 edges, 127116 markings/sec, 90 secs
lola: 13610610 markings, 66031016 edges, 127444 markings/sec, 95 secs
lola: 14260449 markings, 69255752 edges, 129968 markings/sec, 100 secs
lola: 14909511 markings, 72490004 edges, 129812 markings/sec, 105 secs
lola: 15593963 markings, 75876710 edges, 136890 markings/sec, 110 secs
lola: 16309241 markings, 79396265 edges, 143056 markings/sec, 115 secs
lola: 17009782 markings, 82742074 edges, 140108 markings/sec, 120 secs
lola: 17552067 markings, 85633911 edges, 108457 markings/sec, 125 secs
lola: 18060010 markings, 88471473 edges, 101589 markings/sec, 130 secs
lola: 18565545 markings, 91275684 edges, 101107 markings/sec, 135 secs
lola: 19055238 markings, 94088318 edges, 97939 markings/sec, 140 secs
lola: 19544355 markings, 96895780 edges, 97823 markings/sec, 145 secs
lola: 20040279 markings, 99717332 edges, 99185 markings/sec, 150 secs
lola: 20534914 markings, 102537423 edges, 98927 markings/sec, 155 secs
lola: 21011625 markings, 105341174 edges, 95342 markings/sec, 160 secs
lola: 21495842 markings, 108175838 edges, 96843 markings/sec, 165 secs
lola: 21992610 markings, 111035350 edges, 99354 markings/sec, 170 secs
lola: 22457116 markings, 113855216 edges, 92901 markings/sec, 175 secs
lola: 22948063 markings, 116675236 edges, 98189 markings/sec, 180 secs
lola: 23438633 markings, 119522174 edges, 98114 markings/sec, 185 secs
lola: 23898921 markings, 122310194 edges, 92058 markings/sec, 190 secs
lola: 24389517 markings, 125152840 edges, 98119 markings/sec, 195 secs
lola: 24850405 markings, 127956323 edges, 92178 markings/sec, 200 secs
lola: 25318922 markings, 130666933 edges, 93703 markings/sec, 205 secs
lola: 25745036 markings, 133249341 edges, 85223 markings/sec, 210 secs
lola: 26189156 markings, 135845480 edges, 88824 markings/sec, 215 secs
lola: 26651557 markings, 138566609 edges, 92480 markings/sec, 220 secs
lola: 27111686 markings, 141348489 edges, 92026 markings/sec, 225 secs
lola: 27598217 markings, 144205104 edges, 97306 markings/sec, 230 secs
lola: 28058117 markings, 147004200 edges, 91980 markings/sec, 235 secs
lola: 28541654 markings, 149851751 edges, 96707 markings/sec, 240 secs
lola: 29028772 markings, 152733080 edges, 97424 markings/sec, 245 secs
lola: 29490514 markings, 155540118 edges, 92348 markings/sec, 250 secs
lola: 29975563 markings, 158414548 edges, 97010 markings/sec, 255 secs
lola: 30470297 markings, 161350346 edges, 98947 markings/sec, 260 secs
lola: 30977832 markings, 164371620 edges, 101507 markings/sec, 265 secs
lola: local time limit reached - aborting
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 271 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (NOT(E (F ((1 <= xESTAB))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U NOT(E(TRUE U (1 <= xESTAB))))
lola: processed formula length: 38
lola: 6 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((((SYNACK + 1 <= LISTEN) OR (xFINACK + 1 <= xTIMEWAIT)) AND (SYNACK <= xESTAB))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (((SYNACK + 1 <= LISTEN) OR (xFINACK + 1 <= xTIMEWAIT)) AND (SYNACK <= xESTAB)))
lola: processed formula length: 90
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (A (((xFINACK <= xCLOSED) U (1 <= SYNRCVD)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U NOT(A((xFINACK <= xCLOSED) U (1 <= SYNRCVD)))))
lola: processed formula length: 60
lola: 2 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A ((((xFINWAIT1 <= CLOSEWAIT) AND (CLOSED <= LISTEN)) U (2 <= xFIN))) OR A (G (E (G ((xSYNSENT <= xCLOSED))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((((xFINWAIT1 <= CLOSEWAIT) AND (CLOSED <= LISTEN)) U (2 <= xFIN)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(((xFINWAIT1 <= CLOSEWAIT) AND (CLOSED <= LISTEN)) U (2 <= xFIN))
lola: processed formula length: 66
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (E (G ((xSYNSENT <= xCLOSED)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E(TRUE U A(TRUE U (xCLOSED + 1 <= xSYNSENT))))
lola: processed formula length: 50
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 407 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (((xCLOSING + 1 <= ESTAB) U E (G ((xFINACK <= xFINWAIT1)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E((xCLOSING + 1 <= ESTAB) U NOT(A(TRUE U (xFINWAIT1 + 1 <= xFINACK))))
lola: processed formula length: 70
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((xCLOSED <= SYN) AND (3 <= ESTAB)) OR E (F ((3 <= TIMEWAIT))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((SYN + 1 <= xCLOSED) OR (ESTAB <= 2)) AND NOT(E(TRUE U (3 <= TIMEWAIT))))))
lola: processed formula length: 91
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (A (X ((3 <= FINWAIT2))) OR A (G ((TIMEWAIT <= SYNSENT))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 10 will run for 543 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((3 <= FINWAIT2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((3 <= FINWAIT2))
lola: processed formula length: 19
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-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 0 significant temporal operators and needs 0 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: ========================================
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G ((TIMEWAIT <= SYNSENT)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 11 will run for 652 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F ((((xCLOSED <= 2) OR (xCLOSED <= 0)) AND (xCLOSED <= xFINACK))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: lola: The predicate is reachable.
========================================
lola: ========================================
lola: subprocess 12 will run for 815 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((A (F ((SYNSENT <= xLASTACK))) OR (3 <= CLOSED))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (NOT(A(TRUE U (SYNSENT <= xLASTACK))) AND (CLOSED <= 2))))
lola: processed formula length: 71
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1087 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((LISTEN <= 2) AND (xLASTACK + 1 <= xLISTEN)) OR NOT(E (((ESTAB <= xSYNACK) U (1 <= LASTACK)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1087 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((LISTEN <= 2) AND (xLASTACK + 1 <= xLISTEN))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((LISTEN <= 2) AND (xLASTACK + 1 <= xLISTEN))
lola: processed formula length: 45
lola: 4 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: processed formula with 2 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: ========================================
lola: subprocess 14 will run for 1631 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((xSYNACK + 1 <= ESTAB) R (LASTACK <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(E((ESTAB <= xSYNACK) U (1 <= LASTACK)))
lola: processed formula length: 43
lola: 7 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1631 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (((xCLOSED <= xFIN) AND (xFIN <= TIMEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U ((xCLOSED <= xFIN) AND (xFIN <= TIMEWAIT)))
lola: processed formula length: 52
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3263 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((((SYNRCVD <= xSYNACK) OR (xCLOSEWAIT <= xCLOSED) OR (SYNRCVD <= 2)) U E (G ((xFIN <= xCLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(((SYNRCVD <= xSYNACK) OR (xCLOSEWAIT <= xCLOSED) OR (SYNRCVD <= 2)) U NOT(A(TRUE U (xCLOSEWAIT + 1 <= xFIN))))
lola: processed formula length: 114
lola: 3 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-35-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 84 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: RESULT
lola:
SUMMARY: no no yes unknown no no no no yes yes no yes yes no no yes
lola: ========================================
FORMULA TCPcondis-PT-35-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-35-CTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496566063321

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- 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="S_TCPcondis-PT-35"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/S_TCPcondis-PT-35.tgz
mv S_TCPcondis-PT-35 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool lola"
echo " Input is S_TCPcondis-PT-35, 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 r158-ebro-149443464100228"
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 ;