About the Execution of LoLA for SharedMemory-PT-000010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4271.570 | 5868.00 | 7370.00 | 14.70 | FFTTFTFFFTFFFFFF | 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-155286430800249.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 SharedMemory-PT-000010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r159-csrt-155286430800249
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 720K
-rw-r--r-- 1 mcc users 13K Feb 12 15:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 12 15:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Feb 8 18:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 8 18:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 10 17:31 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 109 Feb 24 15:05 GlobalProperties.txt
-rw-r--r-- 1 mcc users 347 Feb 24 15:05 GlobalProperties.xml
-rw-r--r-- 1 mcc users 11K Feb 5 01:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Feb 5 01:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 4 22:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 4 22:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Feb 4 17:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 4 17:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 38K Feb 1 14:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 123K Feb 1 14:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.6K Feb 4 22:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.0K Feb 4 22:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:35 equiv_col
-rw-r--r-- 1 mcc users 7 Jan 29 09:35 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:35 iscolored
-rw-r--r-- 1 mcc users 167K 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 SharedMemory-PT-000010-LTLCardinality-00
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-01
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-02
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-03
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-04
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-05
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-06
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-07
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-08
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-09
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-10
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-11
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-12
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-13
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-14
FORMULA_NAME SharedMemory-PT-000010-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1552944653621
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ SharedMemory-PT-000010 @ 3570 seconds
FORMULA SharedMemory-PT-000010-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA SharedMemory-PT-000010-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3564
rslt: Output for LTLCardinality @ SharedMemory-PT-000010
{
"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": "Mon Mar 18 21:30:53 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": 35
},
"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": "FALSE",
"processed_size": 5,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 254
},
"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": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 274
},
"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": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"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": "(Ext_Mem_Acc_4_10 <= OwnMemAcc_4)",
"processed_size": 33,
"rewrites": 35
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (X (((Ext_Mem_Acc_6_10 <= Queue_2) U (Ext_Mem_Acc_9_7 <= Ext_Mem_Acc_9_3)))))",
"processed_size": 82,
"rewrites": 35
},
"result":
{
"edges": 91,
"markings": 88,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 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": 35
},
"result":
{
"edges": 20,
"markings": 21,
"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": 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 ((Ext_Mem_Acc_10_1 <= Ext_Mem_Acc_5_3))))",
"processed_size": 49,
"rewrites": 35
},
"result":
{
"edges": 720035,
"markings": 140133,
"produced_by": "LTL model checker",
"value": false
},
"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": 445
},
"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 ((Ext_Mem_Acc_1_9 <= Ext_Mem_Acc_8_5))))",
"processed_size": 48,
"rewrites": 35
},
"result":
{
"edges": 132,
"markings": 95,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"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": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (X (((Memory_7 <= OwnMemAcc_7) OR (G ((Ext_Mem_Acc_8_1 <= Ext_Mem_Acc_2_10)) AND F ((Memory_7 <= OwnMemAcc_7))))))",
"processed_size": 116,
"rewrites": 35
},
"result":
{
"edges": 5,
"markings": 5,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 594
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"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 ((OwnMemAcc_10 <= Ext_Mem_Acc_2_9)))",
"processed_size": 41,
"rewrites": 35
},
"result":
{
"edges": 6,
"markings": 6,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"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": 712
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))",
"processed_size": 220,
"rewrites": 37
},
"result":
{
"edges": 13,
"markings": 13,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 11,
"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": 891
},
"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": 100,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 100,
"visible_transitions": 0
},
"processed": "(Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 + 1 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10)",
"processed_size": 1743,
"rewrites": 37
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 190
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1188
},
"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 ((Ext_Mem_Acc_9_4 <= Ext_Mem_Acc_6_7))))",
"processed_size": 48,
"rewrites": 35
},
"result":
{
"edges": 34784,
"markings": 18047,
"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": 1782
},
"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 ((Queue_1 <= Ext_Mem_Acc_2_4))))",
"processed_size": 40,
"rewrites": 35
},
"result":
{
"edges": 3852,
"markings": 2018,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3564
},
"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": 20,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 20,
"visible_transitions": 0
},
"processed": "A (G (F ((OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10))))",
"processed_size": 254,
"rewrites": 35
},
"result":
{
"edges": 43,
"markings": 31,
"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": 20700,
"runtime": 6.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "FALSE : FALSE : TRUE : A(X(TRUE)) : FALSE : A(F(**)) : A(G(F(**))) : A(G(**)) : A(X(X((** U **)))) : ** : A(X(G(**))) : A(X(G(**))) : A(X((** OR (G(**) AND F(**))))) : A(G(F(**))) : A(G(F(**))) : A(X(**))"
},
"net":
{
"arcs": 800,
"conflict_clusters": 101,
"places": 131,
"places_significant": 110,
"singleton_clusters": 0,
"transitions": 210
},
"result":
{
"preliminary_value": "no no yes yes no yes no no no yes no no no no no no ",
"value": "no no yes yes no yes no no no yes no no no no no 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: 341/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 131
lola: finding significant places
lola: 131 places, 210 transitions, 110 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: place invariant simplifies atomic proposition
lola: before: (Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10 <= Ext_Bus)
lola: after: (9 <= 0)
lola: LP says that atomic proposition is always false: (3 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10)
lola: LP says that atomic proposition is always true: (2 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: place invariant simplifies atomic proposition
lola: before: (Ext_Bus <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: after: (0 <= 9)
lola: LP says that atomic proposition is always false: (3 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10)
lola: LP says that atomic proposition is always false: (3 <= Ext_Bus)
lola: LP says that atomic proposition is always true: (Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10)
lola: LP says that atomic proposition is always true: (Ext_Mem_Acc_1_3 <= Memory_2)
lola: A ((9 <= 0)) : A (G ((3 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10))) : A (G ((2 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10))) : A (X (X ((0 <= 9)))) : A (F (F ((3 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10)))) : A ((G (F ((3 <= Ext_Bus))) U F ((Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)))) : A (X (G (((Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + Ext_Mem_Acc_1_7 + Ext_Mem_Acc_1_8 + Ext_Mem_Acc_8_5 + Ext_Mem_Acc_2_1 + Ext_Mem_Acc_2_3 + Ext_Mem_Acc_2_4 + Ext_Mem_Acc_2_5 + Ext_Mem_Acc_2_6 + Ext_Mem_Acc_2_7 + Ext_Mem_Acc_2_8 + Ext_Mem_Acc_2_9 + Ext_Mem_Acc_3_1 + Ext_Mem_Acc_3_2 + Ext_Mem_Acc_3_4 + Ext_Mem_Acc_3_5 + Ext_Mem_Acc_3_6 + Ext_Mem_Acc_3_7 + Ext_Mem_Acc_3_8 + Ext_Mem_Acc_3_9 + Ext_Mem_Acc_8_4 + Ext_Mem_Acc_4_1 + Ext_Mem_Acc_4_2 + Ext_Mem_Acc_4_3 + Ext_Mem_Acc_4_5 + Ext_Mem_Acc_4_6 + Ext_Mem_Acc_4_7 + Ext_Mem_Acc_4_8 + Ext_Mem_Acc_8_3 + Ext_Mem_Acc_5_1 + Ext_Mem_Acc_5_2 + Ext_Mem_Acc_5_3 + Ext_Mem_Acc_5_4 + Ext_Mem_Acc_5_6 + Ext_Mem_Acc_5_7 + Ext_Mem_Acc_5_8 + Ext_Mem_Acc_8_2 + Ext_Mem_Acc_6_1 + Ext_Mem_Acc_6_2 + Ext_Mem_Acc_6_3 + Ext_Mem_Acc_6_4 + Ext_Mem_Acc_6_5 + Ext_Mem_Acc_6_7 + Ext_Mem_Acc_6_8 + Ext_Mem_Acc_8_1 + Ext_Mem_Acc_7_8 + Ext_Mem_Acc_7_1 + Ext_Mem_Acc_7_2 + Ext_Mem_Acc_7_3 + Ext_Mem_Acc_7_4 + Ext_Mem_Acc_7_5 + Ext_Mem_Acc_7_6 + Ext_Mem_Acc_3_10 + Ext_Mem_Acc_7_9 + Ext_Mem_Acc_6_9 + Ext_Mem_Acc_5_9 + Ext_Mem_Acc_4_9 + Ext_Mem_Acc_4_10 + Ext_Mem_Acc_1_9 + Ext_Mem_Acc_8_7 + Ext_Mem_Acc_8_9 + Ext_Mem_Acc_9_1 + Ext_Mem_Acc_9_2 + Ext_Mem_Acc_9_3 + Ext_Mem_Acc_9_4 + Ext_Mem_Acc_9_5 + Ext_Mem_Acc_9_6 + Ext_Mem_Acc_9_7 + Ext_Mem_Acc_9_8 + Ext_Mem_Acc_2_10 <= Memory_1 + Memory_2 + Memory_3 + Memory_4 + Memory_5 + Memory_6 + Memory_7 + Memory_8 + Memory_9 + Memory_10) U (OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10))))) : A (G (G ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))) : A (X (X (((Ext_Mem_Acc_6_10 <= Queue_2) U (Ext_Mem_Acc_9_7 <= Ext_Mem_Acc_9_3))))) : A ((Ext_Mem_Acc_4_10 <= OwnMemAcc_4)) : A (G (X ((Ext_Mem_Acc_10_1 <= Ext_Mem_Acc_5_3)))) : A (G (G (G (X ((Ext_Mem_Acc_1_9 <= Ext_Mem_Acc_8_5)))))) : A ((G (X ((Ext_Mem_Acc_8_1 <= Ext_Mem_Acc_2_10))) U X ((Memory_7 <= OwnMemAcc_7)))) : A (G (F ((Queue_1 <= Ext_Mem_Acc_2_4)))) : A (F (G (((Ext_Mem_Acc_1_3 <= Memory_2) U (Ext_Mem_Acc_9_4 <= Ext_Mem_Acc_6_7))))) : A (X ((OwnMemAcc_10 <= Ext_Mem_Acc_2_9)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
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:100
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
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:163
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:371
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: 35 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: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 35 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 2 will run for 254 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: 35 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 274 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: 35 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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Ext_Mem_Acc_4_10 <= OwnMemAcc_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Ext_Mem_Acc_4_10 <= OwnMemAcc_4)
lola: processed formula length: 33
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (((Ext_Mem_Acc_6_10 <= Queue_2) U (Ext_Mem_Acc_9_7 <= Ext_Mem_Acc_9_3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (((Ext_Mem_Acc_6_10 <= Queue_2) U (Ext_Mem_Acc_9_7 <= Ext_Mem_Acc_9_3)))))
lola: processed formula length: 82
lola: 35 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: 88 markings, 91 edges
lola: ========================================
lola: subprocess 6 will run for 356 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: 35 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: 21 markings, 20 edges
lola: ========================================
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Ext_Mem_Acc_10_1 <= Ext_Mem_Acc_5_3))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Ext_Mem_Acc_10_1 <= Ext_Mem_Acc_5_3))))
lola: processed formula length: 49
lola: 35 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: 140133 markings, 720035 edges
lola: ========================================
lola: subprocess 8 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (G ((Ext_Mem_Acc_1_9 <= Ext_Mem_Acc_8_5))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (G ((Ext_Mem_Acc_1_9 <= Ext_Mem_Acc_8_5))))
lola: processed formula length: 48
lola: 35 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: 95 markings, 132 edges
lola: ========================================
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (((Memory_7 <= OwnMemAcc_7) OR (G ((Ext_Mem_Acc_8_1 <= Ext_Mem_Acc_2_10)) AND F ((Memory_7 <= OwnMemAcc_7))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (((Memory_7 <= OwnMemAcc_7) OR (G ((Ext_Mem_Acc_8_1 <= Ext_Mem_Acc_2_10)) AND F ((Memory_7 <= OwnMemAcc_7))))))
lola: processed formula length: 116
lola: 35 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: 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: 5 markings, 5 edges
lola: ========================================
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((OwnMemAcc_10 <= Ext_Mem_Acc_2_9)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((OwnMemAcc_10 <= Ext_Mem_Acc_2_9)))
lola: processed formula length: 41
lola: 35 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: 6 markings, 6 edges
lola: ========================================
lola: subprocess 11 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))
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 ((Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 <= Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9)))
lola: processed formula length: 220
lola: 37 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: (Active_10 + Active_1 + Active_2 + Active_3 + Active_4 + Active_5 + Active_6 + Active_7 + Active_8 + Active_9 + 1 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10)
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, 13 edges
lola: ========================================
lola: subprocess 12 will run for 891 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_Acc_8_6 + Ext_Mem_Acc_1_2 + Ext_Mem_Acc_1_3 + Ext_Mem_Acc_1_4 + Ext_Mem_Acc_1_5 + Ext_Mem_Acc_1_6 + ... (shortened)
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: (Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10 + 1 <= Ext_Mem_Acc_1_10 + Ext_Mem_Acc_9_10 + Ext_Mem_Acc_8_10 + Ext_Mem_Acc_7_10 + Ext_Mem_Acc_6_10 + Ext_Mem_Acc_10_1 + Ext_Mem_Acc_10_2 + Ext_Mem_Acc_10_3 + Ext_Mem_Acc_10_4 + Ext_Mem_Acc_10_5 + Ext_Mem_Acc_10_6 + Ext_Mem_Acc_10_7 + Ext_Mem_Acc_10_8 + Ext_Mem_Acc_10_9 + Ext_Mem_Acc_5_10 + Ext_Mem_... (shortened)
lola: processed formula length: 1743
lola: 37 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 13 will run for 1188 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Ext_Mem_Acc_9_4 <= Ext_Mem_Acc_6_7))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Ext_Mem_Acc_9_4 <= Ext_Mem_Acc_6_7))))
lola: processed formula length: 48
lola: 35 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: 18047 markings, 34784 edges
lola: ========================================
lola: subprocess 14 will run for 1782 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((Queue_1 <= Ext_Mem_Acc_2_4))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((Queue_1 <= Ext_Mem_Acc_2_4))))
lola: processed formula length: 40
lola: 35 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: 2018 markings, 3852 edges
lola: ========================================
lola: subprocess 15 will run for 3564 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((OwnMemAcc_10 + OwnMemAcc_1 + OwnMemAcc_2 + OwnMemAcc_3 + OwnMemAcc_4 + OwnMemAcc_5 + OwnMemAcc_6 + OwnMemAcc_7 + OwnMemAcc_8 + OwnMemAcc_9 <= Queue_1 + Queue_2 + Queue_3 + Queue_4 + Queue_5 + Queue_6 + Queue_7 + Queue_8 + Queue_9 + Queue_10))))
lola: processed formula length: 254
lola: 35 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: 31 markings, 43 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes no yes no no no yes no no no no no no
lola:
preliminary result: no no yes yes no yes no no no yes no no no no no no
lola: memory consumption: 20700 KB
lola: time consumption: 6 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1552944659489
--------------------
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="SharedMemory-PT-000010"
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 SharedMemory-PT-000010, 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-155286430800249"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 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 ;