fond
Model Checking Contest 2018
8th edition, Bratislava, Slovakia, June 26, 2018
Execution of r214-smll-152732265900677
Last Updated
June 26, 2018

About the Execution of M4M.full for TCPcondis-PT-25

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13268.410 319339.00 279935.00 1600.60 FFF?TFFFFFFTFTFT normal

Execution Chart

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

Trace from the execution

Waiting for the VM to be ready (probing ssh)
......................
/home/mcc/execution
total 184K
-rw-r--r-- 1 mcc users 3.6K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.4K May 26 09:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 11K May 26 09:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 26 09:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 9.5K May 26 09:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 106 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 344 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 2.7K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 3 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 24K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool mcc4mcc-full
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 r214-smll-152732265900677
=====================================================================


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


BK_STOP 1527500835257

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

Prefix is 65b80f64.
Reading known information in /usr/share/mcc4mcc/65b80f64-known.json.
Reading learned information in /usr/share/mcc4mcc/65b80f64-learned.json.
Reading value translations in /usr/share/mcc4mcc/65b80f64-values.json.
Using directory /home/mcc/execution for input, as it contains a model.pnml file.
Using TCPcondis-PT-25 as instance name.
Using TCPcondis as model name.
Using algorithm or tool bmdt.
Model characteristics are: {'Examination': 'LTLCardinality', 'Place/Transition': True, 'Colored': False, 'Relative-Time': 1, 'Relative-Memory': 1, 'Ordinary': True, 'Simple Free Choice': False, 'Extended Free Choice': False, 'State Machine': False, 'Marked Graph': False, 'Connected': True, 'Strongly Connected': True, 'Source Place': False, 'Sink Place': False, 'Source Transition': False, 'Sink Transition': False, 'Loop Free': True, 'Conservative': False, 'Sub-Conservative': False, 'Nested Units': False, 'Safe': False, 'Deadlock': False, 'Reversible': True, 'Quasi Live': True, 'Live': True}.
Known tools are: [{'Time': 258, 'Memory': 106.81, 'Tool': 'lola'}, {'Time': 453, 'Memory': 106.77, 'Tool': 'lola'}, {'Time': 8529, 'Memory': 374.49, 'Tool': 'itstools'}, {'Time': 8780, 'Memory': 379.21, 'Tool': 'itstools'}].
Learned tools are: [{'Tool': 'lola'}].
Learned tool lola is 1.0x far from the best tool lola.
LTLCardinality lola TCPcondis-PT-25...
----- Start make prepare stderr -----

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


checking for too many tokens
===========================================================================================
TCPcondis-PT-25: translating PT formula LTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
----- Start make result stderr -----
LTLCardinality @ TCPcondis-PT-25 @ 3539 seconds
----- Start make result stderr -----
----- 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-25-LTLCardinality.task
lola: A ((3 <= SYNSENT)) : A (((CLOSEWAIT <= FIN) U G (G ((xFINACK <= SYNSENT))))) : A (X (G (G ((3 <= FINACK))))) : A (X ((F ((1 <= xFIN)) U (xSYN <= LASTACK)))) : A (((3 <= xESTAB) U ((SYN <= CLOSING) U (xCLOSING <= xCLOSEWAIT)))) : A ((1 <= LISTEN)) : A (G (G (X (F ((SYN <= xSYNRCVD)))))) : A (G (X (F (F ((1 <= xCLOSING)))))) : A (F (G (X (G ((2 <= LASTACK)))))) : A ((G ((1 <= xLASTACK)) U X (X ((2 <= xCLOSING))))) : A (F ((3 <= xSYNACK))) : A ((X (F ((xESTAB <= SYNACK))) U F ((xSYN <= SYNRCVD)))) : A (F ((1 <= xSYNSENT))) : A (F ((xFINWAIT1 <= xSYNRCVD))) : A ((G (F ((SYNSENT <= SYNRCVD))) U X (G ((SYN <= xLASTACK))))) : A (X (X (F (F ((FINWAIT1 <= xCLOSING))))))
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 ((3 <= SYNSENT))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= SYNSENT)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
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
lola: ========================================
lola: subprocess 1 will run for 235 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((CLOSEWAIT <= FIN) U G (G ((xFINACK <= SYNSENT)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((CLOSEWAIT <= FIN) U G (G ((xFINACK <= SYNSENT)))))
lola: processed formula: A (((CLOSEWAIT <= FIN) U G (G ((xFINACK <= SYNSENT)))))
lola: processed formula length: 55
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 545 markings, 666 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (G (G ((3 <= FINACK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (G (G ((3 <= FINACK)))))
lola: processed formula: A (X (G (G ((3 <= FINACK)))))
lola: processed formula length: 29
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= xFIN)) U (xSYN <= LASTACK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X ((F ((1 <= xFIN)) U (xSYN <= LASTACK))))
lola: processed formula: A (X ((F ((1 <= xFIN)) U (xSYN <= LASTACK))))
lola: processed formula length: 45
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2295256 markings, 5990832 edges, 459051 markings/sec, 0 secs
lola: 4506984 markings, 11946010 edges, 442346 markings/sec, 5 secs
lola: 6453006 markings, 17799811 edges, 389204 markings/sec, 10 secs
lola: 8123711 markings, 23377876 edges, 334141 markings/sec, 15 secs
lola: 9736652 markings, 28814098 edges, 322588 markings/sec, 20 secs
lola: 11307108 markings, 34164811 edges, 314091 markings/sec, 25 secs
lola: 12779501 markings, 39039735 edges, 294479 markings/sec, 30 secs
lola: 14180257 markings, 43758337 edges, 280151 markings/sec, 35 secs
lola: 15543291 markings, 48443562 edges, 272607 markings/sec, 40 secs
lola: 16906608 markings, 52938387 edges, 272663 markings/sec, 45 secs
lola: 18187082 markings, 57229511 edges, 256095 markings/sec, 50 secs
lola: 19449119 markings, 61492506 edges, 252407 markings/sec, 55 secs
lola: 20941605 markings, 66532161 edges, 298497 markings/sec, 60 secs
lola: 22523529 markings, 71816707 edges, 316385 markings/sec, 65 secs
lola: 24054865 markings, 76976934 edges, 306267 markings/sec, 70 secs
lola: 25408551 markings, 81965997 edges, 270737 markings/sec, 75 secs
lola: 26568499 markings, 86591179 edges, 231990 markings/sec, 80 secs
lola: 27686242 markings, 91090246 edges, 223549 markings/sec, 85 secs
lola: 28781329 markings, 95534396 edges, 219017 markings/sec, 90 secs
lola: 29858570 markings, 99959853 edges, 215448 markings/sec, 95 secs
lola: 30907126 markings, 104143753 edges, 209711 markings/sec, 100 secs
lola: 31919477 markings, 108218077 edges, 202470 markings/sec, 105 secs
lola: 32924384 markings, 112285660 edges, 200981 markings/sec, 110 secs
lola: 34006050 markings, 116399338 edges, 216333 markings/sec, 115 secs
lola: 35029655 markings, 119796569 edges, 204721 markings/sec, 120 secs
lola: 36019115 markings, 123109683 edges, 197892 markings/sec, 125 secs
lola: 36974079 markings, 126376426 edges, 190993 markings/sec, 130 secs
lola: 37897123 markings, 130030041 edges, 184609 markings/sec, 135 secs
lola: 38782641 markings, 133571673 edges, 177104 markings/sec, 140 secs
lola: 39631175 markings, 137014294 edges, 169707 markings/sec, 145 secs
lola: 40472905 markings, 140437279 edges, 168346 markings/sec, 150 secs
lola: 41434819 markings, 143754500 edges, 192383 markings/sec, 155 secs
lola: 42426376 markings, 147047888 edges, 198311 markings/sec, 160 secs
lola: 43381131 markings, 150253503 edges, 190951 markings/sec, 165 secs
lola: 44432859 markings, 153855311 edges, 210346 markings/sec, 170 secs
lola: 45875417 markings, 158637381 edges, 288512 markings/sec, 175 secs
lola: 47245268 markings, 163251191 edges, 273970 markings/sec, 180 secs
lola: 48561885 markings, 167741507 edges, 263323 markings/sec, 185 secs
lola: 49630326 markings, 171956646 edges, 213688 markings/sec, 190 secs
lola: 50599072 markings, 175863202 edges, 193749 markings/sec, 195 secs
lola: 51555205 markings, 179715584 edges, 191227 markings/sec, 200 secs
lola: 52486971 markings, 183506154 edges, 186353 markings/sec, 205 secs
lola: 53420690 markings, 187345472 edges, 186744 markings/sec, 210 secs
lola: 54316311 markings, 190929618 edges, 179124 markings/sec, 215 secs
lola: 55176905 markings, 194420037 edges, 172119 markings/sec, 220 secs
lola: 56055898 markings, 197954495 edges, 175799 markings/sec, 225 secs
lola: 56885607 markings, 201456097 edges, 165942 markings/sec, 230 secs
lola: 57789628 markings, 205026612 edges, 180804 markings/sec, 235 secs
lola: 58641892 markings, 208447714 edges, 170453 markings/sec, 240 secs
lola: 59487334 markings, 211842299 edges, 169088 markings/sec, 245 secs
lola: 60294572 markings, 215300245 edges, 161448 markings/sec, 250 secs
lola: 61076334 markings, 218924554 edges, 156352 markings/sec, 255 secs
lola: 61828564 markings, 222442775 edges, 150446 markings/sec, 260 secs
lola: 62553037 markings, 225861596 edges, 144895 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 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (((3 <= xESTAB) U ((SYN <= CLOSING) U (xCLOSING <= xCLOSEWAIT))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (((3 <= xESTAB) U ((SYN <= CLOSING) U (xCLOSING <= xCLOSEWAIT))))
lola: processed formula: A (((3 <= xESTAB) U ((SYN <= CLOSING) U (xCLOSING <= xCLOSEWAIT))))
lola: processed formula length: 67
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 296 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((1 <= LISTEN))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= LISTEN)
lola: processed formula length: 13
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
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
lola: ========================================
lola: subprocess 6 will run for 326 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (G (X (F ((SYN <= xSYNRCVD))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (G (X (F ((SYN <= xSYNRCVD))))))
lola: processed formula: A (G (G (X (F ((SYN <= xSYNRCVD))))))
lola: processed formula length: 37
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 425 markings, 425 edges
lola: ========================================
lola: subprocess 7 will run for 362 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (G (X (F (F ((1 <= xCLOSING))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (G (X (F ((1 <= xCLOSING)))))
lola: processed formula: A (G (X (F ((1 <= xCLOSING)))))
lola: processed formula length: 31
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 2 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 308 markings, 308 edges
lola: ========================================
lola: subprocess 8 will run for 408 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (G (X (G ((2 <= LASTACK))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F (G (X (G ((2 <= LASTACK))))))
lola: processed formula: A (F (G (X (G ((2 <= LASTACK))))))
lola: processed formula length: 34
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 4 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
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: 259 markings, 260 edges
lola: ========================================
lola: subprocess 9 will run for 466 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G ((1 <= xLASTACK)) U X (X ((2 <= xCLOSING)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G ((1 <= xLASTACK)) U X (X ((2 <= xCLOSING)))))
lola: processed formula: A ((G ((1 <= xLASTACK)) U X (X ((2 <= xCLOSING)))))
lola: processed formula length: 51
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 11 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 28 unused bits
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
lola: ========================================
lola: subprocess 10 will run for 544 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= xSYNACK)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((3 <= xSYNACK)))
lola: processed formula: A (F ((3 <= xSYNACK)))
lola: processed formula length: 22
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 75 markings, 75 edges
lola: ========================================
lola: subprocess 11 will run for 653 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((X (F ((xESTAB <= SYNACK))) U F ((xSYN <= SYNRCVD))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((X (F ((xESTAB <= SYNACK))) U F ((xSYN <= SYNRCVD))))
lola: processed formula: A ((X (F ((xESTAB <= SYNACK))) U F ((xSYN <= SYNRCVD))))
lola: processed formula length: 56
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 12 will run for 816 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((1 <= xSYNSENT)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((1 <= xSYNSENT)))
lola: processed formula: A (F ((1 <= xSYNSENT)))
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 543 markings, 543 edges
lola: ========================================
lola: subprocess 13 will run for 1088 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((xFINWAIT1 <= xSYNRCVD)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (F ((xFINWAIT1 <= xSYNRCVD)))
lola: processed formula: A (F ((xFINWAIT1 <= xSYNRCVD)))
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 1 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 31 unused bits
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method (--stubborn)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 14 will run for 1633 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A ((G (F ((SYNSENT <= SYNRCVD))) U X (G ((SYN <= xLASTACK)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A ((G (F ((SYNSENT <= SYNRCVD))) U X (G ((SYN <= xLASTACK)))))
lola: processed formula: A ((G (F ((SYNSENT <= SYNRCVD))) U X (G ((SYN <= xLASTACK)))))
lola: processed formula length: 62
lola: 0 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 7 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 29 unused bits
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: 254 markings, 254 edges
lola: ========================================
lola: subprocess 15 will run for 3266 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (X (X (F (F ((FINWAIT1 <= xCLOSING))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a B\xfcchi-Automaton
lola: processed formula: A (X (X (F ((FINWAIT1 <= xCLOSING)))))
lola: processed formula: A (X (X (F ((FINWAIT1 <= xCLOSING)))))
lola: processed formula length: 38
lola: 1 rewrites
lola: formula mentions 0 of 30 places; total mentions: 0
lola: closed formula file TCPcondis-PT-25-LTLCardinality.task
lola: the resulting B\xfcchi automaton has 3 states
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 88 bytes per marking, with 30 unused bits
lola: using a prefix tree store (--store=prefix)
lola: 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: ========================================
lola: RESULT
lola:
SUMMARY: no no no unknown yes no no no no no no yes no yes no yes
FORMULA TCPcondis-PT-25-LTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-3 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-7 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-8 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA TCPcondis-PT-25-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stderr -----
----- Kill lola and sara stdout -----
----- Finished stdout -----
----- Finished stderr -----

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="TCPcondis-PT-25"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="mcc4mcc-full"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-25.tgz
mv TCPcondis-PT-25 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool mcc4mcc-full"
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 r214-smll-152732265900677"
echo "====================================================================="
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 ;