About the Execution of LoLA for PolyORBLF-PT-S06J04T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4600.620 | 353611.00 | 359724.00 | 627.70 | FFTTTFFFTTTTFTTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2019-input.r115-smll-155272315900366.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2019-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................
=====================================================================
Generated by BenchKit 2-3957
Executing tool lola
Input is PolyORBLF-PT-S06J04T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r115-smll-155272315900366
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 15M
-rw-r--r-- 1 mcc users 8.6K Feb 12 09:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 32K Feb 12 09:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 8 09:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 8 09:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 10 17:31 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K 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 5.6K Feb 5 00:38 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Feb 5 00:38 LTLCardinality.xml
-rw-r--r-- 1 mcc users 28K Feb 4 22:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 4 22:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.5K Feb 4 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 4 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 1 08:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 27K Feb 1 08:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.5K Feb 4 22:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.2K Feb 4 22:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Jan 29 09:34 equiv_col
-rw-r--r-- 1 mcc users 10 Jan 29 09:34 instance
-rw-r--r-- 1 mcc users 6 Jan 29 09:34 iscolored
-rw-r--r-- 1 mcc users 15M 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 PolyORBLF-PT-S06J04T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-PT-S06J04T06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1553196274413
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S06J04T06 @ 3570 seconds
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-03 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-14 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S06J04T06-LTLCardinality-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3216
rslt: Output for LTLCardinality @ PolyORBLF-PT-S06J04T06
{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2019",
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=LTLCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=deletion",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--preference=force_ltl",
"--json=LTLCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Mar 21 19:24:34 2019
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 208
},
"exit":
{
"localtimelimitreached": false
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "(3 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6)",
"processed_size": 148,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"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": 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": "(1 <= P_1097)",
"processed_size": 13,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"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": 12,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 12,
"visible_transitions": 0
},
"processed": "(Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6)",
"processed_size": 204,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 256
},
"exit":
{
"localtimelimitreached": false
},
"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": 7,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(SigAbort <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6)",
"processed_size": 77,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 278
},
"exit":
{
"localtimelimitreached": false
},
"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": "(ModifiedSrc_3 <= P_2579_3_5)",
"processed_size": 29,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 303
},
"exit":
{
"localtimelimitreached": false
},
"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": "(ScheduleTaskE_Work_2_3 <= Check_Sources_E_3)",
"processed_size": 45,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 333
},
"exit":
{
"localtimelimitreached": false
},
"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": "(Insert_Source_B_6_6 <= ScheduleTaskE_Check_1)",
"processed_size": 46,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 370
},
"exit":
{
"localtimelimitreached": false
},
"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": "(P_1158_4 <= ScheduleTaskE_Work_3_2)",
"processed_size": 36,
"rewrites": 15
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 7,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"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": 47,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 47,
"visible_transitions": 0
},
"processed": "A (X ((F ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4)) U (Abort_Check_Sources_B_5 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_6 <= Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_5_3 + Insert_Source_B_5_4 + Insert_Source_B_5_5 + Insert_Source_B_5_6 + Insert_Source_B_6_1 + Insert_Source_B_6_2 + Insert_Source_B_6_3 + Insert_Source_B_6_4 + Insert_Source_B_6_5 + Insert_Source_B_6_6))))",
"processed_size": 1024,
"rewrites": 15
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"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": 476
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 9,
"visible_transitions": 0
},
"processed": "A ((X (X ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= PollingAbort))) U ((2 <= JobCnt) U (1 <= P_1097))))",
"processed_size": 207,
"rewrites": 15
},
"result":
{
"edges": 67,
"markings": 67,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 556
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 53,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 53,
"visible_transitions": 0
},
"processed": "A ((X (G ((P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 + P_2579_1_6 + P_2579_2_1 + P_2579_2_2 + P_2579_2_3 + P_2579_2_4 + P_2579_2_5 + P_2579_2_6 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_3_5 + P_2579_3_6 + P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_5_5 + P_2579_5_6 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_6_5 + P_2579_6_6 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6))) U ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4) U (2 <= Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6))))",
"processed_size": 823,
"rewrites": 15
},
"result":
{
"edges": 3483475,
"markings": 898079,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 661
},
"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 ((QueueJobB_6_0 <= NotifyEventJobQueuedB_1_2)))",
"processed_size": 52,
"rewrites": 15
},
"result":
{
"edges": 6,
"markings": 7,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 826
},
"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 ((P_1119_5_1 <= P_2579_1_5)))))",
"processed_size": 42,
"rewrites": 15
},
"result":
{
"edges": 42,
"markings": 28,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 12,
"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": 1102
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((NotifyEventJobQueuedB_4_2 <= NotifyEventSourceAddedE_4)))))",
"processed_size": 72,
"rewrites": 15
},
"result":
{
"edges": 1308440,
"markings": 335600,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1648
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 0,
"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 (G ((G ((P_2579_6_4 <= P_1119_4_4)) OR (G ((P_2579_6_3 <= DisablePollingE_4_3)) AND F (G ((P_2579_6_4 <= P_1119_4_4)))))))",
"processed_size": 124,
"rewrites": 15
},
"result":
{
"edges": 174669,
"markings": 126304,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 9
},
"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": 3217
},
"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": 6,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (F (G ((1 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6))))",
"processed_size": 64,
"rewrites": 15
},
"result":
{
"edges": 30,
"markings": 29,
"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": 336780,
"runtime": 353.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "** : ** : ** : ** : A(X((F(**) U **))) : A((X(X(**)) U (** U **))) : A((X(G(**)) U (** U **))) : A(F(G(**))) : A(X(**)) : ** : ** : ** : A(G((G(**) OR (G(**) AND F(G(**)))))) : ** : A(X(X(F(**)))) : A(X(X(G(**))))"
},
"net":
{
"arcs": 88770,
"conflict_clusters": 233,
"places": 632,
"places_significant": 578,
"singleton_clusters": 0,
"transitions": 10500
},
"result":
{
"preliminary_value": "no no yes yes yes no no no yes yes yes yes no yes yes no ",
"value": "no no yes yes yes no no no yes yes yes yes no yes yes no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 11132/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 20224
lola: finding significant places
lola: 632 places, 10500 transitions, 578 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: A ((3 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6)) : A ((1 <= P_1097)) : A ((Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6)) : A ((SigAbort <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6)) : A ((X (F ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4))) U X ((Abort_Check_Sources_B_5 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_6 <= Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B_2_2 + Insert_Source_B_2_3 + Insert_Source_B_2_4 + Insert_Source_B_2_5 + Insert_Source_B_2_6 + Insert_Source_B_3_1 + Insert_Source_B_3_2 + Insert_Source_B_3_3 + Insert_Source_B_3_4 + Insert_Source_B_3_5 + Insert_Source_B_3_6 + Insert_Source_B_4_1 + Insert_Source_B_4_2 + Insert_Source_B_4_3 + Insert_Source_B_4_4 + Insert_Source_B_4_5 + Insert_Source_B_4_6 + Insert_Source_B_5_1 + Insert_Source_B_5_2 + Insert_Source_B_5_3 + Insert_Source_B_5_4 + Insert_Source_B_5_5 + Insert_Source_B_5_6 + Insert_Source_B_6_1 + Insert_Source_B_6_2 + Insert_Source_B_6_3 + Insert_Source_B_6_4 + Insert_Source_B_6_5 + Insert_Source_B_6_6)))) : A ((X (X ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= PollingAbort))) U ((2 <= JobCnt) U (1 <= P_1097)))) : A ((X (G ((P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 + P_2579_1_6 + P_2579_2_1 + P_2579_2_2 + P_2579_2_3 + P_2579_2_4 + P_2579_2_5 + P_2579_2_6 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_3_5 + P_2579_3_6 + P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_5_5 + P_2579_5_6 + P_2579_6_1 + P_2579_6_2 + P_2579_6_3 + P_2579_6_4 + P_2579_6_5 + P_2579_6_6 <= EnablePollingB_1 + EnablePollingB_2 + EnablePollingB_3 + EnablePollingB_4 + EnablePollingB_5 + EnablePollingB_6))) U ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4) U (2 <= Abort_Check_Sources_E_1 + Abort_Check_Sources_E_2 + Abort_Check_Sources_E_3 + Abort_Check_Sources_E_4 + Abort_Check_Sources_E_5 + Abort_Check_Sources_E_6)))) : A ((X (G ((2 <= P_1119_1_1 + P_1119_1_2 + P_1119_1_3 + P_1119_1_4 + P_1119_1_5 + P_1119_1_6 + P_1119_2_1 + P_1119_2_2 + P_1119_2_3 + P_1119_2_4 + P_1119_2_5 + P_1119_2_6 + P_1119_3_1 + P_1119_3_2 + P_1119_3_3 + P_1119_3_4 + P_1119_3_5 + P_1119_3_6 + P_1119_4_1 + P_1119_4_2 + P_1119_4_3 + P_1119_4_4 + P_1119_4_5 + P_1119_4_6 + P_1119_5_1 + P_1119_5_2 + P_1119_5_3 + P_1119_5_4 + P_1119_5_5 + P_1119_5_6 + P_1119_6_1 + P_1119_6_2 + P_1119_6_3 + P_1119_6_4 + P_1119_6_5 + P_1119_6_6))) U F (G ((1 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6))))) : A (X ((QueueJobB_6_0 <= NotifyEventJobQueuedB_1_2))) : A ((ModifiedSrc_3 <= P_2579_3_5)) : A ((ScheduleTaskE_Work_2_3 <= Check_Sources_E_3)) : A ((Insert_Source_B_6_6 <= ScheduleTaskE_Check_1)) : A (G ((G ((P_2579_6_3 <= DisablePollingE_4_3)) U G ((P_2579_6_4 <= P_1119_4_4))))) : A ((P_1158_4 <= ScheduleTaskE_Work_3_2)) : A (X (F (F (X ((P_1119_5_1 <= P_2579_1_5)))))) : A (X (X (G (G ((NotifyEventJobQueuedB_4_2 <= NotifyEventSourceAddedE_4))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:151
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= ScheduleTaskE_Check_1 + ScheduleTaskE_Check_2 + ScheduleTaskE_Check_3 + ScheduleTaskE_Check_4 + ScheduleTaskE_Check_5 + ScheduleTaskE_Check_6)
lola: processed formula length: 148
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 222 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= P_1097)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= P_1097)
lola: processed formula length: 13
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 <= FetchJobB_1 + FetchJobB_2 + FetchJobB_3 + FetchJobB_4 + FetchJobB_5 + FetchJobB_6)
lola: processed formula length: 204
lola: 15 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 3 will run for 256 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (SigAbort <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (SigAbort <= P_1617_1 + P_1617_2 + P_1617_3 + P_1617_4 + P_1617_5 + P_1617_6)
lola: processed formula length: 77
lola: 15 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 4 will run for 278 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ModifiedSrc_3 <= P_2579_3_5)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ModifiedSrc_3 <= P_2579_3_5)
lola: processed formula length: 29
lola: 15 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 303 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (ScheduleTaskE_Work_2_3 <= Check_Sources_E_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (ScheduleTaskE_Work_2_3 <= Check_Sources_E_3)
lola: processed formula length: 45
lola: 15 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 6 will run for 333 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (Insert_Source_B_6_6 <= ScheduleTaskE_Check_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Insert_Source_B_6_6 <= ScheduleTaskE_Check_1)
lola: processed formula length: 46
lola: 15 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 7 will run for 370 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (P_1158_4 <= ScheduleTaskE_Work_3_2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (P_1158_4 <= ScheduleTaskE_Work_3_2)
lola: processed formula length: 36
lola: 15 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 8 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((F ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4)) U (Abort_Check_Sources_B_5 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_6 <= Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((F ((1 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4)) U (Abort_Check_Sources_B_5 + Abort_Check_Sources_B_4 + Abort_Check_Sources_B_3 + Abort_Check_Sources_B_2 + Abort_Check_Sources_B_1 + Abort_Check_Sources_B_6 <= Insert_Source_B_1_1 + Insert_Source_B_1_2 + Insert_Source_B_1_3 + Insert_Source_B_1_4 + Insert_Source_B_1_5 + Insert_Source_B_1_6 + Insert_Source_B_2_1 + Insert_Source_B... (shortened)
lola: processed formula length: 1024
lola: 15 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 9 will run for 476 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (X ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= PollingAbort))) U ((2 <= JobCnt) U (1 <= P_1097))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (X ((TryAllocateOneTaskE_1 + TryAllocateOneTaskE_2 + TryAllocateOneTaskE_3 + TryAllocateOneTaskE_4 + TryAllocateOneTaskE_5 + TryAllocateOneTaskE_6 <= PollingAbort))) U ((2 <= JobCnt) U (1 <= P_1097))))
lola: processed formula length: 207
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 67 markings, 67 edges
lola: ========================================
lola: subprocess 10 will run for 556 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X (G ((P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 + P_2579_1_6 + P_2579_2_1 + P_2579_2_2 + P_2579_2_3 + P_2579_2_4 + P_2579_2_5 + P_2579_2_6 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_3_5 + P_2579_3_6 + P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_5_5 + P_2579_5_6 +... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X (G ((P_2579_1_1 + P_2579_1_2 + P_2579_1_3 + P_2579_1_4 + P_2579_1_5 + P_2579_1_6 + P_2579_2_1 + P_2579_2_2 + P_2579_2_3 + P_2579_2_4 + P_2579_2_5 + P_2579_2_6 + P_2579_3_1 + P_2579_3_2 + P_2579_3_3 + P_2579_3_4 + P_2579_3_5 + P_2579_3_6 + P_2579_4_1 + P_2579_4_2 + P_2579_4_3 + P_2579_4_4 + P_2579_4_5 + P_2579_4_6 + P_2579_5_1 + P_2579_5_2 + P_2579_5_3 + P_2579_5_4 + P_2579_5_5 + P_2579_5_6 +... (shortened)
lola: processed formula length: 823
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 159724 markings, 621685 edges, 31945 markings/sec, 0 secs
lola: 314938 markings, 1223452 edges, 31043 markings/sec, 5 secs
lola: 469548 markings, 1817130 edges, 30922 markings/sec, 10 secs
lola: 626567 markings, 2430608 edges, 31404 markings/sec, 15 secs
lola: 776393 markings, 3010989 edges, 29965 markings/sec, 20 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: 898079 markings, 3483475 edges
lola: ========================================
lola: subprocess 11 will run for 661 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((QueueJobB_6_0 <= NotifyEventJobQueuedB_1_2)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((QueueJobB_6_0 <= NotifyEventJobQueuedB_1_2)))
lola: processed formula length: 52
lola: 15 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: 7 markings, 6 edges
lola: ========================================
lola: subprocess 12 will run for 826 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((P_1119_5_1 <= P_2579_1_5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((P_1119_5_1 <= P_2579_1_5)))))
lola: processed formula length: 42
lola: 15 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: 28 markings, 42 edges
lola: ========================================
lola: subprocess 13 will run for 1102 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (G ((NotifyEventJobQueuedB_4_2 <= NotifyEventSourceAddedE_4)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (G ((NotifyEventJobQueuedB_4_2 <= NotifyEventSourceAddedE_4)))))
lola: processed formula length: 72
lola: 15 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: 159402 markings, 620099 edges, 31880 markings/sec, 0 secs
lola: 308370 markings, 1199296 edges, 29794 markings/sec, 5 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: 335600 markings, 1308440 edges
lola: ========================================
lola: subprocess 14 will run for 1648 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((G ((P_2579_6_4 <= P_1119_4_4)) OR (G ((P_2579_6_3 <= DisablePollingE_4_3)) AND F (G ((P_2579_6_4 <= P_1119_4_4)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((G ((P_2579_6_4 <= P_1119_4_4)) OR (G ((P_2579_6_3 <= DisablePollingE_4_3)) AND F (G ((P_2579_6_4 <= P_1119_4_4)))))))
lola: processed formula length: 124
lola: 15 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 9 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: 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: 7611 markings, 15925 edges, 1522 markings/sec, 0 secs
lola: 15583 markings, 29832 edges, 1594 markings/sec, 5 secs
lola: 23370 markings, 40016 edges, 1557 markings/sec, 10 secs
lola: 31511 markings, 49481 edges, 1628 markings/sec, 15 secs
lola: 39443 markings, 59234 edges, 1586 markings/sec, 20 secs
lola: 47359 markings, 69475 edges, 1583 markings/sec, 25 secs
lola: 54866 markings, 79359 edges, 1501 markings/sec, 30 secs
lola: 62823 markings, 89607 edges, 1591 markings/sec, 35 secs
lola: 70905 markings, 99379 edges, 1616 markings/sec, 40 secs
lola: 79176 markings, 109190 edges, 1654 markings/sec, 45 secs
lola: 86850 markings, 119319 edges, 1535 markings/sec, 50 secs
lola: 94911 markings, 128203 edges, 1612 markings/sec, 55 secs
lola: 102893 markings, 137581 edges, 1596 markings/sec, 60 secs
lola: 110757 markings, 146391 edges, 1573 markings/sec, 65 secs
lola: 118487 markings, 158279 edges, 1546 markings/sec, 70 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: 126304 markings, 174669 edges
lola: ========================================
lola: subprocess 15 will run for 3217 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((1 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((1 <= nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6))))
lola: processed formula length: 64
lola: 15 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: 29 markings, 30 edges
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes yes yes no no no yes yes yes yes no yes yes no
lola:
preliminary result: no no yes yes yes no no no yes yes yes yes no yes yes no
lola: memory consumption: 336780 KB
lola: time consumption: 353 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1553196628024
--------------------
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="PolyORBLF-PT-S06J04T06"
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-3957"
echo " Executing tool lola"
echo " Input is PolyORBLF-PT-S06J04T06, 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 r115-smll-155272315900366"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S06J04T06.tgz
mv PolyORBLF-PT-S06J04T06 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 ;