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 200K
-rw-r--r-- 1 mcc users 4.4K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K 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 8.9K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.6K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K 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.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K 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 lola
Input is TCPcondis-PT-40, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r172-smll-152708743100227
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1527265190075

info: Time: 3600 - MCC
===========================================================================================
prep: translating TCPcondis-PT-40 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TCPcondis-PT-40 formula CTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking CTLCardinality @ TCPcondis-PT-40 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 960
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-40-CTLCardinality.task
lola: always true
lola: always true
lola: E (F (((CLOSED <= xTIMEWAIT) AND ((xCLOSED <= xESTAB) OR ((2 <= xSYNSENT)))))) : E (((xFINWAIT1 + 1 <= xFINWAIT2) U A (F ((1 <= xSYNRCVD))))) : A (X (E (G (((FINWAIT2 <= CLOSED) AND (SYNACK <= ESTAB)))))) : (E (X (E (F ((3 <= CLOSING))))) AND E ((((LISTEN <= SYNACK) OR (1 <= xTIMEWAIT)) U ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED))))) : E (G (E (G ((xSYNRCVD <= 2))))) : A (F ((E (X ((xCLOSING <= LASTACK))) AND E (F ((3 <= xFIN)))))) : (E (F (E (G ((3 <= CLOSING))))) OR (((xSYNSENT <= 1) OR (xCLOSING + 1 <= SYNACK) OR (LISTEN <= 0)) AND A (G ((CLOSEWAIT <= 2))))) : A (G (((xSYNSENT + 1 <= xSYNACK) OR (xSYNRCVD + 1 <= FIN) OR (xESTAB <= 2) OR (xFIN <= 0)))) : ((E (F ((2 <= xCLOSING))) AND ((1 <= LASTACK) OR (TIMEWAIT + 1 <= LISTEN) OR (LASTACK <= xFIN))) AND (E (X ((2 <= xFIN))) OR E (F (((xLISTEN <= xESTAB) AND (2 <= LISTEN)))))) : E (G (((xFIN <= LASTACK) OR ((3 <= LASTACK) AND (xSYNACK <= xSYNRCVD)) OR ((FINACK <= xCLOSEWAIT) AND (xCLOSED <= xLASTACK) AND (xLASTACK <= xCLOSEWAIT))))) : A (X ((A (F ((3 <= FIN))) OR A (G ((3 <= xCLOSING)))))) : (A (G ((((CLOSING <= FINWAIT2) OR (3 <= xCLOSED)) AND ((1 <= CLOSED) OR (3 <= SYN))))) AND NOT((A (X ((1 <= xSYNSENT))) OR ((1 <= xFINACK) AND (xFINWAIT2 <= FINWAIT1) AND (SYNSENT + 1 <= SYN))))) : (E (((xFINACK <= FINWAIT1) U (xESTAB <= LASTACK))) AND E (F (((3 <= xCLOSEWAIT) OR (2 <= xFINACK))))) : E (((((FINWAIT2 <= xCLOSING) AND (2 <= CLOSING)) OR (TIMEWAIT + 1 <= LISTEN)) U E (G ((xCLOSEWAIT <= SYN))))) : A ((((xLASTACK <= LISTEN) AND (xLASTACK <= xSYN) AND ((3 <= FIN) OR (SYNRCVD <= CLOSING))) U (1 <= SYNACK))) : (A (F (A (G ((LISTEN <= SYNSENT))))) OR E (G ((3 <= ESTAB))))
lola: rewrite Frontend/Parser/formula_rewrite.k:461
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:323
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (E (G (((FINWAIT2 <= CLOSED) AND (SYNACK <= ESTAB))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX(NOT(A(TRUE U ((CLOSED + 1 <= FINWAIT2) OR (ESTAB + 1 <= SYNACK)))))
lola: processed formula length: 71
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 1027 markings, 1030 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (X (E (F ((3 <= CLOSING))))) AND E ((((LISTEN <= SYNACK) OR (1 <= xTIMEWAIT)) U ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E ((((LISTEN <= SYNACK) OR (1 <= xTIMEWAIT)) U ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED))))
lola: ========================================
lola: SUBTASK
lola: checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E ((((LISTEN <= SYNACK) OR (1 <= xTIMEWAIT)) U ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED))))
lola: processed formula length: 93
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: formula 0: ((xSYN <= xCLOSED) OR (LASTACK <= CLOSED))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: ========================================
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (X (E (F ((3 <= CLOSING)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability from a successor
lola: rewrite Frontend/Parser/formula_rewrite.k:626
lola: processed formula: (3 <= CLOSING)
lola: processed formula length: 14
lola: 8 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EXEF)
lola: state space: using reachability graph (EXef version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EXEF
lola: The predicate is reachable from some successor.
lola: 28 markings, 27 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((E (X ((xCLOSING <= LASTACK))) AND E (F ((3 <= xFIN))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:719
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: processed formula: A(TRUE U (EX((xCLOSING <= LASTACK)) AND E(TRUE U (3 <= xFIN))))
lola: processed formula length: 63
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 176 markings, 176 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F ((2 <= xCLOSING))) AND (((1 <= LASTACK) OR (TIMEWAIT + 1 <= LISTEN) OR (LASTACK <= xFIN)) AND (E (X ((2 <= xFIN))) OR E (F (((xLISTEN <= xESTAB) AND (2 <= LISTEN)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((1 <= LASTACK) OR (TIMEWAIT + 1 <= LISTEN) OR (LASTACK <= xFIN))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((1 <= LASTACK) OR (TIMEWAIT + 1 <= LISTEN) OR (LASTACK <= xFIN))
lola: processed formula length: 67
lola: 7 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: processed formula with 3 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 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((2 <= xCLOSING)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((2 <= xCLOSING)))
lola: processed formula length: 23
lola: 8 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 18 markings, 17 edges
lola: formula 0: (2 <= xCLOSING)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((xLISTEN <= xESTAB) AND (2 <= LISTEN))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((xLISTEN <= xESTAB) AND (2 <= LISTEN))))
lola: processed formula length: 47
lola: 8 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 3 markings, 2 edges
lola: formula 0: ((xLISTEN <= xESTAB) AND (2 <= LISTEN))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-5-0.sara
lola: lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((A (F ((3 <= FIN))) OR A (G ((3 <= xCLOSING))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:737
lola: rewrite Frontend/Parser/formula_rewrite.k:734
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: AX((A(TRUE U (3 <= FIN)) OR NOT(E(TRUE U (xCLOSING <= 2)))))
lola: processed formula length: 60
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 407 markings, 408 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((((CLOSING <= FINWAIT2) OR (3 <= xCLOSED)) AND ((1 <= CLOSED) OR (3 <= SYN))))) AND (E (X ((xSYNSENT <= 0))) AND ((xFINACK <= 0) OR (FINWAIT1 + 1 <= xFINWAIT2) OR (SYN <= SYNSENT))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((xFINACK <= 0) OR (FINWAIT1 + 1 <= xFINWAIT2) OR (SYN <= SYNSENT))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((xFINACK <= 0) OR (FINWAIT1 + 1 <= xFINWAIT2) OR (SYN <= SYNSENT))
lola: processed formula length: 69
lola: 7 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: processed formula with 3 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((CLOSING <= FINWAIT2) OR (3 <= xCLOSED)) AND ((1 <= CLOSED) OR (3 <= SYN)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((CLOSING <= FINWAIT2) OR (3 <= xCLOSED)) AND ((1 <= CLOSED) OR (3 <= SYN)))))
lola: processed formula length: 87
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((FINWAIT2 + 1 <= CLOSING) AND (xCLOSED <= 2)) OR ((CLOSED <= 0) AND (SYN <= 2)))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-6-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 41 markings, 40 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 357 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((CLOSED <= xTIMEWAIT) AND ((xCLOSED <= xESTAB) OR ((2 <= xSYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((CLOSED <= xTIMEWAIT) AND ((xCLOSED <= xESTAB) OR ((2 <= xSYNSENT))))))
lola: processed formula length: 79
lola: 8 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((CLOSED <= xTIMEWAIT) AND ((xCLOSED <= xESTAB) OR ((2 <= xSYNSENT))))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 43 markings, 42 edges
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-6-0.sara
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-0 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((xSYNSENT + 1 <= xSYNACK) OR (xSYNRCVD + 1 <= FIN) OR (xESTAB <= 2) OR (xFIN <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((xSYNSENT + 1 <= xSYNACK) OR (xSYNRCVD + 1 <= FIN) OR (xESTAB <= 2) OR (xFIN <= 0))))
lola: processed formula length: 95
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((xSYNACK <= xSYNSENT) AND (FIN <= xSYNRCVD) AND (3 <= xESTAB) AND (1 <= xFIN))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-7-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((xSYNRCVD <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((xSYNRCVD <= 2)))
lola: processed formula length: 23
lola: 7 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 650 markings, 650 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 510 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G (((xFIN <= LASTACK) OR ((3 <= LASTACK) AND (xSYNACK <= xSYNRCVD)) OR ((FINACK <= xCLOSEWAIT) AND (xCLOSED <= xLASTACK) AND (xLASTACK <= xCLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G (((xFIN <= LASTACK) OR ((3 <= LASTACK) AND (xSYNACK <= xSYNRCVD)) OR ((FINACK <= xCLOSEWAIT) AND (xCLOSED <= xLASTACK) AND (xLASTACK <= xCLOSEWAIT)))))
lola: processed formula length: 158
lola: 7 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate is possibly preserved.
lola: 869 markings, 870 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 595 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((xFINWAIT1 + 1 <= xFINWAIT2) U A (F ((1 <= xSYNRCVD)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:732
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: processed formula: E((xFINWAIT1 + 1 <= xFINWAIT2) U A(TRUE U (1 <= xSYNRCVD)))
lola: processed formula length: 59
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 564 markings, 565 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 714 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((((FINWAIT2 <= xCLOSING) AND (2 <= CLOSING)) OR (TIMEWAIT + 1 <= LISTEN)) U E (G ((xCLOSEWAIT <= SYN)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: rewrite Frontend/Parser/formula_rewrite.k:724
lola: rewrite Frontend/Parser/formula_rewrite.k:726
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: processed formula: E((((FINWAIT2 <= xCLOSING) AND (2 <= CLOSING)) OR (TIMEWAIT + 1 <= LISTEN)) U NOT(A(TRUE U (SYN + 1 <= xCLOSEWAIT))))
lola: processed formula length: 118
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 408 markings, 409 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((xLASTACK <= LISTEN) AND (xLASTACK <= xSYN) AND ((3 <= FIN) OR (SYNRCVD <= CLOSING))) U (1 <= SYNACK)))
lola: ========================================
lola: SUBTASK
lola: checking universal until
lola: rewrite Frontend/Parser/formula_rewrite.k:645
lola: rewrite Frontend/Parser/formula_rewrite.k:609
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A ((((xLASTACK <= LISTEN) AND (xLASTACK <= xSYN) AND ((3 <= FIN) OR (SYNRCVD <= CLOSING))) U (1 <= SYNACK)))
lola: processed formula length: 109
lola: 11 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /ER)
lola: state space: using reachability graph (ER version) (--search=depth)
lola: state space: using ltl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: 806335 markings, 5337467 edges, 161267 markings/sec, 0 secs
lola: 1541571 markings, 10922183 edges, 147047 markings/sec, 5 secs
lola: 2265512 markings, 16420717 edges, 144788 markings/sec, 10 secs
lola: 2981357 markings, 21859207 edges, 143169 markings/sec, 15 secs
lola: 3705557 markings, 27336098 edges, 144840 markings/sec, 20 secs
lola: 4371608 markings, 32368739 edges, 133210 markings/sec, 25 secs
lola: 5096030 markings, 37827154 edges, 144884 markings/sec, 30 secs
lola: 5837371 markings, 43395588 edges, 148268 markings/sec, 35 secs
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /ER
lola: Predicate Phi holds until Predicate Psi on all paths.
lola: 6528389 markings, 48449044 edges
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (((xFINACK <= FINWAIT1) U (xESTAB <= LASTACK))) AND E (F (((3 <= xCLOSEWAIT) OR (2 <= xFINACK)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 1175 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((3 <= xCLOSEWAIT) OR (2 <= xFINACK))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((3 <= xCLOSEWAIT) OR (2 <= xFINACK))))
lola: processed formula length: 46
lola: 8 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((3 <= xCLOSEWAIT) OR (2 <= xFINACK))
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 16 markings, 15 edges
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-13-0.sara
lola: subprocess 14 will run for 1763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (((xFINACK <= FINWAIT1) U (xESTAB <= LASTACK)))
lola: ========================================
lola: SUBTASK
lola: lola: state equation: calling and running sara
checking existential until
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: rewrite Frontend/Parser/formula_rewrite.k:648
lola: rewrite Frontend/Parser/formula_rewrite.k:608
lola: processed formula: E (((xFINACK <= FINWAIT1) U (xESTAB <= LASTACK)))
lola: processed formula length: 49
lola: 10 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EU)
lola: state space: using reachability graph (EU version) (--search=depth)
lola: state space: using eu preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: formula 0: (xESTAB <= LASTACK)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-14-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EU
lola: There is a path where Predicate Phi holds until Predicate Psi.
lola: 0 markings, 0 edges
lola: ========================================
sara: try reading problem file TCPcondis-PT-40-CTLCardinality-13-0.sara.
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (F (A (G ((LISTEN <= SYNSENT))))) OR E (G ((3 <= ESTAB))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1763 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (G ((3 <= ESTAB)))
lola: ========================================
lola: SUBTASK
lola: checking possible preservation
lola: processed formula: E (G ((3 <= ESTAB)))
lola: processed formula length: 20
lola: 7 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate is not possibly preserved.
lola: 1 markings, 0 edges
lola: ========================================
sara: place or transition ordering is non-deterministic
lola: subprocess 15 will run for 3526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (A (G ((LISTEN <= SYNSENT)))))
lola: ========================================
lola: SUBTASK
lola: checking eventual invariance
lola: rewrite Frontend/Parser/formula_rewrite.k:665
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (SYNSENT + 1 <= LISTEN)
lola: processed formula length: 23
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola:
using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EGEF)
lola: state space: using reachability graph (EGEF version) (--search=depth)
lola: state space: using ctl preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space /EGEF
lola: The predicate is not eventually invariant.
lola: 449 markings, 470 edges
lola: lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
========================================
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E (F (E (G ((3 <= CLOSING))))) OR (((xSYNSENT <= 1) OR (xCLOSING + 1 <= SYNACK) OR (LISTEN <= 0)) AND A (G ((CLOSEWAIT <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3526 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((CLOSEWAIT <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((CLOSEWAIT <= 2)))
lola: processed formula length: 24
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (3 <= CLOSEWAIT)
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: 23 markings, 22 edges
lola: state equation: write sara problem file to TCPcondis-PT-40-CTLCardinality-15-0.sara
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: ========================================
lola: ...considering subproblem: (E (F (E (G ((3 <= CLOSING))))) OR (((xSYNSENT <= 1) OR (xCLOSING + 1 <= SYNACK) OR (LISTEN <= 0)) AND A (G ((CLOSEWAIT <= 2)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G ((CLOSEWAIT <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((CLOSEWAIT <= 2)))
lola: processed formula length: 24
lola: 9 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 23 markings, 22 edges
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (3 <= CLOSEWAIT)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: ========================================
lola: ========================================
lola: ...considering subproblem: E (F (E (G ((3 <= CLOSING)))))
lola: ========================================
lola: SUBTASK
lola: checking reachability of possible preservation
lola: rewrite Frontend/Parser/formula_rewrite.k:640
lola: processed formula: (3 <= CLOSING)
lola: processed formula length: 14
lola: 8 rewrites
lola: closed formula file TCPcondis-PT-40-CTLCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space /EFEG)
lola: state space: using reachability graph (EFEG version) (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space /EFEG
lola: The predicate is possibly preserved from a reachable marking.
lola: 123 markings, 123 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================

FORMULA TCPcondis-PT-40-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: yes no yes yes yes yes yes no yes yes no no yes yes yes no
lola:
preliminary result: yes no yes yes yes yes yes no yes yes no no yes yes yes no
lola: memory consumption: 26080 KB
lola: time consumption: 44 seconds

BK_TIME_CONFINEMENT_REACHED

--------------------
content from 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-40"
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/TCPcondis-PT-40.tgz
mv TCPcondis-PT-40 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 lola"
echo " Input is TCPcondis-PT-40, 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 r172-smll-152708743100227"
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 ;