About the Execution of 2019-Gold for RwMutex-PT-r1000w0010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.130 | 602821.00 | 605351.00 | 1549.70 | FF?FFFFTTTFFFF?F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fko/mcc2020-input.r165-oct2-158972939000081.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-input.qcow2 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 RwMutex-PT-r1000w0010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r165-oct2-158972939000081
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 2.8K Apr 12 12:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 14K Apr 12 12:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 11 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 13:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:38 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:38 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Apr 14 12:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 10 17:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 17:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 9 23:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 9 23:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 10 22:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 10 22:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 equiv_col
-rw-r--r-- 1 mcc users 11 Mar 24 05:38 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:38 iscolored
-rw-r--r-- 1 mcc users 2.0M 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 RwMutex-PT-r1000w0010-00
FORMULA_NAME RwMutex-PT-r1000w0010-01
FORMULA_NAME RwMutex-PT-r1000w0010-02
FORMULA_NAME RwMutex-PT-r1000w0010-03
FORMULA_NAME RwMutex-PT-r1000w0010-04
FORMULA_NAME RwMutex-PT-r1000w0010-05
FORMULA_NAME RwMutex-PT-r1000w0010-06
FORMULA_NAME RwMutex-PT-r1000w0010-07
FORMULA_NAME RwMutex-PT-r1000w0010-08
FORMULA_NAME RwMutex-PT-r1000w0010-09
FORMULA_NAME RwMutex-PT-r1000w0010-10
FORMULA_NAME RwMutex-PT-r1000w0010-11
FORMULA_NAME RwMutex-PT-r1000w0010-12
FORMULA_NAME RwMutex-PT-r1000w0010-13
FORMULA_NAME RwMutex-PT-r1000w0010-14
FORMULA_NAME RwMutex-PT-r1000w0010-15
=== Now, execution of the tool begins
BK_START 1590264374993
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RwMutex-PT-r1000w0010 @ 3570 seconds
FORMULA RwMutex-PT-r1000w0010-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA RwMutex-PT-r1000w0010-14 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2968
rslt: Output for LTLCardinality @ RwMutex-PT-r1000w0010
{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Sat May 23 20:06:15 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 220
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "FALSE",
"processed_size": 5,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 235
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "TRUE",
"processed_size": 4,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 252
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "TRUE",
"processed_size": 4,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 271
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "FALSE",
"processed_size": 5,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 294
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "FALSE",
"processed_size": 5,
"rewrites": 99
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 321
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (F ((X ((p2785 + 1 <= p1533)) OR ((p86 + 1 <= p3002) AND G ((p86 + 1 <= p3002))))))",
"processed_size": 85,
"rewrites": 99
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"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": 353
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 3,
"aconj": 1,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X (G ((X (((p2536 + 1 <= p939) R ((p2275 + 1 <= p1339)))) R (p1339 <= p2275))))))",
"processed_size": 87,
"rewrites": 99
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 392
},
"exit":
{
"localtimelimitreached": false
},
"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": 99
},
"result":
{
"edges": 1010,
"markings": 1011,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 441
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X (X (X (X ((F ((p1321 <= p2491)) AND G ((p509 <= p1491)))))))))",
"processed_size": 70,
"rewrites": 99
},
"result":
{
"edges": 602,
"markings": 602,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 8,
"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": 566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 1,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (G (((p2507 <= p538) AND (F ((p2507 <= p538)) U (p283 <= p1682))))))",
"processed_size": 73,
"rewrites": 99
},
"result":
{
"edges": 1130,
"markings": 1130,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 679
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "A (G (F ((G ((1 <= p188)) OR X (X ((p2463 <= p2939)))))))",
"processed_size": 57,
"rewrites": 99
},
"result":
{
"edges": 1805,
"markings": 1805,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 11,
"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": 1087
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"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 (X (X (X (F ((1 <= p123)))))))",
"processed_size": 35,
"rewrites": 99
},
"result":
{
"edges": 1178,
"markings": 1178,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 13,
"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": 1630
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"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 (G ((p1060 <= p2076)))",
"processed_size": 24,
"rewrites": 101
},
"result":
{
"edges": 22,
"markings": 13,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3261
},
"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 (G (F ((p1323 + 1 <= p1437))))",
"processed_size": 32,
"rewrites": 99
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 149212,
"runtime": 578.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(X(G((X((* R *)) R *))))) : A(X(X(X(X(X((F(**) AND G(**)))))))) : A(G(F((** OR (X(**) OR F(G(*))))))) : A(X(G((** AND (F(**) U **))))) : A(G(F((G(**) OR X(X(**)))))) : A(F((X(*) OR (* AND G(*))))) : FALSE : A(X(TRUE)) : TRUE : TRUE : FALSE : FALSE : A(G(**)) : A(G(F(**))) : A(X(G(**))) : A(X(X(X(X(F(**))))))"
},
"net":
{
"arcs": 26040,
"conflict_clusters": 1011,
"places": 3020,
"places_significant": 1010,
"singleton_clusters": 0,
"transitions": 2020
},
"result":
{
"preliminary_value": "no no unknown no no no no yes yes yes no no no no unknown no ",
"value": "no no unknown no no no no yes yes yes no no no no unknown 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: 5040/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 3020
lola: finding significant places
lola: 3020 places, 2020 transitions, 1010 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: LP says that atomic proposition is always false: (3 <= p1801)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p10)
lola: LP says that atomic proposition is always false: (2 <= p410)
lola: LP says that atomic proposition is always false: (3 <= p228)
lola: LP says that atomic proposition is always false: (2 <= p1131)
lola: LP says that atomic proposition is always false: (2 <= p1131)
lola: LP says that atomic proposition is always false: (2 <= p1131)
lola: LP says that atomic proposition is always false: (3 <= p1554)
lola: LP says that atomic proposition is always false: (2 <= p62)
lola: LP says that atomic proposition is always false: (3 <= p2763)
lola: LP says that atomic proposition is always false: (3 <= p2763)
lola: LP says that atomic proposition is always false: (2 <= p2298)
lola: LP says that atomic proposition is always false: (2 <= p2493)
lola: LP says that atomic proposition is always false: (3 <= p750)
lola: A (X (G (NOT(X ((X (((p939 <= p2536) U ((p1339 <= p2275)))) U (p2275 + 1 <= p1339))))))) : A (X (X (X (X (X (((F ((p509 <= p1491)) U F ((p1321 <= p2491))) AND ((3 <= p1801) OR G ((p509 <= p1491)))))))))) : A (G (F (((2 <= p10) U (((p2457 <= p3001) OR X ((1 <= p2877))) OR F (NOT(F (((1 <= p2877)))))))))) : A (G (X (((p2507 <= p538) AND (F ((p2507 <= p538)) U (p283 <= p1682)))))) : A (X (G (F ((G ((1 <= p188)) OR X (X ((p2463 <= p2939)))))))) : A (F (NOT((X ((p1533 <= p2785)) AND ((p3002 <= p86) OR F (((p1533 <= p2785) U ((p1533 <= p2785) U (p3002 <= p86))))))))) : A (F (X (G (NOT(X (G (NOT(G (X (((2 <= p410) AND X (G ((p1423 <= p1224)))))))))))))) : A (X ((NOT(X (F ((3 <= p228)))) AND (((p1468 <= p2844)) U NOT(((2 <= p1131) AND G ((2 <= p1131)))))))) : A (NOT(F ((((0 <= p2967) U (1 <= p2987)) AND F (X (NOT(G ((0 <= p2967))))))))) : A (G ((p1554 <= 2))) : A (F (())) : A ((((3 <= p2763) AND X (F (X (X (X ((p1598 <= p1410))))))) AND X ((3 <= p2763)))) : A ((G ((p1060 <= p2076)) AND F (NOT(G (((p1060 <= p2076) U (2 <= p2298))))))) : A (F ((X ((2 <= p2493)) U G (X (F ((p1323 + 1 <= p1437))))))) : A ((G (X (((p2061 + 1 <= p1436) OR (p2619 <= p1419) OR (p1095 <= p2286)))) AND NOT(G ((3 <= p750))))) : A (F (X (X (X (X (F ((1 <= p123))))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:254
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:315
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:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:166
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
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:145
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:117
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:282
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:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:180
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:282
lola: rewrite Frontend/Parser/formula_rewrite.k:115
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 220 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: TRUE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: TRUE
lola: processed formula length: 4
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 271 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 0 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 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((X ((p2785 + 1 <= p1533)) OR ((p86 + 1 <= p3002) AND G ((p86 + 1 <= p3002))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((X ((p2785 + 1 <= p1533)) OR ((p86 + 1 <= p3002) AND G ((p86 + 1 <= p3002))))))
lola: processed formula length: 85
lola: 99 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: 602 markings, 602 edges
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((X (((p2536 + 1 <= p939) R ((p2275 + 1 <= p1339)))) R (p1339 <= p2275))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((X (((p2536 + 1 <= p939) R ((p2275 + 1 <= p1339)))) R (p1339 <= p2275))))))
lola: processed formula length: 87
lola: 99 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: 602 markings, 602 edges
lola: ========================================
lola: subprocess 7 will run for 392 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: 99 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: 1011 markings, 1010 edges
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X (X ((F ((p1321 <= p2491)) AND G ((p509 <= p1491)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X (X ((F ((p1321 <= p2491)) AND G ((p509 <= p1491)))))))))
lola: processed formula length: 70
lola: 99 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: 602 markings, 602 edges
lola: ========================================
lola: subprocess 9 will run for 504 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F (((p2457 <= p3001) OR (X ((1 <= p2877)) OR F (G (((p2877 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p2457 <= p3001) OR (X ((1 <= p2877)) OR F (G (((p2877 <= 0)))))))))
lola: processed formula length: 78
lola: 99 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: 173532 markings, 819275 edges, 34706 markings/sec, 0 secs
lola: 332633 markings, 1648149 edges, 31820 markings/sec, 5 secs
lola: 491873 markings, 2477797 edges, 31848 markings/sec, 10 secs
lola: 642299 markings, 3326011 edges, 30085 markings/sec, 15 secs
lola: 803022 markings, 4196166 edges, 32145 markings/sec, 20 secs
lola: 962354 markings, 5085397 edges, 31866 markings/sec, 25 secs
lola: 1120113 markings, 5946464 edges, 31552 markings/sec, 30 secs
lola: 1281695 markings, 6839820 edges, 32316 markings/sec, 35 secs
lola: 1435014 markings, 7704638 edges, 30664 markings/sec, 40 secs
lola: 1584492 markings, 8571287 edges, 29896 markings/sec, 45 secs
lola: 1729543 markings, 9472812 edges, 29010 markings/sec, 50 secs
lola: 1872927 markings, 10308572 edges, 28677 markings/sec, 55 secs
lola: 2010787 markings, 11153801 edges, 27572 markings/sec, 60 secs
lola: 2151332 markings, 11987191 edges, 28109 markings/sec, 65 secs
lola: 2307158 markings, 12822013 edges, 31165 markings/sec, 70 secs
lola: 2455052 markings, 13663833 edges, 29579 markings/sec, 75 secs
lola: 2603226 markings, 14510317 edges, 29635 markings/sec, 80 secs
lola: 2742450 markings, 15362248 edges, 27845 markings/sec, 85 secs
lola: 2884733 markings, 16210032 edges, 28457 markings/sec, 90 secs
lola: 3026711 markings, 17057944 edges, 28396 markings/sec, 95 secs
lola: 3164165 markings, 17905698 edges, 27491 markings/sec, 100 secs
lola: 3318721 markings, 18735961 edges, 30911 markings/sec, 105 secs
lola: 3467185 markings, 19570793 edges, 29693 markings/sec, 110 secs
lola: 3614167 markings, 20407404 edges, 29396 markings/sec, 115 secs
lola: 3760951 markings, 21292328 edges, 29357 markings/sec, 120 secs
lola: 3892695 markings, 22109414 edges, 26349 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 10 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p2507 <= p538) AND (F ((p2507 <= p538)) U (p283 <= p1682))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p2507 <= p538) AND (F ((p2507 <= p538)) U (p283 <= p1682))))))
lola: processed formula length: 73
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 1130 markings, 1130 edges
lola: ========================================
lola: subprocess 11 will run for 679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((G ((1 <= p188)) OR X (X ((p2463 <= p2939)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((G ((1 <= p188)) OR X (X ((p2463 <= p2939)))))))
lola: processed formula length: 57
lola: 99 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: 1805 markings, 1805 edges
lola: ========================================
lola: subprocess 12 will run for 849 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G (((p2061 + 1 <= p1436) OR (p2619 <= p1419) OR (p1095 <= p2286)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p2061 + 1 <= p1436) OR (p2619 <= p1419) OR (p1095 <= p2286)))))
lola: processed formula length: 76
lola: 99 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: 180087 markings, 855701 edges, 36017 markings/sec, 0 secs
lola: 332928 markings, 1649782 edges, 30568 markings/sec, 5 secs
lola: 487867 markings, 2456333 edges, 30988 markings/sec, 10 secs
lola: 633959 markings, 3279183 edges, 29218 markings/sec, 15 secs
lola: 784609 markings, 4101710 edges, 30130 markings/sec, 20 secs
lola: 934147 markings, 4931467 edges, 29908 markings/sec, 25 secs
lola: 1083445 markings, 5761081 edges, 29860 markings/sec, 30 secs
lola: 1237916 markings, 6583214 edges, 30894 markings/sec, 35 secs
lola: 1381361 markings, 7403258 edges, 28689 markings/sec, 40 secs
lola: 1526606 markings, 8230086 edges, 29049 markings/sec, 45 secs
lola: 1662005 markings, 9058486 edges, 27080 markings/sec, 50 secs
lola: 1796823 markings, 9872776 edges, 26964 markings/sec, 55 secs
lola: 1936318 markings, 10681787 edges, 27899 markings/sec, 60 secs
lola: 2067199 markings, 11489757 edges, 26176 markings/sec, 65 secs
lola: 2210011 markings, 12292505 edges, 28562 markings/sec, 70 secs
lola: 2354150 markings, 13096730 edges, 28828 markings/sec, 75 secs
lola: 2499307 markings, 13912312 edges, 29031 markings/sec, 80 secs
lola: 2639110 markings, 14722085 edges, 27961 markings/sec, 85 secs
lola: 2771005 markings, 15533610 edges, 26379 markings/sec, 90 secs
lola: 2905415 markings, 16332111 edges, 26882 markings/sec, 95 secs
lola: 3040058 markings, 17140702 edges, 26929 markings/sec, 100 secs
lola: 3169821 markings, 17941882 edges, 25953 markings/sec, 105 secs
lola: 3323048 markings, 18758311 edges, 30645 markings/sec, 110 secs
lola: 3470393 markings, 19587908 edges, 29469 markings/sec, 115 secs
lola: 3614430 markings, 20409039 edges, 28807 markings/sec, 120 secs
lola: 3750755 markings, 21227660 edges, 27265 markings/sec, 125 secs
lola: 3883515 markings, 22050385 edges, 26552 markings/sec, 130 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1087 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (X (X (F ((1 <= p123)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (X (X (F ((1 <= p123)))))))
lola: processed formula length: 35
lola: 99 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 1178 markings, 1178 edges
lola: ========================================
lola: subprocess 14 will run for 1630 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((p1060 <= p2076)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G ((p1060 <= p2076)))
lola: processed formula length: 24
lola: 101 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (p2076 + 1 <= p1060)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 13 markings, 22 edges
lola: subprocess 15 will run for 3261 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((p1323 + 1 <= p1437))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((p1323 + 1 <= p1437))))
lola: processed formula length: 32
lola: 99 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: 3 markings, 3 edges
lola: ========================================
lola: ...considering subproblem: A (G (F (((p2457 <= p3001) OR (X ((1 <= p2877)) OR F (G (((p2877 <= 0)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F (((p2457 <= p3001) OR (X ((1 <= p2877)) OR F (G (((p2877 <= 0)))))))))
lola: processed formula length: 78
lola: 99 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: ========================================
lola: ========================================
lola: 168745 markings, 794423 edges, 33749 markings/sec, 0 secs
lola: 330990 markings, 1639372 edges, 32449 markings/sec, 5 secs
lola: 493043 markings, 2484512 edges, 32411 markings/sec, 10 secs
lola: 641517 markings, 3321438 edges, 29695 markings/sec, 15 secs
lola: 797379 markings, 4167184 edges, 31172 markings/sec, 20 secs
lola: 949710 markings, 5020252 edges, 30466 markings/sec, 25 secs
lola: 1104181 markings, 5865280 edges, 30894 markings/sec, 30 secs
lola: 1259832 markings, 6715942 edges, 31130 markings/sec, 35 secs
lola: 1410356 markings, 7571676 edges, 30105 markings/sec, 40 secs
lola: 1560356 markings, 8426775 edges, 30000 markings/sec, 45 secs
lola: 1700467 markings, 9286507 edges, 28022 markings/sec, 50 secs
lola: 1843223 markings, 10136046 edges, 28551 markings/sec, 55 secs
lola: 1983642 markings, 10980013 edges, 28084 markings/sec, 60 secs
lola: 2119793 markings, 11825131 edges, 27230 markings/sec, 65 secs
lola: 2277268 markings, 12651870 edges, 31495 markings/sec, 70 secs
lola: 2424071 markings, 13484200 edges, 29361 markings/sec, 75 secs
lola: 2570172 markings, 14315998 edges, 29220 markings/sec, 80 secs
lola: 2710937 markings, 15175850 edges, 28153 markings/sec, 85 secs
lola: 2851040 markings, 16024479 edges, 28021 markings/sec, 90 secs
lola: 2996589 markings, 16866242 edges, 29110 markings/sec, 95 secs
lola: 3133274 markings, 17711360 edges, 27337 markings/sec, 100 secs
lola: 3284288 markings, 18551565 edges, 30203 markings/sec, 105 secs
lola: 3436565 markings, 19403835 edges, 30455 markings/sec, 110 secs
lola: 3587766 markings, 20253165 edges, 30240 markings/sec, 115 secs
lola: 3731391 markings, 21106528 edges, 28725 markings/sec, 120 secs
lola: 3869986 markings, 21963188 edges, 27719 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (X (G (((p2061 + 1 <= p1436) OR (p2619 <= p1419) OR (p1095 <= p2286)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G (((p2061 + 1 <= p1436) OR (p2619 <= p1419) OR (p1095 <= p2286)))))
lola: processed formula length: 76
lola: 99 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: 172283 markings, 812782 edges, 34457 markings/sec, 0 secs
lola: 328469 markings, 1626727 edges, 31237 markings/sec, 5 secs
lola: 489957 markings, 2467515 edges, 32298 markings/sec, 10 secs
lola: 640306 markings, 3314580 edges, 30070 markings/sec, 15 secs
lola: 795310 markings, 4156616 edges, 31001 markings/sec, 20 secs
lola: 945046 markings, 4997877 edges, 29947 markings/sec, 25 secs
lola: 1098776 markings, 5838297 edges, 30746 markings/sec, 30 secs
lola: 1254390 markings, 6682255 edges, 31123 markings/sec, 35 secs
lola: 1403795 markings, 7533567 edges, 29881 markings/sec, 40 secs
lola: 1553064 markings, 8382204 edges, 29854 markings/sec, 45 secs
lola: 1692089 markings, 9237007 edges, 27805 markings/sec, 50 secs
lola: 1835280 markings, 10089155 edges, 28638 markings/sec, 55 secs
lola: 1978081 markings, 10946000 edges, 28560 markings/sec, 60 secs
lola: 2115736 markings, 11799136 edges, 27531 markings/sec, 65 secs
lola: 2276080 markings, 12645243 edges, 32069 markings/sec, 70 secs
lola: 2425871 markings, 13494980 edges, 29958 markings/sec, 75 secs
lola: 2575340 markings, 14345561 edges, 29894 markings/sec, 80 secs
lola: 2715219 markings, 15204376 edges, 27976 markings/sec, 85 secs
lola: 2855604 markings, 16049604 edges, 28077 markings/sec, 90 secs
lola: 2999507 markings, 16883905 edges, 28781 markings/sec, 95 secs
lola: 3135425 markings, 17725810 edges, 27184 markings/sec, 100 secs
lola: 3289337 markings, 18579745 edges, 30782 markings/sec, 105 secs
lola: 3443126 markings, 19438075 edges, 30758 markings/sec, 110 secs
lola: 3595845 markings, 20299203 edges, 30544 markings/sec, 115 secs
lola: 3739251 markings, 21158599 edges, 28681 markings/sec, 120 secs
lola: 3879634 markings, 22024569 edges, 28077 markings/sec, 125 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no unknown no no no no yes yes yes no no no no unknown no
lola:
preliminary result: no no unknown no no no no yes yes yes no no no no unknown no
lola: memory consumption: 149212 KB
lola: time consumption: 578 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1590264977814
--------------------
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="RwMutex-PT-r1000w0010"
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 RwMutex-PT-r1000w0010, 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 r165-oct2-158972939000081"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/RwMutex-PT-r1000w0010.tgz
mv RwMutex-PT-r1000w0010 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 '
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 ;