About the Execution of 2019-Gold for PolyORBLF-PT-S02J06T10
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
15919.020 | 1678585.00 | 1726054.00 | 1331.10 | TF?FTFTTFFFFFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2020-input.r135-tajo-158961408900113.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool win2019
Input is PolyORBLF-PT-S02J06T10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tajo-158961408900113
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 11K Apr 12 05:41 CTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 12 05:41 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 11 04:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 11 04:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.9K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 9.3K Apr 14 12:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 49K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K Apr 10 12:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 10 12:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 9 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 9 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.3K Apr 10 22:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 6.8K Apr 10 22:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 10 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 1.7M Mar 24 05:37 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-S02J06T10-00
FORMULA_NAME PolyORBLF-PT-S02J06T10-01
FORMULA_NAME PolyORBLF-PT-S02J06T10-02
FORMULA_NAME PolyORBLF-PT-S02J06T10-03
FORMULA_NAME PolyORBLF-PT-S02J06T10-04
FORMULA_NAME PolyORBLF-PT-S02J06T10-05
FORMULA_NAME PolyORBLF-PT-S02J06T10-06
FORMULA_NAME PolyORBLF-PT-S02J06T10-07
FORMULA_NAME PolyORBLF-PT-S02J06T10-08
FORMULA_NAME PolyORBLF-PT-S02J06T10-09
FORMULA_NAME PolyORBLF-PT-S02J06T10-10
FORMULA_NAME PolyORBLF-PT-S02J06T10-11
FORMULA_NAME PolyORBLF-PT-S02J06T10-12
FORMULA_NAME PolyORBLF-PT-S02J06T10-13
FORMULA_NAME PolyORBLF-PT-S02J06T10-14
FORMULA_NAME PolyORBLF-PT-S02J06T10-15
=== Now, execution of the tool begins
BK_START 1590270369723
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ PolyORBLF-PT-S02J06T10 @ 3570 seconds
check_solution: Variable C114 = -0.501671791077 is below its lower bound 0
check_solution: Variable C1114 = -0.321896791458 is below its lower bound 0
check_solution: Variable C2614 = -0.224701404572 is below its lower bound 0
check_solution: Constraint R41 = 4.8657363504e-311 is above its equality of -1
check_solution: Constraint R42 = 5.96068617784e-311 is above its equality of -1
check_solution: Constraint R70 = 4.7235626324e-311 is above its equality of -10
check_solution: Constraint R102 = 6.66094478939e-311 is above its equality of -1
check_solution: Constraint R116 = 6.54847901175e-311 is above its equality of -1
check_solution: Constraint R458 = 0.347519159317 is above its equality of 0
check_solution: Constraint R468 = 81.1156565657 is above its equality of 0
Seriously low accuracy found ||*|| = 81.1157 (rel. error 40.5578)
FORMULA PolyORBLF-PT-S02J06T10-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA PolyORBLF-PT-S02J06T10-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 1891
rslt: Output for LTLCardinality @ PolyORBLF-PT-S02J06T10
{
"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": "Sat May 23 21:46:09 2020
",
"timelimit": 3570
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 195
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 2,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 88,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 88,
"visible_transitions": 0
},
"processed": "A (X ((X (G ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= SigAbort))) U (((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2 + P_1119_9_1 + P_1119_9_2 + P_1119_10_1 + P_1119_10_2 + 1 <= P_2579_1_1 + P_2579_1_2 + P_2579_2_1 + P_2579_2_2 + P_2579_3_1 + P_2579_3_2 + P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_10_1 + P_2579_10_2 + P_2579_7_1 + P_2579_7_2 + P_2579_8_1 + P_2579_8_2 + P_2579_9_1 + P_2579_9_2) R (DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_5_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_6_1 + DisablePollingE_6_2 <= 0)) U X (X ((P_2318_10 + P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + P_2318_9 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9 + Insert_Source_E_10)))))))",
"processed_size": 1413,
"rewrites": 128
},
"result":
{
"edges": 54,
"markings": 33,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 26
},
"compoundnumber": 0,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 208
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 208
},
"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": 128
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 224
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 44,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 44,
"visible_transitions": 0
},
"processed": "A (X ((((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= PlaceSources_2 + PlaceSources_1) U (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9 + nyo_10 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2 + P_1119_9_1 + P_1119_9_2 + P_1119_10_1 + P_1119_10_2)) U (MarkerWrite <= P_1726))))",
"processed_size": 679,
"rewrites": 128
},
"result":
{
"edges": 603,
"markings": 433,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 224
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 50,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 50,
"visible_transitions": 0
},
"processed": "A ((X ((DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_5_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_6_1 + DisablePollingE_6_2 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + Check_Sources_E_7 + Check_Sources_E_8 + Check_Sources_E_9 + Check_Sources_E_10)) OR F ((Perform_Work_E_10 + Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 + Perform_Work_E_9 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10))))",
"processed_size": 1093,
"rewrites": 128
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 243
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 243
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (F ((P_1727 <= 0))))",
"processed_size": 25,
"rewrites": 128
},
"result":
{
"edges": 2,
"markings": 3,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "A (X (X (F ((1 <= P_1727)))))",
"processed_size": 29,
"rewrites": 128
},
"result":
{
"edges": 603,
"markings": 433,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 4,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 265
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (X (X ((F ((PlaceSources_2 + 1 <= ScheduleTaskE_Idle_2)) AND ((nyo_6 <= QueueJobE_6) AND G ((ModifiedSrc_2 <= 2)))))))",
"processed_size": 120,
"rewrites": 128
},
"result":
{
"edges": 553,
"markings": 553,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 6
},
"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": 291
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"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 ((FetchJobB_3 <= cIsMonitoring)) OR X ((G ((Insert_Source_B_5_2 <= FetchJobE_7_5)) AND F ((Insert_Source_B_5_2 <= FetchJobE_7_5))))))",
"processed_size": 139,
"rewrites": 128
},
"result":
{
"edges": 41519,
"markings": 38948,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 4,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "A (G ((X (X (X (G (((Abort_Check_Sources_B_4 <= 1) AND X ((cIsMonitoring + 1 <= ORB_Lock))))))) R (NotifyEventJobQueuedE_1 + 1 <= DisablePollingB_8_1))))",
"processed_size": 153,
"rewrites": 128
},
"result":
{
"edges": 552,
"markings": 552,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"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": 364
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G (F ((AwakeTasks_4 + 1 <= EnablePollingE_6))))",
"processed_size": 50,
"rewrites": 128
},
"result":
{
"edges": 1215,
"markings": 1215,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 417
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (F (G ((AvailableJobId_2 <= P_1726))))",
"processed_size": 40,
"rewrites": 128
},
"result":
{
"edges": 561,
"markings": 560,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"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": 486
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 2,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 6,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 12,
"taut": 0,
"tconj": 3,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 6,
"visible_transitions": 0
},
"processed": "A (F (((P_1160_4 + 1 <= FetchJobE_9_0) OR (((cPollingAbort <= P_1097) AND G ((P_1095 <= AwakeTasks_6))) OR (G ((FetchJobE_9_0 <= P_1160_4)) AND F (((cPollingAbort <= P_1097) AND G ((P_1095 <= AwakeTasks_6)))))))))",
"processed_size": 213,
"rewrites": 128
},
"result":
{
"edges": 1465,
"markings": 1465,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 22
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 583
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 0,
"U": 2,
"X": 0,
"aconj": 0,
"adisj": 2,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 19,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 18,
"visible_transitions": 0
},
"processed": "A ((((2 <= cIsMonitoring) U ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 + QueueJobE_10))) U ((2 <= cIsMonitoring))))",
"processed_size": 276,
"rewrites": 128
},
"result":
{
"edges": 639,
"markings": 639,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 11,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 729
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 3,
"G": 3,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 36,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 25,
"visible_transitions": 0
},
"processed": "A (F ((F (G ((P_1095 <= EnablePollingE_10 + EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9))) AND G ((F ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)) OR G ((P_1095 <= EnablePollingE_10 + EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9)))))))",
"processed_size": 595,
"rewrites": 128
},
"result":
{
"edges": 549,
"markings": 549,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 18
},
"compoundnumber": 12,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 972
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 972
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((QueueJobB_8_0 <= Insert_Source_E_6)))",
"processed_size": 44,
"rewrites": 130
},
"result":
{
"edges": 735,
"markings": 736,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 13,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1459
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1459
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 8,
"visible_transitions": 0
},
"processed": "A (G ((JobCnt <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)))",
"processed_size": 94,
"rewrites": 130
},
"result":
{
"edges": 7,
"markings": 8,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"type": "invariance",
"workflow": "stateequation||search"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 14,
"type": "boolean"
}
},
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2918
},
"child":
[
{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 2918
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "A (G ((NotifyEventSourceAddedE_3 <= P_2318_1)))",
"processed_size": 47,
"rewrites": 130
},
"result":
{
"edges": 131,
"markings": 132,
"produced_by": "state space",
"value": false
},
"task":
{
"compoundnumber": 15,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 15,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 152308,
"runtime": 1678.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "A(X((X(G(**)) U ((* R *) U X(X(**)))))) : A(((** U **) U **)) : A(((** U X((* R F(*)))) U G(**))) : A(F((F(G(**)) AND G((F(**) OR G(**)))))) : (A(X(TRUE)) AND A(X(((** U **) U **)))) : (A(G(*)) AND A(G((F(*) OR G(*))))) : A((X(**) OR F(**))) : (A(X(F(**))) AND A(X(X(F(**))))) : (A(G(**)) AND A(F(G((* AND F(*)))))) : (A(G(F((** AND G(F(**)))))) AND A(G(**))) : A(F(G(**))) : A(G(F(*))) : A(X(X((F(**) AND (* AND G(*)))))) : A(F((** OR ((** AND G(**)) OR (G(**) AND F((** AND G(**)))))))) : A((G(*) OR X((G(**) AND F(**))))) : A(G((X(X(X(G((* AND X(*)))))) R *)))"
},
"net":
{
"arcs": 8302,
"conflict_clusters": 323,
"places": 844,
"places_significant": 786,
"singleton_clusters": 0,
"transitions": 1812
},
"result":
{
"preliminary_value": "yes no unknown no yes no yes yes no no no no no no no no ",
"value": "yes no unknown no yes no yes yes no no 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: 2656/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 27008
lola: finding significant places
lola: 844 places, 1812 transitions, 786 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from LTLCardinality.xml
lola: LP says that atomic proposition is always false: (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)
lola: LP says that atomic proposition is always false: (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)
lola: LP says that atomic proposition is always false: (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)
lola: LP says that atomic proposition is always false: (2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)
lola: LP says that atomic proposition is always false: (3 <= JobCnt)
lola: A (X ((G (X ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= SigAbort))) U (NOT(((P_2579_1_1 + P_2579_1_2 + P_2579_2_1 + P_2579_2_2 + P_2579_3_1 + P_2579_3_2 + P_2579_4_1 + P_2579_4_2 + P_2579_5_1 + P_2579_5_2 + P_2579_6_1 + P_2579_6_2 + P_2579_10_1 + P_2579_10_2 + P_2579_7_1 + P_2579_7_2 + P_2579_8_1 + P_2579_8_2 + P_2579_9_1 + P_2579_9_2 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2 + P_1119_9_1 + P_1119_9_2 + P_1119_10_1 + P_1119_10_2) U (1 <= DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_5_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_6_1 + DisablePollingE_6_2))) U X (X ((P_2318_10 + P_2318_1 + P_2318_2 + P_2318_3 + P_2318_4 + P_2318_5 + P_2318_6 + P_2318_7 + P_2318_8 + P_2318_9 <= Insert_Source_E_1 + Insert_Source_E_2 + Insert_Source_E_3 + Insert_Source_E_4 + Insert_Source_E_5 + Insert_Source_E_6 + Insert_Source_E_7 + Insert_Source_E_8 + Insert_Source_E_9 + Insert_Source_E_10))))))) : A ((((G ((2 <= AbourtToModifySrc_1 + AbourtToModifySrc_2)) U (AbourtToModifySrc_1 + AbourtToModifySrc_2 <= 1)) AND ((2 <= cIsMonitoring) U ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 + QueueJobE_10)))) U ((2 <= cIsMonitoring)))) : A ((((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10) U NOT(X (((1 <= P_1726) U G ((P_1725_0 + P_1725_1 + P_1725_2 + P_1725_3 + P_1725_4 + P_1725_5 + P_1725_6 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2 + P_1119_9_1 + P_1119_9_2 + P_1119_10_1 + P_1119_10_2)))))) U G ((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10)))) : A (F (NOT(G (NOT(G ((F ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)) U G ((P_1095 <= EnablePollingE_10 + EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9))))))))) : A (X ((G (X ((0 <= P_2321_10 + P_2321_1 + P_2321_2 + P_2321_3 + P_2321_4 + P_2321_5 + P_2321_6 + P_2321_7 + P_2321_8 + P_2321_9))) AND (((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= PlaceSources_2 + PlaceSources_1) U (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9 + nyo_10 <= P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2 + P_1119_9_1 + P_1119_9_2 + P_1119_10_1 + P_1119_10_2)) U (MarkerWrite <= P_1726))))) : A (G (NOT((G ((DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_5_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_6_1 + DisablePollingE_6_2 <= MarkerRead)) U (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6 + 1 <= JobCnt))))) : A ((X ((DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_5_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_5_1 + DisablePollingE_6_1 + DisablePollingE_6_2 <= Check_Sources_E_1 + Check_Sources_E_2 + Check_Sources_E_3 + Check_Sources_E_4 + Check_Sources_E_5 + Check_Sources_E_6 + Check_Sources_E_7 + Check_Sources_E_8 + Check_Sources_E_9 + Check_Sources_E_10)) OR ((3 <= JobCnt) U F ((Perform_Work_E_10 + Perform_Work_E_1 + Perform_Work_E_2 + Perform_Work_E_3 + Perform_Work_E_4 + Perform_Work_E_5 + Perform_Work_E_6 + Perform_Work_E_7 + Perform_Work_E_8 + Perform_Work_E_9 <= Try_Check_Sources_B_1 + Try_Check_Sources_B_2 + Try_Check_Sources_B_3 + Try_Check_Sources_B_4 + Try_Check_Sources_B_5 + Try_Check_Sources_B_6 + Try_Check_Sources_B_7 + Try_Check_Sources_B_8 + Try_Check_Sources_B_9 + Try_Check_Sources_B_10))))) : A (X ((F ((P_1727 <= 0)) AND X ((F (((0 <= P_1717) OR ((0 <= P_1717) U (P_1717 + 1 <= 0)))) U (1 <= P_1727)))))) : A (G (((QueueJobB_8_0 <= Insert_Source_E_6) AND NOT(G (((2 <= DisablePollingE_5_2) U G (F (((P_2318_6 <= P_1097) OR G ((2 <= P_1158_8))))))))))) : A (G ((X (F (((1 <= cSources) AND F (G (F ((P_1717 <= P_1093))))))) AND G ((NotifyEventSourceAddedE_3 <= P_2318_1))))) : A (X ((X ((AvailableJobId_2 <= P_1726)) U X (F (((Check_Sources_E_10 + 1 <= Abort_Check_Sources_B_6) U G (X ((AvailableJobId_2 <= P_1726))))))))) : A (NOT(((NOT(X ((0 <= P_2318_9))) AND X ((cIdleTasks <= P_1726))) OR F (G (F (G ((EnablePollingE_6 <= AwakeTasks_4)))))))) : A (X (X ((F ((PlaceSources_2 + 1 <= ScheduleTaskE_Idle_2)) AND NOT(((QueueJobE_6 + 1 <= nyo_6) OR F ((3 <= ModifiedSrc_2)))))))) : A (F (((P_1160_4 + 1 <= FetchJobE_9_0) OR (((0 <= TryAllocateOneTaskB_2) AND G ((FetchJobE_9_0 <= P_1160_4))) U ((cPollingAbort <= P_1097) AND G ((P_1095 <= AwakeTasks_6))))))) : A (NOT((F ((cIsMonitoring + 1 <= FetchJobB_3)) AND X (NOT((G ((Insert_Source_B_5_2 <= FetchJobE_7_5)) AND ((cIsMonitoring + 1 <= FetchJobB_3) U F ((Insert_Source_B_5_2 <= FetchJobE_7_5))))))))) : A (G (NOT((X (X (X (F (((2 <= Abort_Check_Sources_B_4) OR X ((ORB_Lock <= cIsMonitoring))))))) U (DisablePollingB_8_1 <= NotifyEventJobQueuedE_1)))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:163
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:160
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:142
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:124
lola: rewrite Frontend/Parser/formula_rewrite.k:154
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:551
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:545
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:279
lola: rewrite Frontend/Parser/formula_rewrite.k:145
lola: rewrite Frontend/Parser/formula_rewrite.k:118
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:122
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:116
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:338
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 195 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((X (G ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= SigAbort))) U (((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2 + P_1119_9_1 + P_1119_9_2 + P_1119_10_1 + P_1119_10_2 + 1 <= P_2579_1_1 + P_2579_1_2 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((X (G ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= SigAbort))) U (((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_2 + P_1119_8_1 + P_1119_8_2 + P_1119_9_1 + P_1119_9_2 + P_1119_10_1 + P_1119_10_2 + 1 <= P_2579_1_1 + P_2579_1_2 ... (shortened)
lola: processed formula length: 1413
lola: 128 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 26 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: 33 markings, 54 edges
lola: ========================================
lola: subprocess 1 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10) U X (((P_1726 <= 0) R F ((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10) U X (((P_1726 <= 0) R F ((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_... (shortened)
lola: processed formula length: 767
lola: 128 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 500447 markings, 778149 edges, 100089 markings/sec, 0 secs
lola: 1107176 markings, 1514809 edges, 121346 markings/sec, 5 secs
lola: 1696688 markings, 2241430 edges, 117902 markings/sec, 10 secs
lola: 2271423 markings, 2952601 edges, 114947 markings/sec, 15 secs
lola: 2823730 markings, 3649517 edges, 110461 markings/sec, 20 secs
lola: 3365958 markings, 4347844 edges, 108446 markings/sec, 25 secs
lola: 3887116 markings, 5043335 edges, 104232 markings/sec, 30 secs
lola: 4391347 markings, 5739709 edges, 100846 markings/sec, 35 secs
lola: 4906706 markings, 6458467 edges, 103072 markings/sec, 40 secs
lola: 5382608 markings, 7180798 edges, 95180 markings/sec, 45 secs
lola: 5882353 markings, 7898936 edges, 99949 markings/sec, 50 secs
lola: 6430874 markings, 8593323 edges, 109704 markings/sec, 55 secs
lola: 6974111 markings, 9290865 edges, 108647 markings/sec, 60 secs
lola: 7485545 markings, 9986455 edges, 102287 markings/sec, 65 secs
lola: 7991483 markings, 10684372 edges, 101188 markings/sec, 70 secs
lola: 8512307 markings, 11380816 edges, 104165 markings/sec, 75 secs
lola: 9003199 markings, 12070798 edges, 98178 markings/sec, 80 secs
lola: 9479177 markings, 12791534 edges, 95196 markings/sec, 85 secs
lola: 9925477 markings, 13524941 edges, 89260 markings/sec, 90 secs
lola: 10448887 markings, 14230030 edges, 104682 markings/sec, 95 secs
lola: 10957376 markings, 14923926 edges, 101698 markings/sec, 100 secs
lola: 11436080 markings, 15628892 edges, 95741 markings/sec, 105 secs
lola: 11908913 markings, 16341498 edges, 94567 markings/sec, 110 secs
lola: 12402254 markings, 17041692 edges, 98668 markings/sec, 115 secs
lola: 12859706 markings, 17774293 edges, 91490 markings/sec, 120 secs
lola: 13367264 markings, 18471437 edges, 101512 markings/sec, 125 secs
lola: 13819321 markings, 19184045 edges, 90411 markings/sec, 130 secs
lola: 14300808 markings, 19890962 edges, 96297 markings/sec, 135 secs
lola: 14758578 markings, 20632926 edges, 91554 markings/sec, 140 secs
lola: 15205489 markings, 21341452 edges, 89382 markings/sec, 145 secs
lola: 15633613 markings, 22070916 edges, 85625 markings/sec, 150 secs
lola: 16067790 markings, 22784763 edges, 86835 markings/sec, 155 secs
lola: 16442708 markings, 23468814 edges, 74984 markings/sec, 160 secs
lola: 16817807 markings, 24175295 edges, 75020 markings/sec, 165 secs
lola: 17225670 markings, 24862020 edges, 81573 markings/sec, 170 secs
lola: 17664284 markings, 25502661 edges, 87723 markings/sec, 175 secs
lola: 18068282 markings, 26137280 edges, 80800 markings/sec, 180 secs
lola: 18466735 markings, 26753382 edges, 79691 markings/sec, 185 secs
lola: 18870772 markings, 27404398 edges, 80807 markings/sec, 190 secs
lola: 19226970 markings, 28050617 edges, 71240 markings/sec, 195 secs
lola: 19583306 markings, 28704931 edges, 71267 markings/sec, 200 secs
lola: local time limit reached - aborting
lola:
preliminary result: yes unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown unknown
lola: memory consumption: 4389004 KB
lola: time consumption: 650 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 2 will run for 208 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (TRUE)) AND A (X ((((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= PlaceSources_2 + PlaceSources_1) U (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9 + nyo... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 208 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: 128 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: 3 markings, 2 edges
lola: ========================================
lola: subprocess 3 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X ((((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= PlaceSources_2 + PlaceSources_1) U (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9 + nyo_10 <= P_1119_1_1 ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X ((((NotifyEventJobQueuedE_1 + NotifyEventJobQueuedE_2 + NotifyEventJobQueuedE_3 + NotifyEventJobQueuedE_4 + NotifyEventJobQueuedE_5 + NotifyEventJobQueuedE_6 + NotifyEventJobQueuedE_7 + NotifyEventJobQueuedE_8 + NotifyEventJobQueuedE_9 + NotifyEventJobQueuedE_10 <= PlaceSources_2 + PlaceSources_1) U (nyo_1 + nyo_2 + nyo_3 + nyo_4 + nyo_5 + nyo_6 + nyo_7 + nyo_8 + nyo_9 + nyo_10 <= P_1119_1_1 ... (shortened)
lola: processed formula length: 679
lola: 128 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 433 markings, 603 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 3 will run for 224 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((X ((DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_5_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((X ((DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + DisablePollingE_3_1 + DisablePollingE_3_2 + DisablePollingE_5_2 + DisablePollingE_4_1 + DisablePollingE_4_2 + DisablePollingE_... (shortened)
lola: processed formula length: 1093
lola: 128 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: 1 markings, 0 edges
lola: ========================================
lola: subprocess 4 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (X (F ((P_1727 <= 0)))) AND A (X (X (F ((1 <= P_1727))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 4 will run for 243 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (F ((P_1727 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (F ((P_1727 <= 0))))
lola: processed formula length: 25
lola: 128 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 3 markings, 2 edges
lola: ========================================
lola: subprocess 5 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X (F ((1 <= P_1727)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X (F ((1 <= P_1727)))))
lola: processed formula length: 29
lola: 128 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: 433 markings, 603 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 5 will run for 265 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (X (X ((F ((PlaceSources_2 + 1 <= ScheduleTaskE_Idle_2)) AND ((nyo_6 <= QueueJobE_6) AND G ((ModifiedSrc_2 <= 2)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (X (X ((F ((PlaceSources_2 + 1 <= ScheduleTaskE_Idle_2)) AND ((nyo_6 <= QueueJobE_6) AND G ((ModifiedSrc_2 <= 2)))))))
lola: processed formula length: 120
lola: 128 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: 553 markings, 553 edges
lola: ========================================
lola: subprocess 6 will run for 291 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((G ((FetchJobB_3 <= cIsMonitoring)) OR X ((G ((Insert_Source_B_5_2 <= FetchJobE_7_5)) AND F ((Insert_Source_B_5_2 <= FetchJobE_7_5))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((G ((FetchJobB_3 <= cIsMonitoring)) OR X ((G ((Insert_Source_B_5_2 <= FetchJobE_7_5)) AND F ((Insert_Source_B_5_2 <= FetchJobE_7_5))))))
lola: processed formula length: 139
lola: 128 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: 38948 markings, 41519 edges
lola: ========================================
lola: subprocess 7 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((X (X (X (G (((Abort_Check_Sources_B_4 <= 1) AND X ((cIsMonitoring + 1 <= ORB_Lock))))))) R (NotifyEventJobQueuedE_1 + 1 <= DisablePollingB_8_1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G ((X (X (X (G (((Abort_Check_Sources_B_4 <= 1) AND X ((cIsMonitoring + 1 <= ORB_Lock))))))) R (NotifyEventJobQueuedE_1 + 1 <= DisablePollingB_8_1))))
lola: processed formula length: 153
lola: 128 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 552 markings, 552 edges
lola: ========================================
lola: subprocess 8 will run for 364 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (F ((AwakeTasks_4 + 1 <= EnablePollingE_6))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (G (F ((AwakeTasks_4 + 1 <= EnablePollingE_6))))
lola: processed formula length: 50
lola: 128 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: 1215 markings, 1215 edges
lola: ========================================
lola: subprocess 9 will run for 417 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (G ((AvailableJobId_2 <= P_1726))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (G ((AvailableJobId_2 <= P_1726))))
lola: processed formula length: 40
lola: 128 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: 560 markings, 561 edges
lola: ========================================
lola: subprocess 10 will run for 486 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F (((P_1160_4 + 1 <= FetchJobE_9_0) OR (((cPollingAbort <= P_1097) AND G ((P_1095 <= AwakeTasks_6))) OR (G ((FetchJobE_9_0 <= P_1160_4)) AND F (((cPollingAbort <= P_1097) AND G ((P_1095 <= AwakeTasks_6)))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F (((P_1160_4 + 1 <= FetchJobE_9_0) OR (((cPollingAbort <= P_1097) AND G ((P_1095 <= AwakeTasks_6))) OR (G ((FetchJobE_9_0 <= P_1160_4)) AND F (((cPollingAbort <= P_1097) AND G ((P_1095 <= AwakeTasks_6)))))))))
lola: processed formula length: 213
lola: 128 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 22 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: 1465 markings, 1465 edges
lola: ========================================
lola: subprocess 11 will run for 583 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A ((((2 <= cIsMonitoring) U ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 + QueueJobE_10))) U ((2 <= cIsMonitoring))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((2 <= cIsMonitoring) U ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= QueueJobE_1 + QueueJobE_2 + QueueJobE_3 + QueueJobE_4 + QueueJobE_5 + QueueJobE_6 + QueueJobE_7 + QueueJobE_8 + QueueJobE_9 + QueueJobE_10))) U ((2 <= cIsMonitoring))))
lola: processed formula length: 276
lola: 128 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: 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: 639 markings, 639 edges
lola: ========================================
lola: subprocess 12 will run for 729 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (F ((F (G ((P_1095 <= EnablePollingE_10 + EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9))) AND G ((F ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)) OR G ((P_1095 <= ... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A (F ((F (G ((P_1095 <= EnablePollingE_10 + EnablePollingE_1 + EnablePollingE_2 + EnablePollingE_3 + EnablePollingE_4 + EnablePollingE_5 + EnablePollingE_6 + EnablePollingE_7 + EnablePollingE_8 + EnablePollingE_9))) AND G ((F ((P_1724_0 + P_1724_1 + P_1724_2 + P_1724_3 + P_1724_4 + P_1724_5 + P_1724_6 <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)) OR G ((P_1095 <= ... (shortened)
lola: processed formula length: 595
lola: 128 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 18 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: 549 markings, 549 edges
lola: ========================================
lola: subprocess 13 will run for 972 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((QueueJobB_8_0 <= Insert_Source_E_6))) AND A (F (G (((P_1097 + 1 <= P_2318_6) AND F ((P_1158_8 <= 1)))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 13 will run for 972 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((QueueJobB_8_0 <= Insert_Source_E_6)))
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 ((QueueJobB_8_0 <= Insert_Source_E_6)))
lola: processed formula length: 44
lola: 130 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: (Insert_Source_E_6 + 1 <= QueueJobB_8_0)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 736 markings, 735 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 14 will run for 1459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G ((JobCnt <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6))) AND A (G ((F ((MarkerRead + 1 <= DisablePollingE_7_1 + DisablePollingE_7_2 + DisablePollingE_8_1 + DisablePollingE_8_2 + DisablePollingE_9_1 + DisablePollingE_9_2 + DisablePollingE_10_1 + DisablePollingE_10_2 + DisablePollingE_1_1 + DisablePollingE_1_2 + DisablePollingE_2_1 + DisablePollingE_2_2 + Disab... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 14 will run for 1459 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((JobCnt <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)))
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:788
lola: processed formula: A (G ((JobCnt <= P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6)))
lola: processed formula length: 94
lola: 130 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:788
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (P_1712_0 + P_1712_1 + P_1712_2 + P_1712_3 + P_1712_4 + P_1712_5 + P_1712_6 + 1 <= JobCnt)
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: 8 markings, 7 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 15 will run for 2918 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (A (G (F (((1 <= cSources) AND G (F ((P_1717 <= P_1093))))))) AND A (G ((NotifyEventSourceAddedE_3 <= P_2318_1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 2918 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((NotifyEventSourceAddedE_3 <= P_2318_1)))
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 ((NotifyEventSourceAddedE_3 <= P_2318_1)))
lola: processed formula length: 47
lola: 130 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: (P_2318_1 + 1 <= NotifyEventSourceAddedE_3)
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: 132 markings, 131 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: A ((((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10) U X (((P_1726 <= 0) R F ((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_... (shortened)
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: A ((((P_1717 <= ScheduleTaskB_1 + ScheduleTaskB_2 + ScheduleTaskB_3 + ScheduleTaskB_4 + ScheduleTaskB_5 + ScheduleTaskB_6 + ScheduleTaskB_7 + ScheduleTaskB_8 + ScheduleTaskB_9 + ScheduleTaskB_10) U X (((P_1726 <= 0) R F ((P_1119_1_1 + P_1119_1_2 + P_1119_2_1 + P_1119_2_2 + P_1119_3_1 + P_1119_3_2 + P_1119_4_1 + P_1119_4_2 + P_1119_5_1 + P_1119_5_2 + P_1119_6_1 + P_1119_6_2 + P_1119_7_1 + P_1119_7_... (shortened)
lola: processed formula length: 767
lola: 128 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 496450 markings, 773423 edges, 99290 markings/sec, 0 secs
lola: 1067497 markings, 1461860 edges, 114209 markings/sec, 5 secs
lola: 1653627 markings, 2191893 edges, 117226 markings/sec, 10 secs
lola: 2205199 markings, 2875021 edges, 110314 markings/sec, 15 secs
lola: 2724604 markings, 3521408 edges, 103881 markings/sec, 20 secs
lola: 3249458 markings, 4196324 edges, 104971 markings/sec, 25 secs
lola: 3774921 markings, 4885093 edges, 105093 markings/sec, 30 secs
lola: 4276427 markings, 5578070 edges, 100301 markings/sec, 35 secs
lola: 4784290 markings, 6288726 edges, 101573 markings/sec, 40 secs
lola: 5273572 markings, 7008530 edges, 97856 markings/sec, 45 secs
lola: 5744268 markings, 7725645 edges, 94139 markings/sec, 50 secs
lola: 6296722 markings, 8421637 edges, 110491 markings/sec, 55 secs
lola: 6839401 markings, 9118061 edges, 108536 markings/sec, 60 secs
lola: 7357577 markings, 9810760 edges, 103635 markings/sec, 65 secs
lola: 7857005 markings, 10500921 edges, 99886 markings/sec, 70 secs
lola: 8377841 markings, 11201318 edges, 104167 markings/sec, 75 secs
lola: 8868665 markings, 11887924 edges, 98165 markings/sec, 80 secs
lola: 9358087 markings, 12597374 edges, 97884 markings/sec, 85 secs
lola: 9806068 markings, 13319395 edges, 89596 markings/sec, 90 secs
lola: 10302120 markings, 14036393 edges, 99210 markings/sec, 95 secs
lola: 10821244 markings, 14731084 edges, 103825 markings/sec, 100 secs
lola: 11306950 markings, 15425976 edges, 97141 markings/sec, 105 secs
lola: 11761709 markings, 16140390 edges, 90952 markings/sec, 110 secs
lola: 12248858 markings, 16821090 edges, 97430 markings/sec, 115 secs
lola: 12687548 markings, 17490926 edges, 87738 markings/sec, 120 secs
lola: 13170077 markings, 18191593 edges, 96506 markings/sec, 125 secs
lola: 13642940 markings, 18886736 edges, 94573 markings/sec, 130 secs
lola: 14101147 markings, 19593296 edges, 91641 markings/sec, 135 secs
lola: 14541854 markings, 20333374 edges, 88141 markings/sec, 140 secs
lola: 15018244 markings, 21032393 edges, 95278 markings/sec, 145 secs
lola: 15459122 markings, 21752614 edges, 88176 markings/sec, 150 secs
lola: 15874967 markings, 22463048 edges, 83169 markings/sec, 155 secs
lola: 16287127 markings, 23184494 edges, 82432 markings/sec, 160 secs
lola: 16680584 markings, 23922718 edges, 78691 markings/sec, 165 secs
lola: 17079887 markings, 24660018 edges, 79861 markings/sec, 170 secs
lola: 17569396 markings, 25357302 edges, 97902 markings/sec, 175 secs
lola: 18011354 markings, 26047861 edges, 88392 markings/sec, 180 secs
lola: 18453850 markings, 26734596 edges, 88499 markings/sec, 185 secs
lola: 18894530 markings, 27441861 edges, 88136 markings/sec, 190 secs
lola: 19288475 markings, 28149330 edges, 78789 markings/sec, 195 secs
lola: 19676389 markings, 28861594 edges, 77583 markings/sec, 200 secs
lola: 20037274 markings, 29594664 edges, 72177 markings/sec, 205 secs
lola: 20341127 markings, 30332374 edges, 60771 markings/sec, 210 secs
lola: 20734585 markings, 31087655 edges, 78692 markings/sec, 215 secs
lola: 21164414 markings, 31831443 edges, 85966 markings/sec, 220 secs
lola: 21501456 markings, 32591303 edges, 67408 markings/sec, 225 secs
lola: 21959818 markings, 33279638 edges, 91672 markings/sec, 230 secs
lola: 22445105 markings, 33946025 edges, 97057 markings/sec, 235 secs
lola: 22943049 markings, 34615743 edges, 99589 markings/sec, 240 secs
lola: 23407216 markings, 35276178 edges, 92833 markings/sec, 245 secs
lola: 23832460 markings, 35907911 edges, 85049 markings/sec, 250 secs
lola: 24255547 markings, 36556664 edges, 84617 markings/sec, 255 secs
lola: 24663400 markings, 37240968 edges, 81571 markings/sec, 260 secs
lola: 25112967 markings, 37922728 edges, 89913 markings/sec, 265 secs
lola: 25577054 markings, 38586828 edges, 92817 markings/sec, 270 secs
lola: 26029570 markings, 39251065 edges, 90503 markings/sec, 275 secs
lola: 26492557 markings, 39925726 edges, 92597 markings/sec, 280 secs
lola: 26935908 markings, 40584340 edges, 88670 markings/sec, 285 secs
lola: 27382351 markings, 41245391 edges, 89289 markings/sec, 290 secs
lola: 27820775 markings, 41895414 edges, 87685 markings/sec, 295 secs
lola: 28245122 markings, 42568241 edges, 84869 markings/sec, 300 secs
lola: 28646223 markings, 43255004 edges, 80220 markings/sec, 305 secs
lola: 29039118 markings, 43938683 edges, 78579 markings/sec, 310 secs
lola: 29418610 markings, 44630606 edges, 75898 markings/sec, 315 secs
lola: 29862102 markings, 45318488 edges, 88698 markings/sec, 320 secs
lola: 30336392 markings, 45988964 edges, 94858 markings/sec, 325 secs
lola: 30785059 markings, 46653696 edges, 89733 markings/sec, 330 secs
lola: 31208888 markings, 47334693 edges, 84766 markings/sec, 335 secs
lola: 31624478 markings, 48020571 edges, 83118 markings/sec, 340 secs
lola: 32064379 markings, 48687059 edges, 87980 markings/sec, 345 secs
lola: 32505422 markings, 49364173 edges, 88209 markings/sec, 350 secs
lola: 32908842 markings, 50052684 edges, 80684 markings/sec, 355 secs
lola: 33257615 markings, 50716009 edges, 69755 markings/sec, 360 secs
lola: 33690121 markings, 51366871 edges, 86501 markings/sec, 365 secs
lola: 34114629 markings, 52033599 edges, 84902 markings/sec, 370 secs
lola: 34517652 markings, 52718354 edges, 80605 markings/sec, 375 secs
lola: 34936258 markings, 53402689 edges, 83721 markings/sec, 380 secs
lola: 35312715 markings, 54113347 edges, 75291 markings/sec, 385 secs
lola: 35726987 markings, 54800112 edges, 82854 markings/sec, 390 secs
lola: 36115418 markings, 55488254 edges, 77686 markings/sec, 395 secs
lola: 36491684 markings, 56198470 edges, 75253 markings/sec, 400 secs
lola: 36871194 markings, 56897018 edges, 75902 markings/sec, 405 secs
lola: 37236797 markings, 57616205 edges, 73121 markings/sec, 410 secs
lola: 37593955 markings, 58345743 edges, 71432 markings/sec, 415 secs
lola: 37991775 markings, 59028366 edges, 79564 markings/sec, 420 secs
lola: 38390406 markings, 59707608 edges, 79726 markings/sec, 425 secs
lola: 38783158 markings, 60380918 edges, 78550 markings/sec, 430 secs
lola: 39175818 markings, 61050241 edges, 78532 markings/sec, 435 secs
lola: 39556057 markings, 61729272 edges, 76048 markings/sec, 440 secs
lola: 39923953 markings, 62430571 edges, 73579 markings/sec, 445 secs
lola: 40272078 markings, 63124227 edges, 69625 markings/sec, 450 secs
lola: 40633592 markings, 63813934 edges, 72303 markings/sec, 455 secs
lola: 41004484 markings, 64500267 edges, 74178 markings/sec, 460 secs
lola: 41325484 markings, 65223635 edges, 64200 markings/sec, 465 secs
lola: 41684226 markings, 65914925 edges, 71748 markings/sec, 470 secs
lola: 41995152 markings, 66630036 edges, 62185 markings/sec, 475 secs
lola: 42281080 markings, 67356100 edges, 57186 markings/sec, 480 secs
lola: 42610912 markings, 68098910 edges, 65966 markings/sec, 485 secs
lola: 43021628 markings, 68837499 edges, 82143 markings/sec, 490 secs
lola: 43385690 markings, 69584996 edges, 72812 markings/sec, 495 secs
lola: 43718721 markings, 70339738 edges, 66606 markings/sec, 500 secs
lola: 44174428 markings, 71021041 edges, 91141 markings/sec, 505 secs
lola: 44652804 markings, 71693533 edges, 95675 markings/sec, 510 secs
lola: 45088568 markings, 72357300 edges, 87153 markings/sec, 515 secs
lola: 45501028 markings, 73039330 edges, 82492 markings/sec, 520 secs
lola: 45933232 markings, 73722920 edges, 86441 markings/sec, 525 secs
lola: 46368404 markings, 74392594 edges, 87034 markings/sec, 530 secs
lola: 46779215 markings, 75119500 edges, 82162 markings/sec, 535 secs
lola: 47245832 markings, 75793715 edges, 93323 markings/sec, 540 secs
lola: 47661581 markings, 76472658 edges, 83150 markings/sec, 545 secs
lola: 48068408 markings, 77151801 edges, 81365 markings/sec, 550 secs
lola: 48477164 markings, 77863411 edges, 81751 markings/sec, 555 secs
lola: 48890350 markings, 78543113 edges, 82637 markings/sec, 560 secs
lola: 49282311 markings, 79234786 edges, 78392 markings/sec, 565 secs
lola: 49665909 markings, 79945106 edges, 76720 markings/sec, 570 secs
lola: 50035791 markings, 80660164 edges, 73976 markings/sec, 575 secs
lola: 50388807 markings, 81388606 edges, 70603 markings/sec, 580 secs
lola: 50763661 markings, 82069345 edges, 74971 markings/sec, 585 secs
lola: 51102756 markings, 82782855 edges, 67819 markings/sec, 590 secs
lola: 51425132 markings, 83493684 edges, 64475 markings/sec, 595 secs
lola: 51703659 markings, 84225788 edges, 55705 markings/sec, 600 secs
lola: 52086232 markings, 84962181 edges, 76515 markings/sec, 605 secs
lola: 52454006 markings, 85702673 edges, 73555 markings/sec, 610 secs
lola: 52799930 markings, 86446882 edges, 69185 markings/sec, 615 secs
lola: 53265687 markings, 87121188 edges, 93151 markings/sec, 620 secs
lola: 53684560 markings, 87800882 edges, 83775 markings/sec, 625 secs
lola: 54093711 markings, 88486213 edges, 81830 markings/sec, 630 secs
lola: 54496997 markings, 89199538 edges, 80657 markings/sec, 635 secs
lola: 54915382 markings, 89878063 edges, 83677 markings/sec, 640 secs
lola: 55310871 markings, 90570945 edges, 79098 markings/sec, 645 secs
lola: 55683092 markings, 91279891 edges, 74444 markings/sec, 650 secs
lola: 56055749 markings, 91995784 edges, 74531 markings/sec, 655 secs
lola: 56402758 markings, 92719209 edges, 69402 markings/sec, 660 secs
lola: 56730170 markings, 93428695 edges, 65482 markings/sec, 665 secs
lola: 57014276 markings, 94156043 edges, 56821 markings/sec, 670 secs
lola: 57385623 markings, 94880124 edges, 74269 markings/sec, 675 secs
lola: 57703448 markings, 95581019 edges, 63565 markings/sec, 680 secs
lola: 58111151 markings, 96257006 edges, 81541 markings/sec, 685 secs
lola: 58495562 markings, 96939640 edges, 76882 markings/sec, 690 secs
lola: 58883128 markings, 97648478 edges, 77513 markings/sec, 695 secs
lola: 59247100 markings, 98363771 edges, 72794 markings/sec, 700 secs
lola: 59585477 markings, 99081835 edges, 67675 markings/sec, 705 secs
lola: 59864915 markings, 99813971 edges, 55888 markings/sec, 710 secs
lola: 60229375 markings, 100557945 edges, 72892 markings/sec, 715 secs
lola: 60596716 markings, 101258307 edges, 73468 markings/sec, 720 secs
lola: 60955380 markings, 101975537 edges, 71733 markings/sec, 725 secs
lola: 61240028 markings, 102702452 edges, 56930 markings/sec, 730 secs
lola: 61592859 markings, 103428478 edges, 70566 markings/sec, 735 secs
lola: 61900453 markings, 104161432 edges, 61519 markings/sec, 740 secs
lola: 62259929 markings, 104878144 edges, 71895 markings/sec, 745 secs
lola: 62754389 markings, 105506314 edges, 98892 markings/sec, 750 secs
lola: 63267545 markings, 106135065 edges, 102631 markings/sec, 755 secs
lola: 63775865 markings, 106765967 edges, 101664 markings/sec, 760 secs
lola: 64292781 markings, 107404665 edges, 103383 markings/sec, 765 secs
lola: 64780016 markings, 108023577 edges, 97447 markings/sec, 770 secs
lola: 65275176 markings, 108658995 edges, 99032 markings/sec, 775 secs
lola: 65750162 markings, 109280230 edges, 94997 markings/sec, 780 secs
lola: 66199869 markings, 109906193 edges, 89941 markings/sec, 785 secs
lola: 66665292 markings, 110551012 edges, 93085 markings/sec, 790 secs
lola: 67125122 markings, 111204130 edges, 91966 markings/sec, 795 secs
lola: 67523481 markings, 111825758 edges, 79672 markings/sec, 800 secs
lola: 67974985 markings, 112439963 edges, 90301 markings/sec, 805 secs
lola: 68459114 markings, 113058004 edges, 96826 markings/sec, 810 secs
lola: 68949368 markings, 113687996 edges, 98051 markings/sec, 815 secs
lola: 69415371 markings, 114314304 edges, 93201 markings/sec, 820 secs
lola: 69873802 markings, 114950712 edges, 91686 markings/sec, 825 secs
lola: 70341661 markings, 115576772 edges, 93572 markings/sec, 830 secs
lola: 70792896 markings, 116201734 edges, 90247 markings/sec, 835 secs
lola: 71239286 markings, 116842663 edges, 89278 markings/sec, 840 secs
lola: 71660587 markings, 117497969 edges, 84260 markings/sec, 845 secs
lola: 72084568 markings, 118179271 edges, 84796 markings/sec, 850 secs
lola: 72567874 markings, 118812324 edges, 96661 markings/sec, 855 secs
lola: 73019950 markings, 119435912 edges, 90415 markings/sec, 860 secs
lola: 73450944 markings, 120079947 edges, 86199 markings/sec, 865 secs
lola: 73880692 markings, 120725326 edges, 85950 markings/sec, 870 secs
lola: 74323142 markings, 121357611 edges, 88490 markings/sec, 875 secs
lola: 74755371 markings, 122038605 edges, 86446 markings/sec, 880 secs
lola: 75213303 markings, 122678305 edges, 91586 markings/sec, 885 secs
lola: 75644702 markings, 123317327 edges, 86280 markings/sec, 890 secs
lola: 76061274 markings, 123963264 edges, 83314 markings/sec, 895 secs
lola: 76484074 markings, 124640085 edges, 84560 markings/sec, 900 secs
lola: 76910872 markings, 125290132 edges, 85360 markings/sec, 905 secs
lola: 77313169 markings, 125939868 edges, 80459 markings/sec, 910 secs
lola: 77712697 markings, 126614533 edges, 79906 markings/sec, 915 secs
lola: 78096887 markings, 127276684 edges, 76838 markings/sec, 920 secs
lola: 78435566 markings, 127883032 edges, 67736 markings/sec, 925 secs
lola: 78788314 markings, 128550073 edges, 70550 markings/sec, 930 secs
lola: 79138967 markings, 129169771 edges, 70131 markings/sec, 935 secs
lola: 79554351 markings, 129761217 edges, 83077 markings/sec, 940 secs
lola: 79920730 markings, 130334849 edges, 73276 markings/sec, 945 secs
lola: 80293452 markings, 130918124 edges, 74544 markings/sec, 950 secs
lola: 80670494 markings, 131506150 edges, 75408 markings/sec, 955 secs
lola: 81005513 markings, 132120807 edges, 67004 markings/sec, 960 secs
lola: 81363454 markings, 132697117 edges, 71588 markings/sec, 965 secs
lola: 81690639 markings, 133313842 edges, 65437 markings/sec, 970 secs
lola: 82027399 markings, 134002809 edges, 67352 markings/sec, 975 secs
lola: 82315123 markings, 134691408 edges, 57545 markings/sec, 980 secs
lola: 82670283 markings, 135399373 edges, 71032 markings/sec, 985 secs
lola: 83079985 markings, 136101991 edges, 81940 markings/sec, 990 secs
lola: 83389472 markings, 136824591 edges, 61897 markings/sec, 995 secs
lola: 83804626 markings, 137504745 edges, 83031 markings/sec, 1000 secs
lola: 84274818 markings, 138138250 edges, 94038 markings/sec, 1005 secs
lola: 84469570 markings, 138402411 edges, 38950 markings/sec, 1010 secs
lola: 84479015 markings, 138414890 edges, 1889 markings/sec, 1015 secs
lola: 84490867 markings, 138429892 edges, 2370 markings/sec, 1020 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: yes no unknown no yes no yes yes no no no no no no no no
lola:
preliminary result: yes no unknown no yes no yes yes no no no no no no no no
lola: memory consumption: 152308 KB
lola: time consumption: 1678 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished
BK_STOP 1590272048308
--------------------
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-S02J06T10"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="win2019"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool win2019"
echo " Input is PolyORBLF-PT-S02J06T10, 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 r135-tajo-158961408900113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-PT-S02J06T10.tgz
mv PolyORBLF-PT-S02J06T10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;