About the Execution of LoLA for SmallOperatingSystem-PT-MT8192DC2048
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15918.780 | 726038.00 | 743874.00 | 475.70 | T??FFFTFFFTFTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/local/x2003239/mcc2019-input.r159-csrt-155286431200492.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2019-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-3954
Executing tool lola
Input is SmallOperatingSystem-PT-MT8192DC2048, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-csrt-155286431200492
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 192K
-rw-r--r-- 1 mcc users 4.4K Feb 12 18:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Feb 12 18:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 9 02:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 9 02:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 123 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 361 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 3.1K Feb 5 01:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K Feb 5 01:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 8.8K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 4 20:40 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Feb 4 20:40 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Feb 1 21:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 1 21:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 13 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 8.1K Mar 10 17:31 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-00
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-01
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-02
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-03
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-04
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-05
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-06
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-07
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-08
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-09
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-10
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-11
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-12
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-13
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-14
FORMULA_NAME SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552953121872
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SmallOperatingSystem-PT-MT8192DC2048 @ 3570 seconds
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SmallOperatingSystem-PT-MT8192DC2048-LTLCardinality-01 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2844
rslt: Output for LTLCardinality @ SmallOperatingSystem-PT-MT8192DC2048
{
"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": "Mon Mar 18 23:52:01 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 222
},
"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": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 237
},
"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": 30
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 30
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 274
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (X ((F ((3 <= TaskSuspended)) OR (G ((3 <= TaskReady)) AND F ((3 <= TaskSuspended))))))",
"processed_size": 89,
"rewrites": 30
},
"result":
{
"edges": 4,
"markings": 4,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 1,
"aconj": 0,
"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": "A (((1 <= DiskControllerUnit) U X (F ((ExecutingTask <= LoadingMem)))))",
"processed_size": 71,
"rewrites": 30
},
"result":
{
"edges": 1,
"markings": 2,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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 (X (G ((TransferToDisk <= TaskSuspended))))",
"processed_size": 45,
"rewrites": 30
},
"result":
{
"edges": 32775,
"markings": 24583,
"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": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 2,
"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 (X (X (F ((LoadingMem <= CPUUnit)))))",
"processed_size": 39,
"rewrites": 30
},
"result":
{
"edges": 3,
"markings": 4,
"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": 396
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((1 <= DiskControllerUnit)))",
"processed_size": 33,
"rewrites": 32
},
"result":
{
"edges": 2048,
"markings": 2049,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 7,
"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": 445
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (G ((2 <= CPUUnit)))",
"processed_size": 22,
"rewrites": 32
},
"result":
{
"edges": 83814423,
"markings": 48200713,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 8,
"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": 498
},
"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 ((TaskSuspended <= DiskControllerUnit)))",
"processed_size": 45,
"rewrites": 32
},
"result":
{
"edges": 14339,
"markings": 14339,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 9,
"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": 581
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(ExecutingTask + 1 <= TaskSuspended)",
"processed_size": 36,
"rewrites": 32
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 697
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(TaskSuspended + 1 <= FreeMemSegment)",
"processed_size": 37,
"rewrites": 32
},
"result":
{
"edges": 3,
"markings": 3,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1114
},
"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 ((ExecutingTask <= TaskReady))))",
"processed_size": 40,
"rewrites": 30
},
"result":
{
"edges": 73460736,
"markings": 44076033,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 1636
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (((2 <= LoadingMem) OR (G ((TaskSuspended <= LoadingMem)) AND F ((2 <= LoadingMem))))))",
"processed_size": 92,
"rewrites": 30
},
"result":
{
"edges": 8,
"markings": 7,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 14,
"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": 17108,
"runtime": 726.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X(TRUE)) : A(G(F(**))) : A(F(G(**))) : A(G(**)) : A(F(**)) : FALSE : TRUE : A(G(**)) : A(G(**)) : A(X((F(**) OR (G(**) AND F(**))))) : A((** U X(F(**)))) : A(X(G(**))) : A(F(**)) : A(F(G(**))) : A(F((** OR (G(**) AND F(**))))) : A(X(X(F(**))))"
},
"net":
{
"arcs": 27,
"conflict_clusters": 4,
"places": 9,
"places_significant": 5,
"singleton_clusters": 0,
"transitions": 8
},
"result":
{
"preliminary_value": "yes unknown unknown no no no yes no no no yes no yes no no yes ",
"value": "yes unknown unknown no no no yes no no no yes no yes no no yes "
},
"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: 17/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 288
lola: finding significant places
lola: 9 places, 8 transitions, 5 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 true: (ExecutingTask <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (ExecutingTask <= TaskOnDisk)
lola: LP says that atomic proposition is always true: (CPUUnit <= TaskOnDisk)
lola: place invariant simplifies atomic proposition
lola: before: (TaskOnDisk <= DiskControllerUnit)
lola: after: (6144 <= 0)
lola: LP says that atomic proposition is always true: (2 <= TaskOnDisk)
lola: A ((G ((ExecutingTask <= TaskOnDisk)) U X ((ExecutingTask <= TaskOnDisk)))) : A (G ((X ((ExecutingTask <= CPUUnit)) U F ((ExecutingTask <= FreeMemSegment))))) : A ((G (X ((TaskReady <= LoadingMem))) U F (G ((3 <= CPUUnit))))) : A (G ((TaskSuspended <= DiskControllerUnit))) : A (F ((FreeMemSegment <= TaskSuspended))) : A ((G (F ((CPUUnit <= TaskOnDisk))) U X ((6144 <= 0)))) : A ((2 <= TaskOnDisk)) : A (G (G ((1 <= DiskControllerUnit)))) : A (G ((2 <= CPUUnit))) : A (X ((G ((3 <= TaskReady)) U F ((3 <= TaskSuspended))))) : A (((1 <= DiskControllerUnit) U F (X ((ExecutingTask <= LoadingMem))))) : A (G (X (G (G ((TransferToDisk <= TaskSuspended)))))) : A (F ((TaskSuspended <= ExecutingTask))) : A (F ((F ((TaskOnDisk <= TaskReady)) U G ((ExecutingTask <= TaskReady))))) : A (F ((G ((TaskSuspended <= LoadingMem)) U (2 <= LoadingMem)))) : A (F (X (X ((LoadingMem <= CPUUnit)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:434
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: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 222 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: 30 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 237 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: 30 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 254 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: 30 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((3 <= TaskSuspended)) OR (G ((3 <= TaskReady)) AND F ((3 <= TaskSuspended))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((3 <= TaskSuspended)) OR (G ((3 <= TaskReady)) AND F ((3 <= TaskSuspended))))))
lola: processed formula length: 89
lola: 30 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: 4 markings, 4 edges
lola: ========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (((1 <= DiskControllerUnit) U X (F ((ExecutingTask <= LoadingMem)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (((1 <= DiskControllerUnit) U X (F ((ExecutingTask <= LoadingMem)))))
lola: processed formula length: 71
lola: 30 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: 2 markings, 1 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((TransferToDisk <= TaskSuspended))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((TransferToDisk <= TaskSuspended))))
lola: processed formula length: 45
lola: 30 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: 24583 markings, 32775 edges
lola: ========================================
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((LoadingMem <= CPUUnit)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((LoadingMem <= CPUUnit)))))
lola: processed formula length: 39
lola: 30 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((1 <= DiskControllerUnit)))
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 ((1 <= DiskControllerUnit)))
lola: processed formula length: 33
lola: 32 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: (DiskControllerUnit <= 0)
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: 2049 markings, 2048 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((2 <= CPUUnit)))
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 ((2 <= CPUUnit)))
lola: processed formula length: 22
lola: 32 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: (CPUUnit <= 1)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-8-0.sara
lola: state equation: calling and running sara
sara: try reading problem file LTLCardinality-8-0.sara.
sara: place or transition ordering is non-deterministic
lola: sara is running 0 secs || 4757113 markings, 7135666 edges, 951423 markings/sec, 0 secs
lola: sara is running 5 secs || 9252456 markings, 13878682 edges, 899069 markings/sec, 5 secs
lola: sara is running 10 secs || 13383957 markings, 20087249 edges, 826300 markings/sec, 10 secs
lola: sara is running 15 secs || 17072230 markings, 25929453 edges, 737655 markings/sec, 15 secs
lola: sara is running 20 secs || 20361740 markings, 31427131 edges, 657902 markings/sec, 20 secs
lola: sara is running 25 secs || 23689871 markings, 37208492 edges, 665626 markings/sec, 25 secs
lola: sara is running 30 secs || 27176922 markings, 43454281 edges, 697410 markings/sec, 30 secs
lola: sara is running 35 secs || 29938532 markings, 48513977 edges, 552322 markings/sec, 35 secs
lola: sara is running 40 secs || 32476811 markings, 53244792 edges, 507656 markings/sec, 40 secs
lola: sara is running 45 secs || 35068137 markings, 58143732 edges, 518265 markings/sec, 45 secs
lola: sara is running 50 secs || 37650269 markings, 63085809 edges, 516426 markings/sec, 50 secs
lola: sara is running 55 secs || 40210459 markings, 68041629 edges, 512038 markings/sec, 55 secs
lola: sara is running 60 secs || 42745120 markings, 72999353 edges, 506932 markings/sec, 60 secs
lola: sara is running 65 secs || 45260331 markings, 77965933 edges, 503042 markings/sec, 65 secs
lola: sara is running 70 secs || 47738279 markings, 82893665 edges, 495590 markings/sec, 70 secs
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 48200713 markings, 83814423 edges
lola: ========================================
lola: subprocess 9 will run for 498 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((TaskSuspended <= DiskControllerUnit)))
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 ((TaskSuspended <= DiskControllerUnit)))
lola: processed formula length: 45
lola: 32 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: (DiskControllerUnit + 1 <= TaskSuspended)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to LTLCardinality-9-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 14339 markings, 14339 edges
lola: ========================================
lola: subprocess 10 will run for 581 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((TaskSuspended <= ExecutingTask)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (ExecutingTask + 1 <= TaskSuspended)
lola: processed formula length: 36
lola: 32 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 11 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((FreeMemSegment <= TaskSuspended)))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (TaskSuspended + 1 <= FreeMemSegment)
lola: processed formula length: 37
lola: 32 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 / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 3 markings, 3 edges
lola: ========================================
lola: subprocess 12 will run for 872 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= CPUUnit))))
lola: processed formula length: 26
lola: 30 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: 4147252 markings, 6220208 edges, 829450 markings/sec, 0 secs
lola: 8012949 markings, 12018190 edges, 773139 markings/sec, 5 secs
lola: 11795434 markings, 17691573 edges, 756497 markings/sec, 10 secs
lola: 15478778 markings, 23214454 edges, 736669 markings/sec, 15 secs
lola: 19057958 markings, 28583290 edges, 715836 markings/sec, 20 secs
lola: 22512635 markings, 33768691 edges, 690935 markings/sec, 25 secs
lola: 25989472 markings, 38981913 edges, 695367 markings/sec, 30 secs
lola: 29541133 markings, 44310956 edges, 710332 markings/sec, 35 secs
lola: 32890063 markings, 49332701 edges, 669786 markings/sec, 40 secs
lola: 36235983 markings, 54353888 edges, 669184 markings/sec, 45 secs
lola: 39497840 markings, 59244251 edges, 652371 markings/sec, 50 secs
lola: 42825236 markings, 64235096 edges, 665479 markings/sec, 55 secs
lola: 46048580 markings, 69071296 edges, 644669 markings/sec, 60 secs
lola: 49370688 markings, 74055633 edges, 664422 markings/sec, 65 secs
lola: 52721616 markings, 79081554 edges, 670186 markings/sec, 70 secs
lola: 56048420 markings, 84070201 edges, 665361 markings/sec, 75 secs
lola: 59345670 markings, 89017124 edges, 659450 markings/sec, 80 secs
lola: 62751124 markings, 94124276 edges, 681091 markings/sec, 85 secs
lola: 65991725 markings, 98985497 edges, 648120 markings/sec, 90 secs
lola: 69243197 markings, 103862143 edges, 650294 markings/sec, 95 secs
lola: 72528588 markings, 108790255 edges, 657078 markings/sec, 100 secs
lola: 75785545 markings, 113677571 edges, 651391 markings/sec, 105 secs
lola: 79015522 markings, 118520709 edges, 645995 markings/sec, 110 secs
lola: 82218484 markings, 123327422 edges, 640592 markings/sec, 115 secs
lola: 85549618 markings, 128324044 edges, 666227 markings/sec, 120 secs
lola: 88867323 markings, 133300763 edges, 663541 markings/sec, 125 secs
lola: 92003834 markings, 138004178 edges, 627302 markings/sec, 130 secs
lola: 95325971 markings, 142988645 edges, 664427 markings/sec, 135 secs
lola: 97348952 markings, 146022878 edges, 404596 markings/sec, 140 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 13 will run for 1114 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((ExecutingTask <= TaskReady))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((ExecutingTask <= TaskReady))))
lola: processed formula length: 40
lola: 30 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: 3838018 markings, 6393787 edges, 767604 markings/sec, 0 secs
lola: 7507262 markings, 12506512 edges, 733849 markings/sec, 5 secs
lola: 10945554 markings, 18235171 edges, 687658 markings/sec, 10 secs
lola: 14321293 markings, 23860604 edges, 675148 markings/sec, 15 secs
lola: 17726703 markings, 29536694 edges, 681082 markings/sec, 20 secs
lola: 21144958 markings, 35234490 edges, 683651 markings/sec, 25 secs
lola: 24316961 markings, 40523824 edges, 634401 markings/sec, 30 secs
lola: 27655777 markings, 46086370 edges, 667763 markings/sec, 35 secs
lola: 30911483 markings, 51514481 edges, 651141 markings/sec, 40 secs
lola: 34060820 markings, 56761170 edges, 629867 markings/sec, 45 secs
lola: 37404722 markings, 62336753 edges, 668780 markings/sec, 50 secs
lola: 40507683 markings, 67505183 edges, 620592 markings/sec, 55 secs
lola: 43597825 markings, 72658269 edges, 618028 markings/sec, 60 secs
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 44076033 markings, 73460736 edges
lola: 44076033 markings, 73460736 edges, 95642 markings/sec, 65 secs
lola: ========================================
lola: subprocess 14 will run for 1636 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((2 <= LoadingMem) OR (G ((TaskSuspended <= LoadingMem)) AND F ((2 <= LoadingMem))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((2 <= LoadingMem) OR (G ((TaskSuspended <= LoadingMem)) AND F ((2 <= LoadingMem))))))
lola: processed formula length: 92
lola: 30 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: add low 6
lola: add low 2
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: 7 markings, 8 edges
lola: ========================================
lola: subprocess 15 will run for 3272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((ExecutingTask <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((ExecutingTask <= FreeMemSegment))))
lola: processed formula length: 45
lola: 30 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: 4239763 markings, 6359070 edges, 847953 markings/sec, 0 secs
lola: 8331763 markings, 12496445 edges, 818400 markings/sec, 5 secs
lola: 12205089 markings, 18306321 edges, 774665 markings/sec, 10 secs
lola: 15943726 markings, 23912055 edges, 747727 markings/sec, 15 secs
lola: 19657466 markings, 29485383 edges, 742748 markings/sec, 20 secs
lola: 23253663 markings, 34878875 edges, 719239 markings/sec, 25 secs
lola: 26769875 markings, 40152876 edges, 703242 markings/sec, 30 secs
lola: 30294900 markings, 45441390 edges, 705005 markings/sec, 35 secs
lola: 33904836 markings, 50854111 edges, 721987 markings/sec, 40 secs
lola: 37437098 markings, 56154858 edges, 706452 markings/sec, 45 secs
lola: 40913668 markings, 61369523 edges, 695314 markings/sec, 50 secs
lola: 44371273 markings, 66555015 edges, 691521 markings/sec, 55 secs
lola: 47741748 markings, 71610202 edges, 674095 markings/sec, 60 secs
lola: 51057914 markings, 76585627 edges, 663233 markings/sec, 65 secs
lola: 54345279 markings, 81515372 edges, 657473 markings/sec, 70 secs
lola: 57589707 markings, 86380522 edges, 648886 markings/sec, 75 secs
lola: 60904544 markings, 91354091 edges, 662967 markings/sec, 80 secs
lola: 64201205 markings, 96297810 edges, 659332 markings/sec, 85 secs
lola: 67512629 markings, 101267003 edges, 662285 markings/sec, 90 secs
lola: 70790677 markings, 106182690 edges, 655610 markings/sec, 95 secs
lola: 74247576 markings, 111369816 edges, 691380 markings/sec, 100 secs
lola: 77635899 markings, 116452073 edges, 677665 markings/sec, 105 secs
lola: 80937331 markings, 121402248 edges, 660286 markings/sec, 110 secs
lola: 84293944 markings, 126437694 edges, 671323 markings/sec, 115 secs
lola: 87675543 markings, 131510393 edges, 676320 markings/sec, 120 secs
lola: 91033337 markings, 136547632 edges, 671559 markings/sec, 125 secs
lola: 94365479 markings, 141545126 edges, 666428 markings/sec, 130 secs
lola: 97211946 markings, 145815604 edges, 569293 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (F (G ((3 <= CPUUnit))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((3 <= CPUUnit))))
lola: processed formula length: 26
lola: 30 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: 4133855 markings, 6198769 edges, 826771 markings/sec, 0 secs
lola: 8073887 markings, 12109182 edges, 788006 markings/sec, 5 secs
lola: 11860505 markings, 17789593 edges, 757324 markings/sec, 10 secs
lola: 15584742 markings, 23375655 edges, 744847 markings/sec, 15 secs
lola: 19280077 markings, 28918092 edges, 739067 markings/sec, 20 secs
lola: 22902164 markings, 34353182 edges, 724417 markings/sec, 25 secs
lola: 26549124 markings, 39820789 edges, 729392 markings/sec, 30 secs
lola: 30081323 markings, 45119745 edges, 706440 markings/sec, 35 secs
lola: 33645567 markings, 50467258 edges, 712849 markings/sec, 40 secs
lola: 37263000 markings, 55893359 edges, 723487 markings/sec, 45 secs
lola: 40735724 markings, 61101591 edges, 694545 markings/sec, 50 secs
lola: 44221728 markings, 66329585 edges, 697201 markings/sec, 55 secs
lola: 47666702 markings, 71499358 edges, 688995 markings/sec, 60 secs
lola: 50987921 markings, 76478735 edges, 664244 markings/sec, 65 secs
lola: 54241303 markings, 81360188 edges, 650676 markings/sec, 70 secs
lola: 57452199 markings, 86177450 edges, 642179 markings/sec, 75 secs
lola: 60785917 markings, 91177996 edges, 666744 markings/sec, 80 secs
lola: 64198748 markings, 96295353 edges, 682566 markings/sec, 85 secs
lola: 67587357 markings, 101379302 edges, 677722 markings/sec, 90 secs
lola: 70894906 markings, 106340141 edges, 661510 markings/sec, 95 secs
lola: 74285000 markings, 111426948 edges, 678019 markings/sec, 100 secs
lola: 77573325 markings, 116358919 edges, 657665 markings/sec, 105 secs
lola: 80831478 markings, 121245065 edges, 651631 markings/sec, 110 secs
lola: 84170086 markings, 126253396 edges, 667722 markings/sec, 115 secs
lola: 87495930 markings, 131242263 edges, 665169 markings/sec, 120 secs
lola: 90803280 markings, 136203803 edges, 661470 markings/sec, 125 secs
lola: 94083209 markings, 141124614 edges, 655986 markings/sec, 130 secs
lola: 97188779 markings, 145782454 edges, 621114 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: A (G (F ((ExecutingTask <= FreeMemSegment))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((ExecutingTask <= FreeMemSegment))))
lola: processed formula length: 45
lola: 30 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: 4208977 markings, 6313134 edges, 841795 markings/sec, 0 secs
lola: 8228881 markings, 12340849 edges, 803981 markings/sec, 5 secs
lola: 12075576 markings, 18111305 edges, 769339 markings/sec, 10 secs
lola: 15794355 markings, 23688750 edges, 743756 markings/sec, 15 secs
lola: 19542384 markings, 29309728 edges, 749606 markings/sec, 20 secs
lola: 23179648 markings, 34765461 edges, 727453 markings/sec, 25 secs
lola: 26661025 markings, 39991014 edges, 696275 markings/sec, 30 secs
lola: 30089316 markings, 45132414 edges, 685658 markings/sec, 35 secs
lola: 33528777 markings, 50292251 edges, 687892 markings/sec, 40 secs
lola: 37004029 markings, 55502736 edges, 695050 markings/sec, 45 secs
lola: 40519950 markings, 60777558 edges, 703184 markings/sec, 50 secs
lola: 43999394 markings, 65997857 edges, 695889 markings/sec, 55 secs
lola: 47524050 markings, 71282473 edges, 704931 markings/sec, 60 secs
lola: 51011141 markings, 76514535 edges, 697418 markings/sec, 65 secs
lola: 54404638 markings, 81605877 edges, 678699 markings/sec, 70 secs
lola: 57725530 markings, 86586264 edges, 664178 markings/sec, 75 secs
lola: 61151068 markings, 91724621 edges, 685108 markings/sec, 80 secs
lola: 64521750 markings, 96780680 edges, 674136 markings/sec, 85 secs
lola: 67857781 markings, 101784558 edges, 667206 markings/sec, 90 secs
lola: 71180274 markings, 106768267 edges, 664499 markings/sec, 95 secs
lola: 74554355 markings, 111829770 edges, 674816 markings/sec, 100 secs
lola: 77814054 markings, 116717096 edges, 651940 markings/sec, 105 secs
lola: 81002862 markings, 121501144 edges, 637762 markings/sec, 110 secs
lola: 84259387 markings, 126386765 edges, 651305 markings/sec, 115 secs
lola: 87604518 markings, 131404893 edges, 669026 markings/sec, 120 secs
lola: 90925018 markings, 136385710 edges, 664100 markings/sec, 125 secs
lola: 94240828 markings, 141358235 edges, 663162 markings/sec, 130 secs
lola: 97201085 markings, 145797612 edges, 592051 markings/sec, 135 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes unknown unknown no no no yes no no no yes no yes no no yes
lola:
preliminary result: yes unknown unknown no no no yes no no no yes no yes no no yes
lola: memory consumption: 17108 KB
lola: time consumption: 726 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1552953847910
--------------------
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="SmallOperatingSystem-PT-MT8192DC2048"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3954"
echo " Executing tool lola"
echo " Input is SmallOperatingSystem-PT-MT8192DC2048, 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 r159-csrt-155286431200492"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT8192DC2048.tgz
mv SmallOperatingSystem-PT-MT8192DC2048 execution
cd execution
if [ "LTLCardinality" = "GlobalProperties" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
if [ "LTLCardinality" = "UpperBounds" ] ; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;