Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r204-csrt-159033411700091.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is TCPcondis-PT-30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r204-csrt-159033411700091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 208K
-rw-r--r-- 1 mcc users 3.8K Apr 12 18:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 12 18:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 11 20:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 11 20:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 14 12:53 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:53 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 21:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 16K Apr 10 21:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 10 05:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 10 05:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 10 22:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 24 05:38 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-30-00
FORMULA_NAME TCPcondis-PT-30-01
FORMULA_NAME TCPcondis-PT-30-02
FORMULA_NAME TCPcondis-PT-30-03
FORMULA_NAME TCPcondis-PT-30-04
FORMULA_NAME TCPcondis-PT-30-05
FORMULA_NAME TCPcondis-PT-30-06
FORMULA_NAME TCPcondis-PT-30-07
FORMULA_NAME TCPcondis-PT-30-08
FORMULA_NAME TCPcondis-PT-30-09
FORMULA_NAME TCPcondis-PT-30-10
FORMULA_NAME TCPcondis-PT-30-11
FORMULA_NAME TCPcondis-PT-30-12
FORMULA_NAME TCPcondis-PT-30-13
FORMULA_NAME TCPcondis-PT-30-14
FORMULA_NAME TCPcondis-PT-30-15

=== Now, execution of the tool begins

BK_START 1590646808140

info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ TCPcondis-PT-30 @ 3570 seconds

FORMULA TCPcondis-PT-30-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA TCPcondis-PT-30-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2433
rslt: Output for LTLCardinality @ TCPcondis-PT-30

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu May 28 06:20:08 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X ((1 <= xFIN)))",
"processed_size": 19,
"rewrites": 105
},
"result":
{
"edges": 277,
"markings": 277,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 3,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (G (F ((((xESTAB <= 0) U G ((SYNSENT <= xCLOSEWAIT))) OR ((FINWAIT2 <= xSYN) U X (((FINWAIT2 <= xSYN) U (2 <= xFINACK))))))))",
"processed_size": 127,
"rewrites": 105
},
"result":
{
"edges": 1450,
"markings": 1122,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 255
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 5,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 10,
"taut": 0,
"tconj": 2,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "A (X (((xESTAB + 1 <= FINWAIT1) OR (X ((xLISTEN + 1 <= CLOSED)) AND (G ((SYNSENT + 1 <= ESTAB)) AND ((SYNSENT + 1 <= ESTAB) OR X ((xFINWAIT2 <= xESTAB))))))))",
"processed_size": 158,
"rewrites": 105
},
"result":
{
"edges": 277,
"markings": 277,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 277
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 4,
"G": 1,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F ((X (X ((SYNSENT <= FINWAIT2))) OR (G (F (((xLISTEN <= xCLOSEWAIT) OR F ((xLISTEN <= xCLOSEWAIT))))) AND X (X (F ((SYNSENT <= FINWAIT2))))))))",
"processed_size": 147,
"rewrites": 105
},
"result":
{
"edges": 1771600,
"markings": 751665,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 302
},
"exit": null,
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "((xTIMEWAIT + 1 <= SYNSENT) AND (xFINACK <= 0))",
"processed_size": 47,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 332
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 0,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 0,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 0,
"visible_transitions": 0
},
"processed": "A (X (TRUE))",
"processed_size": 12,
"rewrites": 105
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 6,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 369
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 1,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X ((G (F (((xESTAB <= FINWAIT1) OR (xESTAB <= xFIN)))) OR X (F ((ESTAB + 1 <= xLISTEN))))))",
"processed_size": 95,
"rewrites": 105
},
"result":
{
"edges": 438,
"markings": 436,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 415
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A ((((2 <= LISTEN) OR F ((xCLOSEWAIT <= xLISTEN))) U (xFINACK <= SYNRCVD)))",
"processed_size": 75,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 474
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (X (((xCLOSEWAIT <= xLISTEN) OR F ((xSYNSENT <= xCLOSEWAIT)))))",
"processed_size": 65,
"rewrites": 105
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 8,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 474
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 4,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X (G (((xCLOSEWAIT + 1 <= LISTEN) AND (F ((xCLOSEWAIT + 1 <= LISTEN)) OR (G ((xCLOSEWAIT + 1 <= LISTEN)) AND F (G ((FINWAIT1 + 1 <= xFINWAIT2))))))))))",
"processed_size": 157,
"rewrites": 105
},
"result":
{
"edges": 277,
"markings": 277,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 553
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((LASTACK <= xSYNACK))))",
"processed_size": 32,
"rewrites": 105
},
"result":
{
"edges": 983,
"markings": 947,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 664
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((xLISTEN + 1 <= xCLOSING))))",
"processed_size": 37,
"rewrites": 105
},
"result":
{
"edges": 74,
"markings": 73,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 830
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (F (G (((xSYN + 1 <= xLASTACK) AND G (F ((xCLOSEWAIT <= 0)))))))",
"processed_size": 66,
"rewrites": 105
},
"result":
{
"edges": 278,
"markings": 277,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1107
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F (((1 <= LASTACK) OR ((LISTEN <= SYNSENT) U (xCLOSING <= 0)))))",
"processed_size": 67,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 1
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1661
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 1,
"X": 0,
"aconj": 1,
"adisj": 0,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (((((xFINACK <= SYNSENT) AND (2 <= xLISTEN)) U (xSYN <= LISTEN)) OR (F ((xSYN <= LISTEN)) AND F (G ((LISTEN + 1 <= xSYN))))))",
"processed_size": 127,
"rewrites": 105
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3322
},
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (F (((xESTAB <= xCLOSING) OR (xFINACK <= SYNRCVD)))))",
"processed_size": 59,
"rewrites": 105
},
"result":
{
"edges": 4,
"markings": 5,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 16,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (G (((xESTAB <= xCLOSING) OR G (((FINWAIT1 + 1 <= TIMEWAIT) AND (xCLOSING + 1 <= xESTAB)))))))",
"processed_size": 99,
"rewrites": 105
},
"result":
{
"edges": 277,
"markings": 277,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 16,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (((xSYNACK <= 0) OR F ((xCLOSING <= 1)))))",
"processed_size": 47,
"rewrites": 105
},
"result":
{
"edges": 488223,
"markings": 308513,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 18,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 23484,
"runtime": 1137.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(F(G(**))) : A(((** U **) OR (F(**) AND F(G(*))))) : A(F(G((* AND G(F(*)))))) : (A(G(F(**))) AND A(G((* OR F(*))))) : (A(X(*)) AND (A(X((X(*) R *))) AND A(X(F(**))))) : (A(X(F(**))) AND A(X(G((** OR G(*)))))) : A(G(F(((** U G(**)) OR (** U X((** U **))))))) : A(X((* OR (X(*) AND (G(*) AND (* OR X(*))))))) : A(F((X(X(**)) OR (G(F((** OR F(**)))) AND X(X(F(**))))))) : (** AND A(X(X(G((F(**) AND (X(G(**)) OR **))))))) : A(F((** OR (** U **)))) : A(X(TRUE)) : A(X((G(F(*)) OR X(F(*))))) : A(F(G(*))) : (A(((** OR F(**)) U **)) AND A(X((** OR F(**))))) : A(X(X(G((* AND (F(*) OR (G(*) AND F(G(*)))))))))"
},
"net":
{
"arcs": 108,
"conflict_clusters": 10,
"places": 30,
"places_significant": 21,
"singleton_clusters": 0,
"transitions": 32
},
"result":
{
"preliminary_value": "no yes no no no no no no no no yes yes no no yes no ",
"value": "no yes no no no no no no no no yes yes no no yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 62/268435456 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: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: A (X (G (X (F (G ((LASTACK <= xSYNACK))))))) : A ((F (X (NOT(F ((xSYN <= LISTEN))))) U (((xFINACK <= SYNSENT) AND (2 <= xLISTEN)) U (xSYN <= LISTEN)))) : A (F (X (NOT(F (X (F (((xLASTACK <= xSYN) OR F (G ((1 <= xCLOSEWAIT))))))))))) : A (G ((F ((1 <= xSYNACK)) AND NOT(((1 <= xSYNACK) AND G ((2 <= xCLOSING))))))) : A (X ((NOT(((xFIN <= 0) OR (X ((xESTAB <= xFINACK)) U (xSYNACK <= TIMEWAIT)))) AND F ((SYN <= SYNSENT))))) : A ((X (F (((xESTAB <= xCLOSING) OR (xFINACK <= SYNRCVD)))) AND X (G (((xESTAB <= xCLOSING) OR NOT(F (((TIMEWAIT <= FINWAIT1) OR (xESTAB <= xCLOSING))))))))) : A (X (G (F ((((xESTAB <= 0) U G ((SYNSENT <= xCLOSEWAIT))) OR ((FINWAIT2 <= xSYN) U X (((FINWAIT2 <= xSYN) U (2 <= xFINACK))))))))) : A (X (NOT(((FINWAIT1 <= xESTAB) AND ((X ((CLOSED <= xLISTEN)) OR F ((ESTAB <= SYNSENT))) OR ((ESTAB <= SYNSENT) AND X ((xESTAB + 1 <= xFINWAIT2)))))))) : A (F ((G (F ((X ((xLISTEN <= xCLOSEWAIT)) OR F (X ((xLISTEN <= xCLOSEWAIT)))))) U X (X ((SYNSENT <= FINWAIT2)))))) : A ((((xTIMEWAIT + 1 <= SYNSENT) AND (xFINACK <= 0)) AND X (G (X ((G (X ((FINWAIT2 <= xFINACK))) U (xFINACK + 1 <= FINWAIT2))))))) : A (F (((1 <= LASTACK) OR ((LISTEN <= SYNSENT) U (xCLOSING <= 0))))) : A ((X ((G ((xTIMEWAIT <= 2)) OR (NOT(G ((0 <= SYNSENT))) U (0 <= FINACK)))) AND (X ((TIMEWAIT <= xFIN)) U (0 <= SYNSENT)))) : A (X (NOT((F (G (X (((FINWAIT1 + 1 <= xESTAB) AND (xFIN + 1 <= xESTAB))))) AND G (X (G ((xLISTEN <= ESTAB)))))))) : A (F (NOT(F ((xCLOSING <= xLISTEN))))) : A (((((2 <= LISTEN) OR F ((xCLOSEWAIT <= xLISTEN))) U (xFINACK <= SYNRCVD)) AND X (((xCLOSEWAIT <= xLISTEN) OR F ((xSYNSENT <= xCLOSEWAIT)))))) : A (X (NOT(X (F (((LISTEN <= xCLOSEWAIT) OR (G ((LISTEN <= xCLOSEWAIT)) AND (F ((LISTEN <= xCLOSEWAIT)) OR G (F ((xFINWAIT2 <= FINWAIT1)))))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:338
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: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:525
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:528
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:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:123
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:536
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X ((1 <= xFIN))) AND (A (X ((X ((xFINACK + 1 <= xESTAB)) R (TIMEWAIT + 1 <= xSYNACK)))) AND A (X (F ((SYN <= SYNSENT))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((1 <= xFIN)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((1 <= xFIN)))
lola: processed formula length: 19
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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: 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: 277 markings, 277 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F (((xESTAB <= xCLOSING) OR (xFINACK <= SYNRCVD))))) AND A (X (G (((xESTAB <= xCLOSING) OR G (((FINWAIT1 + 1 <= TIMEWAIT) AND (xCLOSING + 1 <= xESTAB))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: local time limit reached - aborting
lola:
preliminary result: unknown unknown unknown unknown no unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 24892 KB
lola: time consumption: 242 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((((xESTAB <= 0) U G ((SYNSENT <= xCLOSEWAIT))) OR ((FINWAIT2 <= xSYN) U X (((FINWAIT2 <= xSYN) U (2 <= xFINACK))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((((xESTAB <= 0) U G ((SYNSENT <= xCLOSEWAIT))) OR ((FINWAIT2 <= xSYN) U X (((FINWAIT2 <= xSYN) U (2 <= xFINACK))))))))
lola: processed formula length: 127
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: add low 18
lola: add low 24
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: 1122 markings, 1450 edges
lola: ========================================
lola: subprocess 3 will run for 255 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((xESTAB + 1 <= FINWAIT1) OR (X ((xLISTEN + 1 <= CLOSED)) AND (G ((SYNSENT + 1 <= ESTAB)) AND ((SYNSENT + 1 <= ESTAB) OR X ((xFINWAIT2 <= xESTAB))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((xESTAB + 1 <= FINWAIT1) OR (X ((xLISTEN + 1 <= CLOSED)) AND (G ((SYNSENT + 1 <= ESTAB)) AND ((SYNSENT + 1 <= ESTAB) OR X ((xFINWAIT2 <= xESTAB))))))))
lola: processed formula length: 158
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 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: 277 markings, 277 edges
lola: ========================================
lola: subprocess 4 will run for 277 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X (X ((SYNSENT <= FINWAIT2))) OR (G (F (((xLISTEN <= xCLOSEWAIT) OR F ((xLISTEN <= xCLOSEWAIT))))) AND X (X (F ((SYNSENT <= FINWAIT2))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X (X ((SYNSENT <= FINWAIT2))) OR (G (F (((xLISTEN <= xCLOSEWAIT) OR F ((xLISTEN <= xCLOSEWAIT))))) AND X (X (F ((SYNSENT <= FINWAIT2))))))))
lola: processed formula length: 147
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 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: 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: 751665 markings, 1771600 edges
lola: ========================================
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (((xTIMEWAIT + 1 <= SYNSENT) AND (xFINACK <= 0)) AND A (X (X (G ((F ((xFINACK + 1 <= FINWAIT2)) AND (X (G ((FINWAIT2 <= xFINACK))) OR (xFINACK + 1 <= FINWAIT2))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 302 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((xTIMEWAIT + 1 <= SYNSENT) AND (xFINACK <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((xTIMEWAIT + 1 <= SYNSENT) AND (xFINACK <= 0))
lola: processed formula length: 47
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (TRUE))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (TRUE))
lola: processed formula length: 12
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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: 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: ========================================
lola: subprocess 7 will run for 369 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((G (F (((xESTAB <= FINWAIT1) OR (xESTAB <= xFIN)))) OR X (F ((ESTAB + 1 <= xLISTEN))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((G (F (((xESTAB <= FINWAIT1) OR (xESTAB <= xFIN)))) OR X (F ((ESTAB + 1 <= xLISTEN))))))
lola: processed formula length: 95
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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: 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: 436 markings, 438 edges
lola: ========================================
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A ((((2 <= LISTEN) OR F ((xCLOSEWAIT <= xLISTEN))) U (xFINACK <= SYNRCVD))) AND A (X (((xCLOSEWAIT <= xLISTEN) OR F ((xSYNSENT <= xCLOSEWAIT))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 415 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= LISTEN) OR F ((xCLOSEWAIT <= xLISTEN))) U (xFINACK <= SYNRCVD)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= LISTEN) OR F ((xCLOSEWAIT <= xLISTEN))) U (xFINACK <= SYNRCVD)))
lola: processed formula length: 75
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((xCLOSEWAIT <= xLISTEN) OR F ((xSYNSENT <= xCLOSEWAIT)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((xCLOSEWAIT <= xLISTEN) OR F ((xSYNSENT <= xCLOSEWAIT)))))
lola: processed formula length: 65
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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: 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: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 9 will run for 474 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G (((xCLOSEWAIT + 1 <= LISTEN) AND (F ((xCLOSEWAIT + 1 <= LISTEN)) OR (G ((xCLOSEWAIT + 1 <= LISTEN)) AND F (G ((FINWAIT1 + 1 <= xFINWAIT2))))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G (((xCLOSEWAIT + 1 <= LISTEN) AND (F ((xCLOSEWAIT + 1 <= LISTEN)) OR (G ((xCLOSEWAIT + 1 <= LISTEN)) AND F (G ((FINWAIT1 + 1 <= xFINWAIT2))))))))))
lola: processed formula length: 157
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 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: 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: 277 markings, 277 edges
lola: ========================================
lola: subprocess 10 will run for 553 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((LASTACK <= xSYNACK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((LASTACK <= xSYNACK))))
lola: processed formula length: 32
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 1
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: 947 markings, 983 edges
lola: ========================================
lola: subprocess 11 will run for 664 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((xLISTEN + 1 <= xCLOSING))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((xLISTEN + 1 <= xCLOSING))))
lola: processed formula length: 37
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 73 markings, 74 edges
lola: ========================================
lola: subprocess 12 will run for 830 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G (((xSYN + 1 <= xLASTACK) AND G (F ((xCLOSEWAIT <= 0)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G (((xSYN + 1 <= xLASTACK) AND G (F ((xCLOSEWAIT <= 0)))))))
lola: processed formula length: 66
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 277 markings, 278 edges
lola: ========================================
lola: subprocess 13 will run for 1107 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((1 <= LASTACK) OR ((LISTEN <= SYNSENT) U (xCLOSING <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((1 <= LASTACK) OR ((LISTEN <= SYNSENT) U (xCLOSING <= 0)))))
lola: processed formula length: 67
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 1 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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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 1661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((((xFINACK <= SYNSENT) AND (2 <= xLISTEN)) U (xSYN <= LISTEN)) OR (F ((xSYN <= LISTEN)) AND F (G ((LISTEN + 1 <= xSYN))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((((xFINACK <= SYNSENT) AND (2 <= xLISTEN)) U (xSYN <= LISTEN)) OR (F ((xSYN <= LISTEN)) AND F (G ((LISTEN + 1 <= xSYN))))))
lola: processed formula length: 127
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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 15 will run for 3322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= xSYNACK)))) AND A (G (((xSYNACK <= 0) OR F ((xCLOSING <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3322 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= xSYNACK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= xSYNACK))))
lola: processed formula length: 26
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1643441 markings, 6047205 edges, 328688 markings/sec, 0 secs
lola: 2947094 markings, 11387038 edges, 260731 markings/sec, 5 secs
lola: 4254404 markings, 16684211 edges, 261462 markings/sec, 10 secs
lola: 5442217 markings, 21898423 edges, 237563 markings/sec, 15 secs
lola: 6701082 markings, 27103630 edges, 251773 markings/sec, 20 secs
lola: 8115753 markings, 32773663 edges, 282934 markings/sec, 25 secs
lola: 9273285 markings, 37811271 edges, 231506 markings/sec, 30 secs
lola: 10421422 markings, 42991209 edges, 229627 markings/sec, 35 secs
lola: 11583934 markings, 48427362 edges, 232502 markings/sec, 40 secs
lola: 12852531 markings, 53885248 edges, 253719 markings/sec, 45 secs
lola: 14129258 markings, 59271493 edges, 255345 markings/sec, 50 secs
lola: 15434594 markings, 64865979 edges, 261067 markings/sec, 55 secs
lola: 16903516 markings, 70757025 edges, 293784 markings/sec, 60 secs
lola: 18102098 markings, 75857844 edges, 239716 markings/sec, 65 secs
lola: 19234973 markings, 80988613 edges, 226575 markings/sec, 70 secs
lola: 20382896 markings, 86255942 edges, 229585 markings/sec, 75 secs
lola: 21565147 markings, 91594450 edges, 236450 markings/sec, 80 secs
lola: 22661822 markings, 96742948 edges, 219335 markings/sec, 85 secs
lola: 23817663 markings, 102185241 edges, 231168 markings/sec, 90 secs
lola: 24935033 markings, 107709267 edges, 223474 markings/sec, 95 secs
lola: 26250171 markings, 113373096 edges, 263028 markings/sec, 100 secs
lola: 27357177 markings, 118374981 edges, 221401 markings/sec, 105 secs
lola: 28523194 markings, 123638958 edges, 233203 markings/sec, 110 secs
lola: 29848742 markings, 129093146 edges, 265110 markings/sec, 115 secs
lola: 31081992 markings, 134487956 edges, 246650 markings/sec, 120 secs
lola: 32332396 markings, 140009268 edges, 250081 markings/sec, 125 secs
lola: 33659265 markings, 145644167 edges, 265374 markings/sec, 130 secs
lola: 35121184 markings, 151379910 edges, 292384 markings/sec, 135 secs
lola: 36249984 markings, 156397003 edges, 225760 markings/sec, 140 secs
lola: 37390712 markings, 161440478 edges, 228146 markings/sec, 145 secs
lola: 38463202 markings, 166518437 edges, 214498 markings/sec, 150 secs
lola: 39575935 markings, 171526587 edges, 222547 markings/sec, 155 secs
lola: 40667183 markings, 176549145 edges, 218250 markings/sec, 160 secs
lola: 41733134 markings, 181671514 edges, 213190 markings/sec, 165 secs
lola: 42757659 markings, 186700940 edges, 204905 markings/sec, 170 secs
lola: 43956811 markings, 191998523 edges, 239830 markings/sec, 175 secs
lola: 44964221 markings, 196871269 edges, 201482 markings/sec, 180 secs
lola: 45952360 markings, 201852021 edges, 197628 markings/sec, 185 secs
lola: 47139581 markings, 207137145 edges, 237444 markings/sec, 190 secs
lola: 48245978 markings, 212508111 edges, 221279 markings/sec, 195 secs
lola: 49296785 markings, 217783369 edges, 210161 markings/sec, 200 secs
lola: 50320879 markings, 222962242 edges, 204819 markings/sec, 205 secs
lola: 51440482 markings, 228225192 edges, 223921 markings/sec, 210 secs
lola: 52665915 markings, 233512348 edges, 245087 markings/sec, 215 secs
lola: 53676261 markings, 238062445 edges, 202069 markings/sec, 220 secs
lola: 54657154 markings, 242688403 edges, 196179 markings/sec, 225 secs
lola: 55669336 markings, 247356901 edges, 202436 markings/sec, 230 secs
lola: 56647709 markings, 252114734 edges, 195675 markings/sec, 235 secs
lola: 57844175 markings, 257047296 edges, 239293 markings/sec, 240 secs
lola: 59051841 markings, 262066989 edges, 241533 markings/sec, 245 secs
lola: 60152399 markings, 266886420 edges, 220112 markings/sec, 250 secs
lola: 61291969 markings, 271914907 edges, 227914 markings/sec, 255 secs
lola: 62438956 markings, 277091364 edges, 229397 markings/sec, 260 secs
lola: 63619198 markings, 282395567 edges, 236048 markings/sec, 265 secs
lola: 64728272 markings, 287476232 edges, 221815 markings/sec, 270 secs
lola: 66057759 markings, 293102540 edges, 265897 markings/sec, 275 secs
lola: 67501165 markings, 298840442 edges, 288681 markings/sec, 280 secs
lola: 68777727 markings, 303975364 edges, 255312 markings/sec, 285 secs
lola: 69826281 markings, 308608837 edges, 209711 markings/sec, 290 secs
lola: 70829527 markings, 313144673 edges, 200649 markings/sec, 295 secs
lola: 71822444 markings, 317842577 edges, 198583 markings/sec, 300 secs
lola: 72841016 markings, 322431863 edges, 203714 markings/sec, 305 secs
lola: 73807542 markings, 326918724 edges, 193305 markings/sec, 310 secs
lola: 74835008 markings, 331792788 edges, 205493 markings/sec, 315 secs
lola: 75832134 markings, 336763993 edges, 199425 markings/sec, 320 secs
lola: 76946703 markings, 341628782 edges, 222914 markings/sec, 325 secs
lola: 77869607 markings, 346052064 edges, 184581 markings/sec, 330 secs
lola: 78751358 markings, 350380761 edges, 176350 markings/sec, 335 secs
lola: 79734990 markings, 355004265 edges, 196726 markings/sec, 340 secs
lola: 80737151 markings, 359618168 edges, 200432 markings/sec, 345 secs
lola: 81699544 markings, 364344531 edges, 192479 markings/sec, 350 secs
lola: 82666053 markings, 369224609 edges, 193302 markings/sec, 355 secs
lola: 83577017 markings, 373806557 edges, 182193 markings/sec, 360 secs
lola: 84626824 markings, 378760388 edges, 209961 markings/sec, 365 secs
lola: 85744398 markings, 383683260 edges, 223515 markings/sec, 370 secs
lola: 86688720 markings, 388258979 edges, 188864 markings/sec, 375 secs
lola: 87586823 markings, 392681806 edges, 179621 markings/sec, 380 secs
lola: 88514103 markings, 397249371 edges, 185456 markings/sec, 385 secs
lola: 89446636 markings, 402078480 edges, 186507 markings/sec, 390 secs
lola: 90491030 markings, 407029386 edges, 208879 markings/sec, 395 secs
lola: 91618095 markings, 412101083 edges, 225413 markings/sec, 400 secs
lola: 92694603 markings, 417362567 edges, 215302 markings/sec, 405 secs
lola: 93732591 markings, 422523885 edges, 207598 markings/sec, 410 secs
lola: 94739853 markings, 427589426 edges, 201452 markings/sec, 415 secs
lola: 95750960 markings, 432696340 edges, 202221 markings/sec, 420 secs
lola: 96364690 markings, 436021080 edges, 122746 markings/sec, 425 secs
lola: 96397724 markings, 436122768 edges, 6607 markings/sec, 430 secs
lola: 96407863 markings, 436177280 edges, 2028 markings/sec, 435 secs
lola: 96434317 markings, 436324123 edges, 5291 markings/sec, 440 secs
lola: 96442228 markings, 436369791 edges, 1582 markings/sec, 445 secs
lola: Child process aborted or communication problem between parent and child process
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: ...considering subproblem: (A (X (F (((xESTAB <= xCLOSING) OR (xFINACK <= SYNRCVD))))) AND A (X (G (((xESTAB <= xCLOSING) OR G (((FINWAIT1 + 1 <= TIMEWAIT) AND (xCLOSING + 1 <= xESTAB))))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (F (((xESTAB <= xCLOSING) OR (xFINACK <= SYNRCVD)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F (((xESTAB <= xCLOSING) OR (xFINACK <= SYNRCVD)))))
lola: processed formula length: 59
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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: 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: ========================================
lola: ========================================
lola: ...considering subproblem: A (X (G (((xESTAB <= xCLOSING) OR G (((FINWAIT1 + 1 <= TIMEWAIT) AND (xCLOSING + 1 <= xESTAB)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((xESTAB <= xCLOSING) OR G (((FINWAIT1 + 1 <= TIMEWAIT) AND (xCLOSING + 1 <= xESTAB)))))))
lola: processed formula length: 99
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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: 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: 277 markings, 277 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: (A (G (F ((1 <= xSYNACK)))) AND A (G (((xSYNACK <= 0) OR F ((xCLOSING <= 1))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: A (G (F ((1 <= xSYNACK))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((1 <= xSYNACK))))
lola: processed formula length: 26
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 1721049 markings, 6356936 edges, 344210 markings/sec, 0 secs
lola: 3173003 markings, 12319246 edges, 290391 markings/sec, 5 secs
lola: 4601360 markings, 18194495 edges, 285671 markings/sec, 10 secs
lola: 5873458 markings, 23729194 edges, 254420 markings/sec, 15 secs
lola: 7207086 markings, 29258977 edges, 266726 markings/sec, 20 secs
lola: 8614014 markings, 34893980 edges, 281386 markings/sec, 25 secs
lola: 9765248 markings, 39973165 edges, 230247 markings/sec, 30 secs
lola: 10900398 markings, 45111833 edges, 227030 markings/sec, 35 secs
lola: 12060984 markings, 50487895 edges, 232117 markings/sec, 40 secs
lola: 13352897 markings, 56199919 edges, 258383 markings/sec, 45 secs
lola: 14796541 markings, 62121937 edges, 288729 markings/sec, 50 secs
lola: 16223810 markings, 68197906 edges, 285454 markings/sec, 55 secs
lola: 17695526 markings, 74080860 edges, 294343 markings/sec, 60 secs
lola: 18931484 markings, 79552673 edges, 247192 markings/sec, 65 secs
lola: 20110408 markings, 84948392 edges, 235785 markings/sec, 70 secs
lola: 21349116 markings, 90590536 edges, 247742 markings/sec, 75 secs
lola: 22466415 markings, 95918676 edges, 223460 markings/sec, 80 secs
lola: 23696300 markings, 101586492 edges, 245977 markings/sec, 85 secs
lola: 24845913 markings, 107290889 edges, 229923 markings/sec, 90 secs
lola: 26188365 markings, 113097206 edges, 268490 markings/sec, 95 secs
lola: 27276718 markings, 118007163 edges, 217671 markings/sec, 100 secs
lola: 28370816 markings, 123040264 edges, 218820 markings/sec, 105 secs
lola: 29637339 markings, 128215421 edges, 253305 markings/sec, 110 secs
lola: 30829717 markings, 133362957 edges, 238476 markings/sec, 115 secs
lola: 32023501 markings, 138642510 edges, 238757 markings/sec, 120 secs
lola: 33157184 markings, 143678603 edges, 226737 markings/sec, 125 secs
lola: 34598981 markings, 149221310 edges, 288359 markings/sec, 130 secs
lola: 35765273 markings, 154157736 edges, 233258 markings/sec, 135 secs
lola: 36824119 markings, 158900202 edges, 211769 markings/sec, 140 secs
lola: 37852838 markings, 163602337 edges, 205744 markings/sec, 145 secs
lola: 38928022 markings, 168490673 edges, 215037 markings/sec, 150 secs
lola: 39899956 markings, 173131577 edges, 194387 markings/sec, 155 secs
lola: 41011081 markings, 178170181 edges, 222225 markings/sec, 160 secs
lola: 42103649 markings, 183484364 edges, 218514 markings/sec, 165 secs
lola: 43144771 markings, 188423355 edges, 208224 markings/sec, 170 secs
lola: 44231579 markings, 193305390 edges, 217362 markings/sec, 175 secs
lola: 45173869 markings, 197924836 edges, 188458 markings/sec, 180 secs
lola: 46202875 markings, 202913748 edges, 205801 markings/sec, 185 secs
lola: 47389862 markings, 208336054 edges, 237397 markings/sec, 190 secs
lola: 48490088 markings, 213734405 edges, 220045 markings/sec, 195 secs
lola: 49527687 markings, 218975838 edges, 207520 markings/sec, 200 secs
lola: 50514083 markings, 223978865 edges, 197279 markings/sec, 205 secs
lola: 51687214 markings, 229336814 edges, 234626 markings/sec, 210 secs
lola: 52850765 markings, 234357701 edges, 232710 markings/sec, 215 secs
lola: 53860266 markings, 238930113 edges, 201900 markings/sec, 220 secs
lola: 54941237 markings, 243929359 edges, 216194 markings/sec, 225 secs
lola: 55946612 markings, 248714729 edges, 201075 markings/sec, 230 secs
lola: 57049591 markings, 253747018 edges, 220596 markings/sec, 235 secs
lola: 58293582 markings, 258847505 edges, 248798 markings/sec, 240 secs
lola: 59494987 markings, 263996106 edges, 240281 markings/sec, 245 secs
lola: 60648912 markings, 269121059 edges, 230785 markings/sec, 250 secs
lola: 61765538 markings, 274105162 edges, 223325 markings/sec, 255 secs
lola: 62934873 markings, 279394051 edges, 233867 markings/sec, 260 secs
lola: 64090559 markings, 284508012 edges, 231137 markings/sec, 265 secs
lola: 65175065 markings, 289524565 edges, 216901 markings/sec, 270 secs
lola: 66526012 markings, 294999195 edges, 270189 markings/sec, 275 secs
lola: 67935273 markings, 300419686 edges, 281852 markings/sec, 280 secs
lola: 69085977 markings, 305317216 edges, 230141 markings/sec, 285 secs
lola: 70156427 markings, 310125880 edges, 214090 markings/sec, 290 secs
lola: 71237844 markings, 315103293 edges, 216283 markings/sec, 295 secs
lola: 72300941 markings, 319888560 edges, 212619 markings/sec, 300 secs
lola: 73212946 markings, 324277100 edges, 182401 markings/sec, 305 secs
lola: 74336785 markings, 329359496 edges, 224768 markings/sec, 310 secs
lola: 75370078 markings, 334396183 edges, 206659 markings/sec, 315 secs
lola: 76377773 markings, 339185660 edges, 201539 markings/sec, 320 secs
lola: 77493151 markings, 344194377 edges, 223076 markings/sec, 325 secs
lola: 78490545 markings, 349067223 edges, 199479 markings/sec, 330 secs
lola: 79498962 markings, 353964805 edges, 201683 markings/sec, 335 secs
lola: 80632471 markings, 359142201 edges, 226702 markings/sec, 340 secs
lola: 81692518 markings, 364309536 edges, 212009 markings/sec, 345 secs
lola: 82707866 markings, 369451510 edges, 203070 markings/sec, 350 secs
lola: 83681498 markings, 374362741 edges, 194726 markings/sec, 355 secs
lola: 84717801 markings, 379192762 edges, 207261 markings/sec, 360 secs
lola: 85847603 markings, 384157045 edges, 225960 markings/sec, 365 secs
lola: 86760054 markings, 388596590 edges, 182490 markings/sec, 370 secs
lola: 87648127 markings, 392993324 edges, 177615 markings/sec, 375 secs
lola: 88552621 markings, 397457662 edges, 180899 markings/sec, 380 secs
lola: 89421254 markings, 401940237 edges, 173727 markings/sec, 385 secs
lola: 90379830 markings, 406534856 edges, 191715 markings/sec, 390 secs
lola: 91421164 markings, 411185841 edges, 208267 markings/sec, 395 secs
lola: 92437085 markings, 416064733 edges, 203184 markings/sec, 400 secs
lola: 93402282 markings, 420858546 edges, 193039 markings/sec, 405 secs
lola: 94419949 markings, 425931985 edges, 203533 markings/sec, 410 secs
lola: 95350571 markings, 430679864 edges, 186124 markings/sec, 415 secs
lola: 96326304 markings, 435732502 edges, 195147 markings/sec, 420 secs
lola: 96442877 markings, 436373632 edges, 23315 markings/sec, 425 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (((xSYNACK <= 0) OR F ((xCLOSING <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (((xSYNACK <= 0) OR F ((xCLOSING <= 1)))))
lola: processed formula length: 47
lola: 105 rewrites
lola: closed formula file LTLCardinality.xml
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 with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 308513 markings, 488223 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no yes no no no no no no no no yes yes no no yes no
lola:
preliminary result: no yes no no no no no no no no yes yes no no yes no
lola: memory consumption: 23484 KB
lola: time consumption: 1137 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

BK_STOP 1590647945201

--------------------
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-30"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
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-4028"
echo " Executing tool win2019"
echo " Input is TCPcondis-PT-30, 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 r204-csrt-159033411700091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-30.tgz
mv TCPcondis-PT-30 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; 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
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;