Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fko/mcc2019-input.r176-oct2-155297760800059.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2019-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................
=====================================================================
Generated by BenchKit 2-3954
Executing tool win2018
Input is TCPcondis-PT-25, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-oct2-155297760800059
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.0K Feb 12 19:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 15K Feb 12 19:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 9 02:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 9 02:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 102 Feb 24 15:06 GlobalProperties.txt
-rw-r--r-- 1 mcc users 340 Feb 24 15:06 GlobalProperties.xml
-rw-r--r-- 1 mcc users 2.3K Feb 5 01:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 9.5K Feb 5 01:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8K Feb 4 22:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.1K Feb 4 22:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 4 21:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 4 21:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 1 21:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13K Feb 1 21:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 4 22:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 4 22:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 3 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 10 17:31 model.pnml

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

=== Now, execution of the tool begins

BK_START 1553296488956

info: Time: 3600 - MCC
===========================================================================================
prep: translating TCPcondis-PT-25 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating TCPcondis-PT-25 formula LTLCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking LTLCardinality @ TCPcondis-PT-25 @ 3569 seconds
lola: LoLA will run for 3569 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-25-LTLCardinality.task
lola: A (G ((F ((xFINWAIT2 <= LASTACK)) U X ((3 <= FINWAIT2))))) : A (G (F (X ((2 <= FINWAIT1))))) : A (X (F ((3 <= xFINWAIT2)))) : A (X (X (((3 <= FINWAIT1) U (FIN <= xFINACK))))) : A (F ((F ((xFIN <= LISTEN)) U F ((3 <= CLOSEWAIT))))) : A (G (X (X (F ((1 <= xTIMEWAIT)))))) : A ((FINACK <= xESTAB)) : A (X (X (X (X ((FINWAIT1 <= LASTACK)))))) : A (X ((SYNRCVD <= xFINWAIT1))) : A ((1 <= CLOSEWAIT)) : A (G ((xLISTEN <= xFINWAIT1))) : A (G (X (F (X ((ESTAB <= xLISTEN)))))) : A (G (X (((3 <= ESTAB) U (xSYNSENT <= xCLOSING))))) : A (F ((TIMEWAIT <= xLASTACK))) : A (G ((xLISTEN <= SYNACK))) : A ((xSYNRCVD <= SYNSENT))
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (FINACK <= xESTAB)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (FINACK <= xESTAB)
lola: processed formula length: 18
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.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: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= CLOSEWAIT)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= CLOSEWAIT)
lola: processed formula length: 16
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.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

FORMULA TCPcondis-PT-25-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (xSYNRCVD <= SYNSENT)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (xSYNRCVD <= SYNSENT)
lola: processed formula length: 21
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.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: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-15 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: (A (G (F ((3 <= FINWAIT2)))) AND A (G ((F ((xFINWAIT2 <= LASTACK)) OR X ((3 <= FINWAIT2))))))
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: A (G (F ((3 <= FINWAIT2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((3 <= FINWAIT2))))
lola: processed formula length: 27
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 262 markings, 262 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-0 FALSE 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 (X (X (X ((FINWAIT1 <= LASTACK))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X ((FINWAIT1 <= LASTACK))))))
lola: processed formula length: 41
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 113 markings, 246 edges
lola: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-7 TRUE 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 (X ((SYNRCVD <= xFINWAIT1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((SYNRCVD <= xFINWAIT1)))
lola: processed formula length: 30
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 5 markings, 4 edges
lola: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((3 <= xFINWAIT2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((3 <= xFINWAIT2))))
lola: processed formula length: 28
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 258 markings, 258 edges

FORMULA TCPcondis-PT-25-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((F ((xSYNSENT <= xCLOSING)) AND ((3 <= ESTAB) OR (xSYNSENT <= xCLOSING))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((F ((xSYNSENT <= xCLOSING)) AND ((3 <= ESTAB) OR (xSYNSENT <= xCLOSING))))))
lola: processed formula length: 85
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
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: 416 markings, 416 edges

FORMULA TCPcondis-PT-25-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((3 <= FINWAIT1) U (FIN <= xFINACK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((3 <= FINWAIT1) U (FIN <= xFINACK)))))
lola: processed formula length: 48
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 17 markings, 22 edges
lola: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((xLISTEN <= SYNACK)))
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 ((xLISTEN <= SYNACK)))
lola: processed formula length: 27
lola: 28 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.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: (SYNACK + 1 <= xLISTEN)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: state equation: write sara problem file to TCPcondis-PT-25-LTLCardinality-9-0.sara
lola: The predicate is not invariant.
lola: 2 markings, 1 edges

FORMULA TCPcondis-PT-25-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: state equation: calling and running sara
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((xLISTEN <= xFINWAIT1)))
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 ((xLISTEN <= xFINWAIT1)))
lola: processed formula length: 30
lola: 28 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.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: (xFINWAIT1 + 1 <= xLISTEN)
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: 2 markings, 1 edges
lola: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= CLOSEWAIT)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (CLOSEWAIT <= 2)
lola: processed formula length: 16
lola: 28 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.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 does not eventually occur.
lola: 376 markings, 376 edges
lola: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-4 FALSE 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 (F ((TIMEWAIT <= xLASTACK)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:659
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: (xLASTACK + 1 <= TIMEWAIT)
lola: processed formula length: 26
lola: 28 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.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 eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================

FORMULA TCPcondis-PT-25-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= xTIMEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= xTIMEWAIT))))
lola: processed formula length: 28
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
sara: try reading problem file TCPcondis-PT-25-LTLCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic

lola: 2806374 markings, 7206452 edges, 561275 markings/sec, 0 secs
lola: 5302997 markings, 13665374 edges, 499325 markings/sec, 5 secs
lola: 7629504 markings, 19724678 edges, 465301 markings/sec, 10 secs
lola: 9861023 markings, 25564653 edges, 446304 markings/sec, 15 secs
lola: 12165715 markings, 31511815 edges, 460938 markings/sec, 20 secs
lola: 14408983 markings, 37391178 edges, 448654 markings/sec, 25 secs
lola: 16757241 markings, 43424672 edges, 469652 markings/sec, 30 secs
lola: 18950461 markings, 49217891 edges, 438644 markings/sec, 35 secs
lola: 21330757 markings, 55288649 edges, 476059 markings/sec, 40 secs
lola: 23525727 markings, 61047419 edges, 438994 markings/sec, 45 secs
lola: 25868976 markings, 67077970 edges, 468650 markings/sec, 50 secs
lola: 28133997 markings, 72939259 edges, 453004 markings/sec, 55 secs
lola: 30304241 markings, 78638167 edges, 434049 markings/sec, 60 secs
lola: 32641136 markings, 84634933 edges, 467379 markings/sec, 65 secs
lola: 34831674 markings, 90315777 edges, 438108 markings/sec, 70 secs
lola: 36953434 markings, 95883413 edges, 424352 markings/sec, 75 secs
lola: 39242092 markings, 101776405 edges, 457732 markings/sec, 80 secs
lola: 41422953 markings, 107425727 edges, 436172 markings/sec, 85 secs
lola: 43516612 markings, 112908582 edges, 418732 markings/sec, 90 secs
lola: 45711191 markings, 118608795 edges, 438916 markings/sec, 95 secs
lola: 47892687 markings, 124247173 edges, 436299 markings/sec, 100 secs
lola: 49987344 markings, 129714181 edges, 418931 markings/sec, 105 secs
lola: 52038020 markings, 135106337 edges, 410135 markings/sec, 110 secs
lola: 54317986 markings, 140994736 edges, 455993 markings/sec, 115 secs
lola: 56529512 markings, 146756322 edges, 442305 markings/sec, 120 secs
lola: 58668687 markings, 152381099 edges, 427835 markings/sec, 125 secs
lola: 60899443 markings, 158189788 edges, 446151 markings/sec, 130 secs
lola: 63023961 markings, 163734674 edges, 424904 markings/sec, 135 secs
lola: 65108464 markings, 169199806 edges, 416901 markings/sec, 140 secs
lola: 67305533 markings, 174965916 edges, 439414 markings/sec, 145 secs
lola: 69488465 markings, 180671760 edges, 436586 markings/sec, 150 secs
lola: 71615912 markings, 186276791 edges, 425489 markings/sec, 155 secs
lola: 73782060 markings, 191978953 edges, 433230 markings/sec, 160 secs
lola: 75911038 markings, 197585916 edges, 425796 markings/sec, 165 secs
lola: 78004300 markings, 203096209 edges, 418652 markings/sec, 170 secs
lola: 80145268 markings, 208769864 edges, 428194 markings/sec, 175 secs
lola: 82147534 markings, 214092356 edges, 400453 markings/sec, 180 secs
lola: 84280073 markings, 219749262 edges, 426508 markings/sec, 185 secs
lola: 86318102 markings, 225188583 edges, 407606 markings/sec, 190 secs
lola: 88389128 markings, 230696103 edges, 414205 markings/sec, 195 secs
lola: 90464612 markings, 236338640 edges, 415097 markings/sec, 200 secs
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: 91177238 markings, 238157695 edges

FORMULA TCPcondis-PT-25-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: ========================================
lola: subprocess 14 will run for 1681 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((2 <= FINWAIT1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((2 <= FINWAIT1))))
lola: processed formula length: 27
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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:
FORMULA TCPcondis-PT-25-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 15 will run for 3363 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((ESTAB <= xLISTEN))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((ESTAB <= xLISTEN))))
lola: processed formula length: 30
lola: 26 rewrites
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: 327 markings, 327 edges

FORMULA TCPcondis-PT-25-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no yes yes yes no no no no yes no yes
lola:
preliminary result: no no no yes no no yes yes yes no no no no yes no yes
lola: ========================================
lola: memory consumption: 18704 KB
lola: time consumption: 206 seconds

BK_STOP 1553296696087

--------------------
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-25"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2018"
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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool win2018"
echo " Input is TCPcondis-PT-25, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-oct2-155297760800059"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-25.tgz
mv TCPcondis-PT-25 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.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 ;